Quantum Annealing with Anneal Path Control: Application to 2-SAT Problems with Known Energy Landscapes

DOI10.4208/cicp.OA-2018-0257zbMath1504.68074arXiv1810.00194MaRDI QIDQ5161684

Christian Seidel, Hans De Raedt, Florian Neukart, Fengping Jin, Ting-Jui Hsu, Kristel Michielsen

Publication date: 1 November 2021

Published in: Communications in Computational Physics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1810.00194

zbMATH Keywords

quantum annealingadiabatic quantum computing2-SATD-waveanneal offset

Mathematics Subject Classification ID

Quantum computation (81P68) Closed and approximate solutions to the Schrödinger, Dirac, Klein-Gordon and other equations of quantum mechanics (81Q05) Quantum algorithms and complexity in the theory of computing (68Q12)

Related Items (2)

Quantum Implementation of Numerical Methods for Convection-Diffusion Equations: Toward Computational Fluid Dynamics ⋮ Benchmarking the quantum approximate optimization algorithm

Cites Work

• Optimization by Simulated Annealing
• Polynomial-time algorithm for simulation of weakly interacting quantum Spin systems
• Quantum Computation and Quantum Information
• A Quantum Adiabatic Evolution Algorithm Applied to Random Instances of an NP-Complete Problem
• Bounds for the adiabatic approximation with applications to quantum computation
• Adiabatic Quantum Computation Is Equivalent to Standard Quantum Computation
• Complexity of Stoquastic Frustration-Free Hamiltonians

This page was built for publication: Quantum Annealing with Anneal Path Control: Application to 2-SAT Problems with Known Energy Landscapes