Quantum annealing for hard 2-SAT problems : Distribution and scaling of minimum energy gap and success probability

Abstract

In recent years, quantum annealing has gained the status of being a promising candidate for solving various optimization problems. Using a set of hard 2-satisfiabilty (2-SAT) problems, consisting of upto 18-variables problems, we analyze the scaling complexity of the quantum annealing algorithm and study the distributions of the minimum energy gap and the success probability. We extend the analysis of the standard quantum annealing Hamiltonian by introducing an additional term, the trigger Hamiltonian, which can be of two types : ferromagnetic and antiferromagnetic. We use these trigger Hamiltonians to study their influence on the success probability for solving the selected 2-SAT problems. We found that although the scaling of the run-time is exponential for the standard and modified quantum annealing Hamiltonians, the scaling constant in case of adding the trigger Hamiltonians can be significantly smaller. Furthermore, certain choices for the trigger Hamiltonian and annealing times can result in a better scaling than that for simulated annealing. Lastly, we also use the quantum annealers of D-Wave Systems Inc. to study their performance in solving the 2-SAT problems and compare it with the simulation results.

17 pages, 14 figures

References in corpus (10)

• Bounds for the adiabatic approximation with applications to quantum computation
• Prospects for Quantum Enhancement with Diabatic Quantum Annealing
• Quantum annealing with antiferromagnetic fluctuations
• Improving solutions by embedding larger subproblems in a D-Wave quantum annealer
• Exponential Speedup of Quantum Annealing by Inhomogeneous Driving of the Transverse Field
• Benchmarking Quantum Annealing Controls with Portfolio Optimization
• Scaling overhead of embedding optimization problems in quantum annealing
• GPU-accelerated simulations of quantum annealing and the quantum approximate optimization algorithm
• Quantum Annealing with Trigger Hamiltonians: Application to 2-SAT and Nonstoquastic Problems
• Improving nonstoquastic quantum annealing with spin-reversal transformations

Cited by in corpus (9)

• Guided quantum walk
• Unraveling Reverse Annealing: A Study of D-Wave Quantum Annealers
• Performance of quantum annealing for 2-SAT problems with multiple satisfying assignments
• Posiform Planting: Generating QUBO Instances for Benchmarking
• Increasing the Hardness of Posiform Planting Using Random QUBOs for Programmable Quantum Annealer Benchmarking
• Quantum-inspired dynamical models on quantum and classical annealers
• Benchmarking a heuristic Floquet adiabatic algorithm for the Max-Cut problem
• Quantum speed-up for solving the one-dimensional Hubbard model using quantum annealing
• Efficient Digital Quadratic Unconstrained Binary Optimization Solvers for SAT Problems