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:2609.33975

Swapping Quantum Annealing Errors into a Cavity

Hao Zhang

quant-phcond-mat.dis-nncond-mat.stat-mechSubmitted Sep 27, 2026• Announced Sep 29, 2026• 0 citations
arXivHTMLPDF

Abstract

Quantum annealing is a promising form of quantum computation, but it slows down at a small energy gap $Δ$ during the anneal, and the errors it makes there remain undetected. We introduce cavity quantum annealing, in which a cavity mode of frequency $O(1)\ggΔ$, coupled mid-schedule, swaps these errors into photons. In the $p$-spin model, this reduces the annealing time to nearly the square root of that required without the cavity. Moreover, counting the photons certifies the result: high-photon runs, with an $O(1)$ yield, reach a ground-state fidelity above $99.99\%$ orders of magnitude sooner, a gain that grows exponentially with system size. A pre-loaded photon instead runs the swap in reverse, preparing an excited state. More broadly, our work shows that cavities can enhance computations performed with qubits, paving the way toward high-fidelity quantum state preparation by quantum annealing.

AI Summary

The paper asks whether excitations produced at a small annealing gap can be transferred to an auxiliary cavity, both improving ground-state preparation and providing a measurement record of the transfer. It studies a coherently evolving ferromagnetic $p=3$ collective-spin model coupled to one or two cavity modes through a mid-schedule pulse, with coupling vanishing at both endpoints. Exact Schrödinger evolution in the permutation-symmetric spin sector shows that, after the first-order transition, cavity-induced avoided crossings transfer population from excited spin levels to the spin ground state plus photons. A Landau–Zener cascade model explains the error suppression through these crossings. Over the simulated sizes, the time to reach spin error $0.1$ fits $T\propto e^{0.087N}$ with one mode, versus $e^{0.16N}$ without the cavity; two modes give a fitted exponent $0.080$. A semiclassical ladder-overlap calculation reproduces these exponents using a numerically determined cutoff growth rate. Photon counting provides a conditional ground-state indicator rather than an unconditional certificate. At $N=24$, three-photon outcomes have fidelity above $0.97$ from $T=12$, but their average yield over $T>10$ is about $0.1\%$. Scaling comparisons report conditional errors down to $10^{-4}$ while requiring yield at least $10^{-4}$. Preloading one photon reverses the transfer and prepares a spin excitation. The demonstrated speedup remains exponential and concerns this collective model. Whether additional modes can change the scaling qualitatively remains open; applying the mechanism to other models requires suitable coupling schemes, and experimental tests remain future work.

Little sign of AI-generated textOverclaimsStrong assumptionsMissing comparison

Central claim may not hold: The near-square-root speedup is supported by finite-size fits and a cutoff model using a dynamically measured growth rate, rather than an independently established asymptotic scaling law. The abstract's O(1) certification yield is not established asymptotically: the reported yields and the imposed 10^−4 acceptance floor support only the studied finite-size regime.

Written by gpt-6.1-sol from the paper's full text. Automated: it can be wrong.

Comments
10 pages, 6 figures

Related papers

Steered quantum annealing: improving time efficiency with partial information

Ana Palacios de Luis, Artur García-Sáez, Marta P. Estarellas

In the computational model of quantum annealing, the size of the minimum gap between the ground state and the first excited state of the system is of particular importance, since it is inversely proportional to the running time of the algorithm. Thus, it is desirable to keep the gap as large as possible during the annealing process, since it allows the computation to remain under the protection of the adiabatic theorem while staying efficient. We propose steered quantum annealing as a new method to enlarge the gap throughout the process, in the case of diagonal final Hamiltonians, based on the exploitation of some assumptions we can make about the particular problem instance. In order to introduce this information, we propose beginning the anneal from a biased Hamiltonian that incorporates reliable assumptions about the final ground state. Our simulations show that this method yields a larger average gap throughout the whole computation, which results in an increased robustness of the overall annealing process.

