Heuristic QAA works even at a single iteration, reducing circuit depth by orders of magnitude compared to standard QAA, and 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.
This paper develops a Quantum optimisation Unit Commitment (UC) framework that benefits from Pauli Correlation Encoding (PCE) as a qubit reduction preprocessing technique and Sample-based Quantum Diagonalisation (SQD) as a hybrid post-processing refinement method. The UC problem is formulated in binary form, then trans...
Marc Carrillo-Muñoz, Sergio MartÍnez-Hermida, Sara Barja-Martínez et al.· 0 citations
This work performs approximate matrix product state simulations for up to 50 qubits and 100 layers and quantifies entanglement by the bond dimension, showing that, in this regime, a substantial fraction of the optimization power of QAOA survives even in the complete absence of entanglement.
B. Bantysh, A. Chernyavskiy, Denis A. Kulikov et al.· 0 citations
This work studies quantum random access optimization (QRAO), a special case of the Pauli correlation encoding (PCE) framework that assigns up to three binary variables to the Pauli observables of each qubit, with the packing choices determining the compressed Hamiltonian to be optimized.
It is found that the stability of the algorithm in the presence of noise is dependent on its variational parameters, and an upper bound on the total variation distance between the noisy and noiseless circuit output is derived as a function of these parameters.
Noise accumulation remains a central limitation on the reliable execution of quantum algorithms. This study analyzes the sensitivity of Deutsch’s algorithm to global depolarizing noise using the density-matrix formalism. First, a general analytical expression is derived for the success probability of a quantum circuit...
Jia-Rui Shang· International Journal of App...· 0 citations
Quantum-inspired evolutionary optimization (QIEO) represents design variables as a set of qubits and searches a continuous, multi-dimensional landscape through rotation of the qubit's amplitude pair. Every generation rotates those amplitudes toward a single elite, which corresponds to that generation's best. The update...
R. Govind, F. Bosco, K. Srikanth et al.· arXiv.org· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.