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:2005.07511 · Communications Physics

Quantum annealing using vacuum states as effective excited states of driven systems

Hayato Goto, Taro Kanao

Published Dec 18, 2020• 32 citations
arXivHTMLPDF

Abstract

Abstract Quantum annealing, which is particularly useful for combinatorial optimization, becomes more powerful by using excited states, in addition to ground states. However, such excited-state quantum annealing is prone to errors due to dissipation. Here we propose excited-state quantum annealing started with the most stable state, i.e., vacuum states. This counterintuitive approach becomes possible by using effective energy eigenstates of driven quantum systems. To demonstrate this concept, we use a network of Kerr-nonlinear parametric oscillators, where we can start excited-state quantum annealing with the vacuum state of the network by appropriately setting initial detuning frequencies for the oscillators. By numerical simulations of four oscillators, we show that the present approach can solve some hard instances whose optimal solutions cannot be obtained by standard ground-state quantum annealing because of energy-gap closing. In this approach, a nonadiabatic transition at an energy-gap closing point is rather utilized. We also show that this approach is robust against errors due to dissipation, as expected, compared to quantum annealing started with physical excited (i.e., nonvacuum) states. These results open new possibilities for quantum computation and driven quantum systems.

DOI
10.1038/s42005-020-00502-2

Related papers

Improving the efficiency of quantum annealing with controlled diagonal catalysts

T Hattori, Shu Tanaka

Quantum annealing is a promising algorithm for solving combinatorial optimization problems. It searches for the ground state of the Ising model, which corresponds to the optimal solution of a given combinatorial optimization problem. The guiding principle of quantum annealing is the adiabatic theorem in quantum mechanics, which guarantees that a system remains in the ground state of its Hamiltonian if the time evolution is sufficiently slow. According to the adiabatic theorem, the annealing time required for quantum annealing to satisfy the adiabaticity scales inversely proportional to the square of the minimum energy gap between the ground state and the first excited state during time evolution. As a result, finding the ground state becomes significantly more difficult when the energy gap is small, creating a major bottleneck in quantum annealing. Expanding the energy gap is one strategy for improving the performance of quantum annealing; however, its implementation in actual hardware remains difficult. This study proposes a method for efficiently solving instances with small energy gaps by introducing additional local terms to the Hamiltonian and exploiting the diabatic transition remaining in the small energy gap. The proposed method achieves an approximate quadratic speedup of the exponential scaling exponent in time to solution compared to the conventional quantum annealing. In addition, we investigate the transferability of the parameters obtained with the proposed method.

arXiv:2503.15244•Physical Review A•Feb 3, 2026•4 citations

Diabatic quantum annealing for the frustrated ring model

Jeremy Côté, Frédéric Sauvage, Martín Larocca +3 more

Abstract Quantum annealing (QA) is a continuous-time heuristic quantum algorithm for solving or approximately solving classical optimization problems. The algorithm uses a schedule to interpolate between a driver Hamiltonian with an easy-to-prepare ground state and a problem Hamiltonian whose ground state encodes solutions to an optimization problem. The standard implementation relies on the evolution being adiabatic: keeping the system in the instantaneous ground state with high probability and requiring a time scale inversely related to the minimum energy gap between the instantaneous ground and excited states. However, adiabatic evolution can lead to evolution times that scale exponentially with the system size, even for computationally simple problems. Here, we study whether non-adiabatic evolutions with optimized annealing schedules can bypass this exponential slowdown for one such class of problems called the frustrated ring model. For sufficiently optimized annealing schedules and system sizes of up to 39 qubits, we provide numerical evidence that we can avoid the exponential slowdown. Our work highlights the potential of highly-controllable QA to circumvent bottlenecks associated with the standard implementation of QA.

arXiv:2212.02624•Quantum Science and Technology•Sep 20, 2023•15 citations

Bifurcation-based adiabatic quantum computation with a nonlinear oscillator network

Hayato Goto

The dynamics of nonlinear systems qualitatively change depending on their parameters, which is called bifurcation. A quantum-mechanical nonlinear oscillator can yield a quantum superposition of two oscillation states, known as a Schrödinger cat state, via quantum adiabatic evolution through its bifurcation point. Here we propose a quantum computer comprising such quantum nonlinear oscillators, instead of quantum bits, to solve hard combinatorial optimization problems. The nonlinear oscillator network finds optimal solutions via quantum adiabatic evolution, where nonlinear terms are increased slowly, in contrast to conventional adiabatic quantum computation or quantum annealing, where quantum fluctuation terms are decreased slowly. As a result of numerical simulations, it is concluded that quantum superposition and quantum fluctuation work effectively to find optimal solutions. It is also notable that the present computer is analogous to neural computers, which are also networks of nonlinear components. Thus, the present scheme will open new possibilities for quantum computation, nonlinear science, and artificial intelligence.

