Impact of Fixing Spins in a Quantum Annealer with Energy Rescaling
arXiv:2502.01008 · doi:10.7566/JPSJ.94.074001
Abstract
Quantum annealing is a promising algorithm for solving combinatorial optimization problems. However, various hardware restrictions significantly impede its efficient performance. Size-reduction methods provide an effective approach for addressing large-scale problems but often introduce additional challenges. A notable hardware restriction is the limited number of decision variables quantum annealing can handle compared to the size of the problem. Moreover, when employing size-reduction methods, the interactions and local magnetic fields in the Ising model--used to represent the combinatorial optimization problem--can become excessively large, making them difficult to implement on hardware. Although prior studies suggest that energy rescaling impacts the performance of quantum annealing, its interplay with size-reduction methods remains unexplored. This study examines the relationship between fixing spins, a promising size-reduction method, and the effects of energy rescaling. Numerical simulations and experiments conducted on a quantum annealer demonstrate that the fixing spins method enhances quantum annealing performance while preserving the spin-chain embedding for a homogeneous, fully connected ferromagnetic Ising model.
References in corpus (11)
- Minor-embedding in adiabatic quantum computation: II. Minor-universal graph design
- Benchmarking Quantum Annealing Controls with Portfolio Optimization
- Many-body transverse interactions in the quantum annealing of the p-spin ferromagnet
- 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
- Benchmark test of Black-box optimization using D-Wave quantum annealer
- Towards optimization of photonic-crystal surface-emitting lasers via quantum annealing
- Efficient Algorithm for Binary Quadratic Problem by Column Generation and Quantum Annealing
- Annealing-Assisted Column Generation for Inequality-Constrained Combinatorial Optimization Problems
- Hybrid Optimization Method Using Simulated-Annealing-Based Ising Machine and Quantum Annealer
- Advantages of fixing spins in quantum annealing