Quantum Annealing with Anneal Path Control: Application to 2-SAT Problems with Known Energy Landscapes
Year: 2019
Communications in Computational Physics, Vol. 26 (2019), Iss. 3 : pp. 928–946
Abstract
We study the effect of the anneal path control per qubit, a new user control feature offered on the D-Wave 2000Q quantum annealer, on the performance of quantum annealing for solving optimization problems by numerically solving the time-dependent Schrödinger equation for the time-dependent Hamiltonian modeling the annealing problems. The anneal path control is thereby modeled as a modified linear annealing scheme, resulting in an advanced and retarded scheme. The considered optimization problems are 2-SAT problems with 12 Boolean variables, a known unique ground state and a highly degenerate first excited state. We show that adjustment of the anneal path control can result in a widening of the minimal spectral gap by one or two orders of magnitude and an enhancement of the success probability of finding the solution of the optimization problem. We scrutinize various iterative methods based on the spin floppiness, the average spin value, and on the average energy and describe their performance in boosting the quantum annealing process.
Journal Article Details
Publisher Name: Global Science Press
Language: English
DOI: https://doi.org/10.4208/cicp.OA-2018-0257
Communications in Computational Physics, Vol. 26 (2019), Iss. 3 : pp. 928–946
Published online: 2019-01
AMS Subject Headings: Global Science Press
Copyright: COPYRIGHT: © Global Science Press
Pages: 19
Keywords: 2-SAT D-Wave anneal offset quantum annealing adiabatic quantum computing
-
Quantum annealing for hard 2-satisfiability problems: Distribution and scaling of minimum energy gap and success probability
Mehta, Vrinda | Jin, Fengping | De Raedt, Hans | Michielsen, KristelPhysical Review A, Vol. 105 (2022), Iss. 6
https://doi.org/10.1103/PhysRevA.105.062406 [Citations: 2] -
Quantum Technology and Optimization Problems
Assessing Solution Quality of 3SAT on a Quantum Annealing Platform
Gabor, Thomas | Zielinski, Sebastian | Feld, Sebastian | Roch, Christoph | Seidel, Christian | Neukart, Florian | Galter, Isabella | Mauerer, Wolfgang | Linnhoff-Popien, Claudia2019
https://doi.org/10.1007/978-3-030-14082-3_3 [Citations: 13] -
Why and When Pausing is Beneficial in Quantum Annealing
Chen, Huo | Lidar, Daniel A.Physical Review Applied, Vol. 14 (2020), Iss. 1
https://doi.org/10.1103/PhysRevApplied.14.014100 [Citations: 29] -
GPU-accelerated simulations of quantum annealing and the quantum approximate optimization algorithm
Willsch, Dennis | Willsch, Madita | Jin, Fengping | Michielsen, Kristel | De Raedt, HansComputer Physics Communications, Vol. 278 (2022), Iss. P.108411
https://doi.org/10.1016/j.cpc.2022.108411 [Citations: 13] -
Benchmarking the quantum approximate optimization algorithm
Willsch, Madita | Willsch, Dennis | Jin, Fengping | De Raedt, Hans | Michielsen, KristelQuantum Information Processing, Vol. 19 (2020), Iss. 7
https://doi.org/10.1007/s11128-020-02692-8 [Citations: 97] -
Posiform planting: generating QUBO instances for benchmarking
Hahn, Georg | Pelofske, Elijah | Djidjev, Hristo N.Frontiers in Computer Science, Vol. 5 (2023), Iss.
https://doi.org/10.3389/fcomp.2023.1275948 [Citations: 0] -
Quantum Technology and Optimization Problems
Boosting Quantum Annealing Performance Using Evolution Strategies for Annealing Offsets Tuning
Yarkoni, Sheir | Wang, Hao | Plaat, Aske | Bäck, Thomas2019
https://doi.org/10.1007/978-3-030-14082-3_14 [Citations: 6]