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.
Building similarity graph...
Analyzing shared references across papers
Loading...
K. Takahashi
Shu Tanaka
Journal of the Physical Society of Japan
Keio University
Building similarity graph...
Analyzing shared references across papers
Loading...
Takahashi et al. (Mon,) studied this question.
www.synapsesocial.com/papers/698ebeb185a1ff6a93015fc7 — DOI: https://doi.org/10.7566/jpsj.95.034002