EURO-Online login
- New to EURO? Create an account
- I forgot my username and/or my password.
- Help with cookies
(important for IE8 users)
3535. Analog Quantum Computing for Combinatorial Optimization Problems
Invited abstract in session MC-42: Quantum Computing for Discrete and Combinatorial Optimization, stream Quantum Computing Optimization.
Monday, 12:30-14:00Room: 98 (building: 306)
Authors (first author is the speaker)
1. | M. Yassine NAGHMOUCHI
|
PASQAL | |
2. | Wesley Coelho
|
PASQAL |
Abstract
In this proposed talk, we delve into the promising realm of quantum computing, specifically focusing on the utilization of neutral atom-based Quantum Processing Units (QPUs) and analog quantum computing methodologies to tackle combinatorial problems. We will discuss how neutral atom-based QPUs, with their precise control and manipulation capabilities, provide a robust platform for quantum computation. Practical examples and case studies will be presented to demonstrate the efficacy and potential of these quantum computing approaches. Additionally, we will discuss the current state of research, challenges, and future prospects in this rapidly evolving field.
Keywords
- Algorithms
- Modeling Systems and Languages
- Programming, Quadratic
Status: accepted
Back to the list of papers