Improving the efficiency of quantum annealing with controlled diagonal catalysts
arXiv:2503.15244 · doi:10.1103/vff6-cf7c
Abstract
Quantum annealing is a promising algorithm for solving combinatorial optimization problems. It searches for the ground state of the Ising model, which corresponds to the optimal solution of a given combinatorial optimization problem. The guiding principle of quantum annealing is the adiabatic theorem in quantum mechanics, which guarantees that a system remains in the ground state of its Hamiltonian if the time evolution is sufficiently slow. According to the adiabatic theorem, the annealing time required for quantum annealing to satisfy the adiabaticity scales inversely proportional to the square of the minimum energy gap between the ground state and the first excited state during time evolution. As a result, finding the ground state becomes significantly more difficult when the energy gap is small, creating a major bottleneck in quantum annealing. Expanding the energy gap is one strategy for improving the performance of quantum annealing; however, its implementation in actual hardware remains difficult. This study proposes a method for efficiently solving instances with small energy gaps by introducing additional local terms to the Hamiltonian and exploiting the diabatic transition remaining in the small energy gap. The proposed method achieves an approximate quadratic speedup of the exponential scaling exponent in time to solution compared to the conventional quantum annealing. In addition, we investigate the transferability of the parameters obtained with the proposed method.
References in corpus (40)
- 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
- Adiabatic Quantum Computing
- Quantum annealing with more than one hundred qubits
- Fast optimal frictionless atom cooling in harmonic traps
- Defining and detecting quantum speedup
- Observation of topological phenomena in a programmable lattice of 1,800 qubits
- Minor-embedding in adiabatic quantum computation: II. Minor-universal graph design
- Anderson localization casts clouds over adiabatic quantum optimization
- Expanding the horizon of automated metamaterials discovery via quantum annealing
- Quantum Speedup by Quantum Annealing
- Shortcut to Adiabaticity in the Lipkin-Meshkov-Glick Model
- Quantum annealing with antiferromagnetic fluctuations
- Optimal Protocols in Quantum Annealing and QAOA Problems
- Improving solutions by embedding larger subproblems in a D-Wave quantum annealer
- Parameter Transfer for Quantum Approximate Optimization of Weighted MaxCut
- Domain wall encoding of discrete variables for quantum annealing and QAOA
- Exponential Speedup of Quantum Annealing by Inhomogeneous Driving of the Transverse Field
- Quantum annealing of the -spin model under inhomogeneous transverse field driving
- Effective optimization using sample persistence: A case study on quantum annealers and various Monte Carlo optimization methods
- Application of QUBO solver using black-box optimization to structural design for resonance avoidance
- Towards optimization of photonic-crystal surface-emitting lasers via quantum annealing
- Hybrid Quantum Annealing via Molecular Dynamics
- Designing Quantum Annealing Schedules using Bayesian Optimization
- Boosting quantum annealer performance via sample persistence
- Shortcuts to adiabaticity: theoretical framework, relations between different methods, and versatile approximations
- Shortcuts to adiabaticity in the infinite-range Ising model by mean-field counter-diabatic driving
- Quantum Computing by Cooling
- Diabatic Quantum Annealing for the Frustrated Ring Model
- Few-qubit quantum refrigerator for cooling a multi-qubit system
- Diagonal Catalysts in Quantum Adiabatic Optimization
- Hybrid Optimization Method Using Simulated-Annealing-Based Ising Machine and Quantum Annealer
- Post-processing variationally scheduled quantum algorithm for constrained combinatorial optimization problems
- Implementation of spectral methods on Ising machines: toward flow simulations on quantum annealer
- Eigenvalue-invariant transformation of Ising problem for anti-crossing mitigation in quantum annealing
- Advantages of fixing spins in quantum annealing
- Impact of Fixing Spins in a Quantum Annealer with Energy Rescaling
- A thermodynamic approach to optimization in complex quantum systems