arXiv:1510.02566•Scientific Reports•Feb 22, 2016•251 citations

Direct estimation of the energy gap between the ground state and excited state with quantum annealing

Yuichiro Matsuzaki, Hideaki Hakoshima, Kenji Sugisaki +2 more

Abstract In quantum chemistry, it is important to estimate an energy gap between a ground state and an excited state of molecular Hamiltonians. In previous researches, it was necessary to measure the energy of the ground state and that of the excited state separately, and the energy gap was estimated from the subtraction between them. Here, we show a novel scheme to estimate such an energy gap in a more direct manner. We use a concept of a Ramsey type measurement in the quantum annealing (QA) for such a direct estimation of the energy gap. In our scheme, the measured signal oscillates with a frequency of the energy gap. To study the performance of our scheme, we perform numerical simulations. The results show our scheme is robust against non-adiabatic transitions between the ground state and first excited state. Our scheme paves the way for the practical application of QA in quantum chemistry.

arXiv:2007.10561•Japanese Journal of Applied Physics•Jan 22, 2021•23 citations

Frustration-enhanced quantum annealing correction models with additional inter-replica interactions

Anonymous, Shu Tanaka

Quantum annealing correction (QAC) models provide a promising approach for mitigating errors in quantum annealers. Previous studies have established that QAC models are crucial for ensuring the robustness of the ground state of the Ising model on hardware. In this work, the effects of QAC models incorporating replicas with additional interactions, specifically, the and the , are investigated for problems characterized by a small energy gap between the ground and first excited states during quantum annealing, a well-known bottleneck to reaching the ground state. The results demonstrate that these QAC models can obtain the optimal solution within short annealing times by exploiting diabatic transitions, even for problems with a small energy gap. These findings highlight the potential of QAC models as practical near-term algorithms for hardware subject to runtime limitations and control noise.

arXiv:2509.11217•Physical Review A•Aug 14, 2026•2 citations

Bifurcation-based adiabatic quantum computation with a nonlinear oscillator network

Hayato Goto

The dynamics of nonlinear systems qualitatively change depending on their parameters, which is called bifurcation. A quantum-mechanical nonlinear oscillator can yield a quantum superposition of two oscillation states, known as a Schrodinger cat state, via quantum adiabatic evolution through its bifurcation point. Here we propose a quantum computer comprising such quantum nonlinear oscillators, instead of quantum bits, to solve hard combinatorial optimization problems. The nonlinear oscillator network finds optimal solutions via quantum adiabatic evolution, where nonlinear terms are increased slowly, in contrast to conventional adiabatic quantum computation or quantum annealing, where quantum fluctuation terms are decreased slowly. As a result of numerical simulations, it is concluded that quantum superposition and quantum fluctuation work effectively to find optimal solutions. It is also notable that the present computer is analogous to neural computers, which are also networks of nonlinear components. Thus, the present scheme will open new possibilities for quantum computation, nonlinear science, and artificial intelligence.

