Eviden showcases Qaptiva at the 22nd EU/ME x Quantum Computing School Optimization event: Revolutionizing problem-solving with quantum and metaheuristic techniques.
Eviden is proud to take part in the event, a major European gathering focused on metaheuristics and quantum computing. On this occasion, we are highlighting Qaptiva, our Quantum Computing Solutions to empower your business | Eviden
This year, designated by UNESCO as the International Year of Quantum Science and Technology, holds special significance, and we are proud to support and contribute to the advancement of quantum computing via these events.
Why Attend?
Explore Qaptiva™ – a comprehensive NISQ computing environment that brings together all the essential tools to program using leading quantum paradigms: gate-based, annealing, and analog. With Qaptiva, users can develop, optimize, and emulate large-scale quantum algorithms—noisy or noise-free—locally or in the cloud. Our hardware-agnostic approach also enables efficient hybridization between high-performance computing (HPC) and quantum systems.
Join our experts to our speaking sessions
Hands-on workshop
Quantum programming with Qaptiva
Date
Wednesday, September 10
4:15 – 6:15 PM
Speaker
Join Dean Smith from Eviden for a practical session on quantum programming and emulation using the Qaptiva platform. Ideal for students eager to dive into quantum computing.
Talk
Qaptiva: A platform for Quantum challenges
Date
Thursday, September 11
1:45 – 2:00 PM
Speaker
Ingo Seipp will present Eviden’s strategic vision for quantum computing and how Qaptiva addresses real-world challenges through hybrid integration and innovation.
Engage with Experts
Take the opportunity to connect with Eviden’s quantum specialists and explore the critical role of quantum emulation and hybridization in today’s rapidly evolving tech landscape.
We look forward to seeing you at the event!
September 10-12, 2025
Fraunhofer-Platz 1, 67663 Kaiserslautern, Germany
Related link
Event location
Fraunhofer-Platz 1, 67663 Kaiserslautern, Germany