Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:2003.07374 · Physical review. D/Physical review. D.

Quantum computing for quantum tunneling

Steven Adam Abel, Nicholas Chancellor, Michael Spannowsky

Published Jan 11, 2021• 52 citations
arXivHTMLPDF

Abstract

We demonstrate how quantum field theory problems can be practically encoded by using a discretization of the field theory problem into a general Ising model, with the continuous field values being encoded into Ising spin chains. To illustrate the method, and as a simple proof of principle, we use a (hybrid) quantum annealer to recover the correct profile of the thin-wall tunnelling solution. This method is applicable to many nonperturbative problems.

DOI
10.1103/physrevd.103.016008

Related papers

Quantum-Field-Theoretic Simulation Platform for Observing the Fate of the False Vacuum

Steven Adam Abel, Michael Spannowsky

We design and implement a quantum annealing simulation platform to observe and study dynamical processes in quantum field theory (QFT).Our approach encodes the field theory as an Ising model, which is then solved by a quantum annealer.As a proof of concept, we encode a scalar field theory and measure the probability for it to tunnel from the false vacuum to the true vacuum for various tunneling times, vacuum displacements, and potential profiles.The results are in accord with those predicted theoretically, showing that a quantum annealer is a promising platform for encoding QFTs.This is the first time it has been possible to measure instanton processes across a freely chosen QFT energy barrier.We argue that this novel and flexible method to study the dynamics of quantum systems has potential application to many field theories of interest.Measurements of the dynamical behavior of such encoded field theories are independent of theoretical calculations and can be used to infer their properties without being limited by the availability of suitable perturbative or nonperturbative computational methods.Soon, measurements using such a quantum annealing simulation platform could therefore be used to improve theoretical and computational methods conceptually and may enable the measurement and detailed study of previously unobserved quantum phenomena.

arXiv:2006.06003•PRX Quantum•Mar 24, 2021•76 citations

Optimization of quantum computing models inspired by D-wave quantum annealing

Baonan Wang, Feng Hu, Chao Wang

With the slow progress of universal quantum computers, studies on the feasibility of optimization by a dedicated and quantum-annealing-based annealer are important. The quantum principle is expected to utilize the quantum tunneling effects to find the optimal solutions for the exponential-level problems while classical annealing may be affected by the initializations. This study constructs a new Quantum-Inspired Annealing (QIA) framework to explore the potentials of quantum annealing for solving Ising model with comparisons to the classical one. Through various configurations of the 1D Ising model, the new framework can achieve ground state, corresponding to the optimum of classical problems, with higher probability up to 28% versus classical counterpart (22% in case). This condition not only reveals the potential of quantum annealing for solving the Ising-like Hamiltonian, but also contributes to an improved understanding and use of the quantum annealer for various applications in the future.

Tsinghua Science & Technology•Jun 12, 2020•13 citations

Quantum optimization of complex systems with a quantum annealer

Steven Adam Abel, Andrew Blance, Michael Spannowsky

We perform an in-depth comparison of quantum annealing with several classical optimization techniques, namely, thermal annealing, Nelder-Mead, and gradient descent. The focus of our study is large quasicontinuous potentials that must be encoded using a domain wall encoding. To do this, it is important to first understand the properties of a system that is discretely encoded onto an annealer, in terms of its quantum phases, and the importance of thermal versus quantum effects. We therefore begin with a direct study of the 2D Ising model on a quantum annealer, and compare its properties directly with those of the thermal 2D Ising model. These properties include an Ising-like phase transition that can be induced by either a change in ``quantumness'' of the theory (by way of the transverse field component on the annealer), or by scaling the Ising couplings up or down. This behavior is in accord with what is expected from the physical understanding of the quantum system. We then go on to demonstrate the efficacy of the quantum annealer at minimizing several increasingly hard two-dimensional potentials. For all potentials, we find the general behavior that Nelder-Mead and gradient descent methods are very susceptible to becoming trapped in false minima, while the thermal anneal method is somewhat better at discovering the true minimum. However, and despite current limitations on its size, the quantum annealer performs a minimization very markedly better than any of these classical techniques. A quantum anneal can be designed so the system almost never gets trapped in a false minimum, and rapidly and successfully minimizes the potentials.

arXiv:2105.13945•Physical Review A•Oct 10, 2022•34 citations

Effectively Encoding SAT and Other Intractable Problems into Ising Models for Quantum Computing

Stefano Varotti

Quantum computing theory posits that a computer exploiting quantum mechanics can be strictly more powerful than classical models. Several quantum computing devices are under development, but current technology is limited by noise sensitivity. Quantum Annealing is an alternative approach that uses a noisy quantum system to solve a particular optimization problem. Problems such as SAT and MaxSAT need to be encoded to make use of quantum annealers. Encoding SAT and MaxSAT problems while respecting the constraints and limitations of current hardware is a difficult task. This thesis presents an approach to encoding SAT and MaxSAT problems that is able to encode bigger and more interesting problems for quantum annealing. A software implementation and preliminary evaluation of the method are described.

