Quantitative analysis of the effectiveness of mid-anneal measurement in quantum annealing
arXiv:2507.20318 · doi:10.7566/JPSJ.95.034002
Abstract
Quantum annealing is a promising metaheuristic for solving constrained combinatorial optimization problems. However, parameter tuning difficulties and hardware noise often prevent optimal solutions from being properly encoded as the ground states of the problem Hamiltonian. This study investigates mid-anneal measurement as a mitigation approach for such situations, analyzing its effectiveness and underlying physical mechanisms. We introduce a quantitative metric to evaluate the effectiveness of mid-anneal measurement and apply it to the graph bipartitioning problem and the quadratic knapsack problem. Our findings reveal that mid-anneal measurement is most effective when the energy difference between desired solutions and ground states is small, with effectiveness strongly governed by the energy structure. Furthermore, the effectiveness increases as the Hamming distance between the ground and excited states gets small, highlighting the role of state similarity. Analysis of fully-connected Ising models demonstrates that the effectiveness of mid-anneal measurement persists with increasing system size, indicating its scalability and practical applicability to large-scale quantum annealing.
arXiv comment12 pages, 8 figures
References in corpus (27)
- Ising formulations of many NP problems
- Quantum Annealing in the Transverse Ising Model
- QuTiP 2: A Python framework for the dynamics of open quantum systems
- QuTiP: An open-source Python framework for the dynamics of open quantum systems
- Quantum Annealing and Analog Quantum Computation
- Observation of topological phenomena in a programmable lattice of 1,800 qubits
- Searching for quantum speedup in quasistatic quantum annealers
- Benchmarking Advantage and D-Wave 2000Q quantum annealers with exact cover problems
- Beyond-classical computation in quantum simulation
- Traffic Signal Optimization on a Square Lattice with Quantum Annealing
- Benchmarking Quantum Annealing Controls with Portfolio Optimization
- Temperature and Disorder Chaos in Three-Dimensional Ising Spin Glasses
- Chaos and Universality in a Four-Dimensional Spin Glass
- Polymer Physics by Quantum Computing
- Travel time optimization on multi-AGV routing by reverse annealing
- Quantum annealing applications, challenges and limitations for optimisation problems compared to classical solvers
- Enhancing Quantum Annealing Performance for the Molecular Similarity Problem
- Analog Errors in Ising Machines
- An energetic perspective on rapid quenches in quantum annealing
- A double-slit proposal for quantum annealing
- Correlation-diversified portfolio construction by finding maximum independent set in large-scale market graph
- Annealing-Assisted Column Generation for Inequality-Constrained Combinatorial Optimization Problems
- Error measurements for a quantum annealer using the one-dimensional Ising model with twisted boundaries
- Quantum annealing approach to Ionic Diffusion in Solid
- The quantum annealing gap and quench dynamics in the exact cover problem
- Speeding up Quantum Annealing with Engineered Dephasing
- Impact of Fixing Spins in a Quantum Annealer with Energy Rescaling