arXiv:2206.07646•Jun 15, 2022•2 citations

Improving the accuracy of the energy estimation by combining quantum annealing with classical computation

Takashi Imoto, Yuya Seki, Yuichiro Matsuzaki +1 more

Quantum chemistry calculations are important applications of quantum annealing. For practical applications in quantum chemistry, it is essential to estimate a ground state energy of the Hamiltonian with chemical accuracy. However, there are no known methods to guarantee the accuracy of the estimation of the energy calculated by quantum annealing. Here, we propose a way to improve the accuracy of the estimate of the ground state energy by combining quantum annealing with classical computation. In our scheme, before running the QA, we need a pre-estimation of the energies of the ground state and first excited state with some error bars (corresponding to possible estimation error) by performing classical computation with some approximations. We show that, if an expectation value and variance of the energy of the state after the QA are smaller than certain threshold values (that we can calculate from the pre-estimation), the QA provides us with a better estimate of the ground state energy than that of the pre-estimation. Since the expectation value and variance of the energy can be experimentally measurable by the QA, our results pave the way for accurate estimation of the ground state energy with the QA.

arXiv:2102.05323•Feb 10, 2021•5 citations

Robustness of diabatic enhancement in quantum annealing

Natasha Feinstein, Ivan Shalashilin, Sougato Bose +1 more

Abstract In adiabatic quantum annealing, the speed with which an anneal can be run, while still achieving a high final ground state (GS) fidelity, is dictated by the size of the minimum gap that appears between the ground and first excited state in the annealing spectrum. To avoid the exponential slowdown associated with exponentially closing gaps, diabatic transitions to higher energy levels may be exploited in such a way that the system returns to the GS before the end of the anneal. In certain cases, this is facilitated by the original annealing spectrum. However, there are also examples where careful manipulation of the annealing Hamiltonian has been used to alter the spectrum to create a diabatic path to the GS. Since diabatic transitions depend on the evolution rate and the gap sizes in the spectrum, it is important to consider the sensitivity of any potential enhancement to changes in the anneal time as well as any parameters involved in the manipulation of the spectrum. We explore this sensitivity using annealing spectra containing an exponentially closing gap and an additional, tuneable, small gap created by a catalyst. We find that there is a trade-off between the precision needed in the catalyst strength and the anneal time in order to maintain the enhancement to the final GS fidelity.

arXiv:2402.13811•Quantum Science and Technology•Jan 16, 2025•7 citations

Extending the computational reach of Quantum Annealing using Reverse Annealing

Lucas Joshua Menger, Thomas Lippert, Manpreet Singh Jattana

Quantum annealing is a promising heuristic for combinatorial optimization, but on current hardware its performance degrades for larger and more complex problems due to noise and small energy gaps. Reverse annealing has been proposed as a refinement strategy, yet it remains unclear when it provides systematic advantages over standard forward annealing or simply increasing annealing time. We find that combining forward and reverse annealing consistently improves solution quality and efficiency across multiple problem classes. The benefits of reverse annealing increase with problem complexity and are strongest in regimes where forward annealing is increasingly limited. Moreover, reverse annealing yields larger efficiency gains than simply extending forward annealing times. We establish these results through a systematic experimental study on a D-Wave Advantage system, benchmarking reverse annealing across Max-Cut, Number Partitioning, and sparse clustering problems while varying reverse distance, pause duration, and annealing time. We identify a narrow optimal regime for reverse annealing parameters linked to the location of freeze-out points and energy-level crossings in the annealing schedule. These findings demonstrate that reverse annealing is most valuable for large, high-complexity optimization problems and is likely to gain importance as quantum annealing hardware scales toward more realistic applications.

quant-pharXiv:2607.02146•EPJ Quantum Technology•Jul 3, 2026•0 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

Quantum annealing with ultracold atoms in a multimode optical resonator

Valentin Torggler, Sebastian Krämer, Helmut Ritsch