•Jan 1, 2019•0 citations

Can a quantum computer simulate quantum field theory – efficiently?

Daria Ahrensmeier

The question posed in the title is discussed from a conceptual point of view. Typical complex problems in quantum field theory are described, the basic principles of quantum computing and simulation are explained and illustrated by examples, and suggestions for further investigations are made.PACS Nos.: 03.67.Lx, 11.10.–z

Canadian Journal of Physics•Apr 1, 2008•0 citations

Simulating Strongly Coupled Quantum Field Theory with Quantum Algorithms

Nonperturbative quantum field theory problems can often be difficult to solve with classical algorithms. Researchers now develop quantum computing algorithms to understand such problems in the Hamiltonian formalism.

JPS Hot Topics•Jan 1, 2022•0 citations
We demonstrate how quantum field theory problems can be practically encoded by using a discretization of the field theory problem into a general Ising model, with the continuous field values being encoded into Ising spin chains. To illustrate the method, and as a simple proof of principle, we use a (hybrid) quantum annealer to recover the correct profile of the thin-wall tunnelling solution. This method is applicable to many nonperturbative problems.
We design and implement a quantum annealing simulation platform to observe and study dynamical processes in quantum field theory (QFT).Our approach encodes the field theory as an Ising model, which is then solved by a quantum annealer.As a proof of concept, we encode a scalar field theory and measure the probability for it to tunnel from the false vacuum to the true vacuum for various tunneling times, vacuum displacements, and potential profiles.The results are in accord with those predicted theoretically, showing that a quantum annealer is a promising platform for encoding QFTs.This is the first time it has been possible to measure instanton processes across a freely chosen QFT energy barrier.We argue that this novel and flexible method to study the dynamics of quantum systems has potential application to many field theories of interest.Measurements of the dynamical behavior of such encoded field theories are independent of theoretical calculations and can be used to infer their properties without being limited by the availability of suitable perturbative or nonperturbative computational methods.Soon, measurements using such a quantum annealing simulation platform could therefore be used to improve theoretical and computational methods conceptually and may enable the measurement and detailed study of previously unobserved quantum phenomena.
With the slow progress of universal quantum computers, studies on the feasibility of optimization by a dedicated and quantum-annealing-based annealer are important. The quantum principle is expected to utilize the quantum tunneling effects to find the optimal solutions for the exponential-level problems while classical annealing may be affected by the initializations. This study constructs a new Quantum-Inspired Annealing (QIA) framework to explore the potentials of quantum annealing for solving Ising model with comparisons to the classical one. Through various configurations of the 1D Ising model, the new framework can achieve ground state, corresponding to the optimum of classical problems, with higher probability up to 28% versus classical counterpart (22% in case). This condition not only reveals the potential of quantum annealing for solving the Ising-like Hamiltonian, but also contributes to an improved understanding and use of the quantum annealer for various applications in the future.
We perform an in-depth comparison of quantum annealing with several classical optimization techniques, namely, thermal annealing, Nelder-Mead, and gradient descent. The focus of our study is large quasicontinuous potentials that must be encoded using a domain wall encoding. To do this, it is important to first understand the properties of a system that is discretely encoded onto an annealer, in terms of its quantum phases, and the importance of thermal versus quantum effects. We therefore begin with a direct study of the 2D Ising model on a quantum annealer, and compare its properties directly with those of the thermal 2D Ising model. These properties include an Ising-like phase transition that can be induced by either a change in ``quantumness'' of the theory (by way of the transverse field component on the annealer), or by scaling the Ising couplings up or down. This behavior is in accord with what is expected from the physical understanding of the quantum system. We then go on to demonstrate the efficacy of the quantum annealer at minimizing several increasingly hard two-dimensional potentials. For all potentials, we find the general behavior that Nelder-Mead and gradient descent methods are very susceptible to becoming trapped in false minima, while the thermal anneal method is somewhat better at discovering the true minimum. However, and despite current limitations on its size, the quantum annealer performs a minimization very markedly better than any of these classical techniques. A quantum anneal can be designed so the system almost never gets trapped in a false minimum, and rapidly and successfully minimizes the potentials.
Quantum computing theory posits that a computer exploiting quantum mechanics can be strictly more powerful than classical models. Several quantum computing devices are under development, but current technology is limited by noise sensitivity. Quantum Annealing is an alternative approach that uses a noisy quantum system to solve a particular optimization problem. Problems such as SAT and MaxSAT need to be encoded to make use of quantum annealers. Encoding SAT and MaxSAT problems while respecting the constraints and limitations of current hardware is a difficult task. This thesis presents an approach to encoding SAT and MaxSAT problems that is able to encode bigger and more interesting problems for quantum annealing. A software implementation and preliminary evaluation of the method are described.