Bulletin of the American Physical Society•Mar 15, 2016•0 citations
Abstract Quantum annealing, which is particularly useful for combinatorial optimization, becomes more powerful by using excited states, in addition to ground states. However, such excited-state quantum annealing is prone to errors due to dissipation. Here we propose excited-state quantum annealing started with the most stable state, i.e., vacuum states. This counterintuitive approach becomes possible by using effective energy eigenstates of driven quantum systems. To demonstrate this concept, we use a network of Kerr-nonlinear parametric oscillators, where we can start excited-state quantum annealing with the vacuum state of the network by appropriately setting initial detuning frequencies for the oscillators. By numerical simulations of four oscillators, we show that the present approach can solve some hard instances whose optimal solutions cannot be obtained by standard ground-state quantum annealing because of energy-gap closing. In this approach, a nonadiabatic transition at an energy-gap closing point is rather utilized. We also show that this approach is robust against errors due to dissipation, as expected, compared to quantum annealing started with physical excited (i.e., nonvacuum) states. These results open new possibilities for quantum computation and driven quantum systems.
Quantum annealing is a promising algorithm for solving combinatorial optimization problems. It searches for the ground state of the Ising model, which corresponds to the optimal solution of a given combinatorial optimization problem. The guiding principle of quantum annealing is the adiabatic theorem in quantum mechanics, which guarantees that a system remains in the ground state of its Hamiltonian if the time evolution is sufficiently slow. According to the adiabatic theorem, the annealing time required for quantum annealing to satisfy the adiabaticity scales inversely proportional to the square of the minimum energy gap between the ground state and the first excited state during time evolution. As a result, finding the ground state becomes significantly more difficult when the energy gap is small, creating a major bottleneck in quantum annealing. Expanding the energy gap is one strategy for improving the performance of quantum annealing; however, its implementation in actual hardware remains difficult. This study proposes a method for efficiently solving instances with small energy gaps by introducing additional local terms to the Hamiltonian and exploiting the diabatic transition remaining in the small energy gap. The proposed method achieves an approximate quadratic speedup of the exponential scaling exponent in time to solution compared to the conventional quantum annealing. In addition, we investigate the transferability of the parameters obtained with the proposed method.
Abstract Quantum annealing (QA) is a continuous-time heuristic quantum algorithm for solving or approximately solving classical optimization problems. The algorithm uses a schedule to interpolate between a driver Hamiltonian with an easy-to-prepare ground state and a problem Hamiltonian whose ground state encodes solutions to an optimization problem. The standard implementation relies on the evolution being adiabatic: keeping the system in the instantaneous ground state with high probability and requiring a time scale inversely related to the minimum energy gap between the instantaneous ground and excited states. However, adiabatic evolution can lead to evolution times that scale exponentially with the system size, even for computationally simple problems. Here, we study whether non-adiabatic evolutions with optimized annealing schedules can bypass this exponential slowdown for one such class of problems called the frustrated ring model. For sufficiently optimized annealing schedules and system sizes of up to 39 qubits, we provide numerical evidence that we can avoid the exponential slowdown. Our work highlights the potential of highly-controllable QA to circumvent bottlenecks associated with the standard implementation of QA.
The dynamics of nonlinear systems qualitatively change depending on their parameters, which is called bifurcation. A quantum-mechanical nonlinear oscillator can yield a quantum superposition of two oscillation states, known as a Schrödinger cat state, via quantum adiabatic evolution through its bifurcation point. Here we propose a quantum computer comprising such quantum nonlinear oscillators, instead of quantum bits, to solve hard combinatorial optimization problems. The nonlinear oscillator network finds optimal solutions via quantum adiabatic evolution, where nonlinear terms are increased slowly, in contrast to conventional adiabatic quantum computation or quantum annealing, where quantum fluctuation terms are decreased slowly. As a result of numerical simulations, it is concluded that quantum superposition and quantum fluctuation work effectively to find optimal solutions. It is also notable that the present computer is analogous to neural computers, which are also networks of nonlinear components. Thus, the present scheme will open new possibilities for quantum computation, nonlinear science, and artificial intelligence.
Abstract In quantum chemistry, it is important to estimate an energy gap between a ground state and an excited state of molecular Hamiltonians. In previous researches, it was necessary to measure the energy of the ground state and that of the excited state separately, and the energy gap was estimated from the subtraction between them. Here, we show a novel scheme to estimate such an energy gap in a more direct manner. We use a concept of a Ramsey type measurement in the quantum annealing (QA) for such a direct estimation of the energy gap. In our scheme, the measured signal oscillates with a frequency of the energy gap. To study the performance of our scheme, we perform numerical simulations. The results show our scheme is robust against non-adiabatic transitions between the ground state and first excited state. Our scheme paves the way for the practical application of QA in quantum chemistry.
Quantum annealing correction (QAC) models provide a promising approach for mitigating errors in quantum annealers. Previous studies have established that QAC models are crucial for ensuring the robustness of the ground state of the Ising model on hardware. In this work, the effects of QAC models incorporating replicas with additional interactions, specifically, the and the , are investigated for problems characterized by a small energy gap between the ground and first excited states during quantum annealing, a well-known bottleneck to reaching the ground state. The results demonstrate that these QAC models can obtain the optimal solution within short annealing times by exploiting diabatic transitions, even for problems with a small energy gap. These findings highlight the potential of QAC models as practical near-term algorithms for hardware subject to runtime limitations and control noise.
The dynamics of nonlinear systems qualitatively change depending on their parameters, which is called bifurcation. A quantum-mechanical nonlinear oscillator can yield a quantum superposition of two oscillation states, known as a Schrodinger cat state, via quantum adiabatic evolution through its bifurcation point. Here we propose a quantum computer comprising such quantum nonlinear oscillators, instead of quantum bits, to solve hard combinatorial optimization problems. The nonlinear oscillator network finds optimal solutions via quantum adiabatic evolution, where nonlinear terms are increased slowly, in contrast to conventional adiabatic quantum computation or quantum annealing, where quantum fluctuation terms are decreased slowly. As a result of numerical simulations, it is concluded that quantum superposition and quantum fluctuation work effectively to find optimal solutions. It is also notable that the present computer is analogous to neural computers, which are also networks of nonlinear components. Thus, the present scheme will open new possibilities for quantum computation, nonlinear science, and artificial intelligence.