A dilutely filled $N$-site optical lattice near zero temperature within a high-$Q$ multimode cavity can be mapped to a spin ensemble with tailorable interactions at all length scales. The effective full site to site interaction matrix can be dynamically controlled by the application of up to $N(N+1)/2$ laser beams of suitable geometry, frequency, and power, which allows for the implementation of quantum annealing dynamics relying on the all-to-all effective spin coupling controllable in real time. Via an adiabatic sweep starting from a superfluid initial state one can find the lowest-energy stationary state of this system. As the cavity modes are lossy, errors can be amended and the ground state can still be reached even from a finite temperature state via ground-state cavity cooling. The physical properties of the final atomic state can be directly and almost nondestructively read off from the cavity output fields. As an example we simulate a quantum Hopfield associative memory scheme.

arXiv:1609.06250•Physical Review A•Mar 9, 2017•42 citations
Quantum annealing is a promising form of quantum computation, but it slows down at a small energy gap ΔΔΔ during the anneal, and the errors it makes there remain undetected. We introduce cavity quantum annealing, in which a cavity mode of frequency O(1)≫ΔO(1)\ggΔO(1)≫Δ, coupled mid-schedule, swaps these errors into photons. In the ppp-spin model, this reduces the annealing time to nearly the square root of that required without the cavity. Moreover, counting the photons certifies the result: high-photon runs, with an O(1)O(1)O(1) yield, reach a ground-state fidelity above 99.99%99.99\%99.99% orders of magnitude sooner, a gain that grows exponentially with system size. A pre-loaded photon instead runs the swap in reverse, preparing an excited state. More broadly, our work shows that cavities can enhance computations performed with qubits, paving the way toward high-fidelity quantum state preparation by quantum annealing.
The paper asks whether excitations produced at a small annealing gap can be transferred to an auxiliary cavity, both improving ground-state preparation and providing a measurement record of the transfer. It studies a coherently evolving ferromagnetic p=3p=3p=3 collective-spin model coupled to one or two cavity modes through a mid-schedule pulse, with coupling vanishing at both endpoints.
Exact Schrödinger evolution in the permutation-symmetric spin sector shows that, after the first-order transition, cavity-induced avoided crossings transfer population from excited spin levels to the spin ground state plus photons. A Landau–Zener cascade model explains the error suppression through these crossings. Over the simulated sizes, the time to reach spin error 0.10.10.1 fits T∝e0.087NT\propto e^{0.087N}T∝e0.087N with one mode, versus e0.16Ne^{0.16N}e0.16N without the cavity; two modes give a fitted exponent 0.0800.0800.080. A semiclassical ladder-overlap calculation reproduces these exponents using a numerically determined cutoff growth rate.
Photon counting provides a conditional ground-state indicator rather than an unconditional certificate. At N=24N=24N=24, three-photon outcomes have fidelity above 0.970.970.97 from T=12T=12T=12, but their average yield over T>10T>10T>10 is about 0.1%0.1\%0.1%. Scaling comparisons report conditional errors down to 10−410^{-4}10−4 while requiring yield at least 10−410^{-4}10−4. Preloading one photon reverses the transfer and prepares a spin excitation.
The demonstrated speedup remains exponential and concerns this collective model. Whether additional modes can change the scaling qualitatively remains open; applying the mechanism to other models requires suitable coupling schemes, and experimental tests remain future work.
In the computational model of quantum annealing, the size of the minimum gap between the ground state and the first excited state of the system is of particular importance, since it is inversely proportional to the running time of the algorithm. Thus, it is desirable to keep the gap as large as possible during the annealing process, since it allows the computation to remain under the protection of the adiabatic theorem while staying efficient. We propose steered quantum annealing as a new method to enlarge the gap throughout the process, in the case of diagonal final Hamiltonians, based on the exploitation of some assumptions we can make about the particular problem instance. In order to introduce this information, we propose beginning the anneal from a biased Hamiltonian that incorporates reliable assumptions about the final ground state. Our simulations show that this method yields a larger average gap throughout the whole computation, which results in an increased robustness of the overall annealing process.
Quantum chemistry calculations are important applications of quantum annealing. For practical applications in quantum chemistry, it is essential to estimate a ground state energy of the Hamiltonian with chemical accuracy. However, there are no known methods to guarantee the accuracy of the estimation of the energy calculated by quantum annealing. Here, we propose a way to improve the accuracy of the estimate of the ground state energy by combining quantum annealing with classical computation. In our scheme, before running the QA, we need a pre-estimation of the energies of the ground state and first excited state with some error bars (corresponding to possible estimation error) by performing classical computation with some approximations. We show that, if an expectation value and variance of the energy of the state after the QA are smaller than certain threshold values (that we can calculate from the pre-estimation), the QA provides us with a better estimate of the ground state energy than that of the pre-estimation. Since the expectation value and variance of the energy can be experimentally measurable by the QA, our results pave the way for accurate estimation of the ground state energy with the QA.
Abstract In adiabatic quantum annealing, the speed with which an anneal can be run, while still achieving a high final ground state (GS) fidelity, is dictated by the size of the minimum gap that appears between the ground and first excited state in the annealing spectrum. To avoid the exponential slowdown associated with exponentially closing gaps, diabatic transitions to higher energy levels may be exploited in such a way that the system returns to the GS before the end of the anneal. In certain cases, this is facilitated by the original annealing spectrum. However, there are also examples where careful manipulation of the annealing Hamiltonian has been used to alter the spectrum to create a diabatic path to the GS. Since diabatic transitions depend on the evolution rate and the gap sizes in the spectrum, it is important to consider the sensitivity of any potential enhancement to changes in the anneal time as well as any parameters involved in the manipulation of the spectrum. We explore this sensitivity using annealing spectra containing an exponentially closing gap and an additional, tuneable, small gap created by a catalyst. We find that there is a trade-off between the precision needed in the catalyst strength and the anneal time in order to maintain the enhancement to the final GS fidelity.
Quantum annealing is a promising heuristic for combinatorial optimization, but on current hardware its performance degrades for larger and more complex problems due to noise and small energy gaps. Reverse annealing has been proposed as a refinement strategy, yet it remains unclear when it provides systematic advantages over standard forward annealing or simply increasing annealing time. We find that combining forward and reverse annealing consistently improves solution quality and efficiency across multiple problem classes. The benefits of reverse annealing increase with problem complexity and are strongest in regimes where forward annealing is increasingly limited. Moreover, reverse annealing yields larger efficiency gains than simply extending forward annealing times. We establish these results through a systematic experimental study on a D-Wave Advantage system, benchmarking reverse annealing across Max-Cut, Number Partitioning, and sparse clustering problems while varying reverse distance, pause duration, and annealing time. We identify a narrow optimal regime for reverse annealing parameters linked to the location of freeze-out points and energy-level crossings in the annealing schedule. These findings demonstrate that reverse annealing is most valuable for large, high-complexity optimization problems and is likely to gain importance as quantum annealing hardware scales toward more realistic applications.
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.
A dilutely filled NNN-site optical lattice near zero temperature within a high-QQQ multimode cavity can be mapped to a spin ensemble with tailorable interactions at all length scales. The effective full site to site interaction matrix can be dynamically controlled by the application of up to N(N+1)/2N(N+1)/2N(N+1)/2 laser beams of suitable geometry, frequency, and power, which allows for the implementation of quantum annealing dynamics relying on the all-to-all effective spin coupling controllable in real time. Via an adiabatic sweep starting from a superfluid initial state one can find the lowest-energy stationary state of this system. As the cavity modes are lossy, errors can be amended and the ground state can still be reached even from a finite temperature state via ground-state cavity cooling. The physical properties of the final atomic state can be directly and almost nondestructively read off from the cavity output fields. As an example we simulate a quantum Hopfield associative memory scheme.