analiza aiqbench
This study proposes a heuristic variant of Quantum Amplitude Amplification (QAA) that significantly reduces circuit depth by allowing non-standard diffusion operator parameters. By targeting high cumulative probability across multiple shots rather than single-state maximization, the method effectively solves realistic traffic flow QUBO problems even with limited qubits and iterations. The approach offers a practical pathway to overcome current hardware constraints in combinatorial optimization without requiring massive classical pre-computation.
Heuristic Quantum Amplitude Amplification: A Traffic QUBO Case Study
arXiv:2609.13505v1 Announce Type: new Abstract: Quantum Amplitude Amplification (QAA), the generalization of Grover's algorithm, is well-positioned for combinatorial optimization and is particularly promising for Quadratic Unconstrained Binary Optimization (QUBO) problems. QAA is appealing due to its ability to drive the quantum system to a target state, yielding the globally optimal solution with probability over $90$+%. However, realizing QAA for application-scale optimization currently exceeds quantum hardware capacity, which is further compounded by unresolved algorithmic challenges regarding the choice of free parameters. In this study, we address these issues by utilizing a realistic traffic flow QUBO problem to investigate the implementation of QAA as a heuristic solver. Specifically, allowing the diffusion operator parameter to take non-$\pi$ values expands the capabilities of QAA. This unlocks a new multiple-shot, low-iteration strategy that aims for a high cumulative probability rather than maximizing the probability of a single basis state. Using $25$-qubit simulations, our results demonstrate that heuristic QAA addresses two of the main challenges cited in previous studies. Firstly, heuristic QAA works even at a single iteration, reducing circuit depth by orders of magnitude compared to standard QAA. And secondly, we show that the problem-dependent parameters necessary for reaching optimal algorithmic performance can be reliably approximated with minimal upfront classical computing overhead.
Abstract:Quantum Amplitude Amplification (QAA), the generalization of Grover's algorithm, is well-positioned for combinatorial optimization and is particularly promising for Quadratic Unconstrained Binary Optimization (QUBO) problems. QAA is appealing due to its ability to drive the quantum system to a target state, yielding the globally optimal solution with probability over $90$+%. However, realizing QAA for application-scale optimization currently exceeds quantum hardware capacity, which is further compounded by unresolved algorithmic challenges regarding the choice of free parameters. In this study, we address these issues by utilizing a realistic traffic flow QUBO problem to investigate the implementation of QAA as a heuristic solver. Specifically, allowing the diffusion operator parameter to take non-$\pi$ values expands the capabilities of QAA. This unlocks a new multiple-shot, low-iteration strategy that aims for a high cumulative probability rather than maximizing the probability of a single basis state. Using $25$-qubit simulations, our results demonstrate that heuristic QAA addresses two of the main challenges cited in previous studies. Firstly, heuristic QAA works even at a single iteration, reducing circuit depth by orders of magnitude compared to standard QAA. And secondly, we show that the problem-dependent parameters necessary for reaching optimal algorithmic performance can be reliably approximated with minimal upfront classical computing overhead.
arXiv:2609.13505 [quant-ph]
(or arXiv:2609.13505v1 [quant-ph] for this version)
https://doi.org/10.48550/arXiv.2609.13505 Focus to learn more arXiv-issued DOI via DataCite (pending registration)
arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.
Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.
Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.
Text integral sub licența deschisă a publicației · 293 cuvinte
Subiecte conexe

Lattice-Based Cryptography Explained
Quantum Zeitgeist · 15 aug. 2026

How Error-Mitigated Quantum Computers Are Reaching Beyond State-of-the-Art Classical Simulation
Qedma · 30 iul. 2026

Edward Farhi, The Physicist Behind QAOA
Quantum Zeitgeist · 30 aug. 2026

Lov Grover, The Engineer Who Taught Quantum Computers To Search
Quantum Zeitgeist · 1 aug. 2026