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:2603.11931 · Physical Review A

Spin Model for Quantum Annealing with Kerr Parametric Oscillators

Leo Stenzel, Roeland ter Hoeven, Ryoji Miyazaki, Tomohiro Yamaji, Masayuki Shirane, Wolfgang Lechner

quant-phSubmitted Mar 12, 2026• Announced Mar 13, 2026• 0 citations• Revised Jun 25, 2026 (v2)
v1 · Mar 12, 2026v2 · Jun 25, 2026
arXivHTMLPDF

Abstract

Coherent states offer a promising path for near-term quantum computing due to their inherent protection against bit-flip noise. However, their large photon numbers can be challenging for numerical simulation. This paper introduces an effective model, representing coherent-state quantum annealing using spin-1/2 degrees of freedom. We demonstrate that this model yields accurate predictions for realistic experimental settings and can therefore serve as a practical tool for optimizing future quantum hardware.

Journal reference
Phys. Rev. A 113, 062621 (2026)
DOI
10.1103/gxpp-ms36

Related papers

Effective spin models of Kerr-nonlinear parametric oscillators for quantum annealing

Ryoji Miyazaki

A method of quantum annealing (QA) using Kerr-nonlinear parametric oscillators (KPOs) was proposed. This method is described by bosonic operators and has different characteristics from QA based on the transverse-field Ising model. As the first step to describe this method in the conventional framework of QA, we propose effective spin models of KPOs. The spin models are obtained via a variant of the Holstein-Primakoff transformation and are described by spin-$s$ operators. The terms for detuning, coherent driving, parametric driving, and the Kerr effect are mapped to the transverse field, longitudinal field, and nonlinear terms for the $z$ and $x$ components of spins, respectively. By analyzing the spin models corresponding to KPOs in several settings, we demonstrate that the present spin models for a rather large $s$ and tuned parameters qualitatively reproduce the behavior of KPOs.

arXiv:2202.07160•Physical Review A•Jun 29, 2022•10 citations

Quantum annealing with all-to-all connected nonlinear oscillators

Shruti Puri, Christian Kraglund Andersen, Arne L. Grimsmo +1 more

Quantum annealing aims at solving combinatorial optimization problems mapped to Ising interactions between quantum spins. Here, with the objective of developing a noise-resilient annealer, we propose a paradigm for quantum annealing with a scalable network of two-photon-driven Kerr-nonlinear resonators. Each resonator encodes an Ising spin in a robust degenerate subspace formed by two coherent states of opposite phases. A fully connected optimization problem is mapped to local fields driving the resonators, which are connected with only local four-body interactions. We describe an adiabatic annealing protocol in this system and analyse its performance in the presence of photon loss. Numerical simulations indicate substantial resilience to this noise channel, leading to a high success probability for quantum annealing. Finally, we propose a realistic circuit QED implementation of this promising platform for implementing a large-scale quantum Ising machine.

arXiv:1609.07117•Nature Communications•Jun 8, 2017•172 citations

Spin-Model Simulations for KPO Annealing

L. Stenzel

Code and data accompanying our paper arXiv:2603.11931 on effective spin-1/2 models for simulating quantum annealing in Kerr parametric oscillators (KPOs).

•Feb 17, 2026•1 citation

Fast elementary gates for universal quantum computation with Kerr parametric oscillator qubits

Taro Kanao, Hayato Goto

Kerr parametric oscillators (KPOs) can stabilize the superpositions of coherent states, which can be utilized as qubits, and are promising candidates for realizing hardware-efficient quantum computers. Although elementary gates for universal quantum computation with KPO qubits have been proposed, these gates are usually based on adiabatic operations and thus need long gate times, which result in errors caused by photon loss in KPOs realized by, e.g., superconducting circuits. In this work we accelerate the elementary gates by experimentally feasible control methods, which are based on numerical optimization of pulse shapes for shortcuts to adiabaticity. By numerical simulations, we show that the proposed methods can achieve speedups compared to adiabatic ones by up to six times with high gate fidelities of 99.9%. These methods are thus expected to be useful for quantum computers with KPOs.

arXiv:2310.20108•Physical Review Research•Feb 22, 2024•10 citations

Finite-size scaling in quantum annealing with decoherence

Phillip Weinberg

Quantum annealing represents an essential milestone towards the goal of adiabatic quantum computing. In quantum annealing, the computation involves finding the ground state of a classical Ising-like Hamiltonian realized as interactions between qubits. Quantum fluctuations are introduced to allow the wavefunction of the qubits to explore the energy landscape, the hope being that the wavefunction finds a minimum energy configuration and possibly giving the result of the computation. While quantum annealing likely may not be as powerful as adiabatic quantum computing, it is possible that it may be better at optimization compared to analogous classical algorithms. In physical realizations of quantum annealing, there are still questions as to the role of quantum fluctuations in the operation of a device given the short coherence times of the individual qubits. These questions have consistently posed a serious theoretical challenge making it difficult to verify experimental results. Here we simplify the problem by considering a system of qubits with ferromagnetic interactions, modeling the decoherence effects as classical noise in the transverse-field of each qubit. We compare the calculations to data collected from a system of manufactured qubits produced by D-wave Systems by performing a finite-size scaling analysis that captures the competition between quantum fluctuations of the transverse-field and bit-flip errors from the noise. We argue that on time-scales larger than the single-qubit decoherence time, the device produces the expected quantum fluctuations for the many-body system. Using this finite-size scaling, one can diagnose sources of noise in the system. Hopefully, in the near future, these devices will not only be realizing coherent quantum annealing but will likely be useful as another example of synthetic quantum matter.

•Jan 1, 2020•0 citations

Spin-1 quantum annealing with anisotropy-controlled intermediate-state pathways

M. Haider Akbar, Özgür E. Müstecaplıoğlu

Quantum annealing offers a promising strategy for solving complex optimization problems by encoding the solution into the ground state of a problem Hamiltonian. While most implementations rely on spin-$1/2$ systems, we explore the performance of quantum annealing on a spin-$1$ system where the problem Hamiltonian includes a single ion anisotropy term of the form $D\sum (S^z)^2$. Our results reveal that for a suitable range of the anisotropy strength $D$, the spin-$1$ annealer reaches the ground state with higher fidelity. We attribute this performance to the presence of the intermediate spin level and the tunable anisotropy, which together enable the algorithm to traverse the energy landscape through smaller, incremental steps instead of a single large spin flip. This mechanism effectively lowers barriers in the configuration space and stabilizes the evolution. These findings suggest that higher spin annealers offer intrinsic advantages for robust and flexible quantum optimization, especially for problems naturally formulated with ternary decision variables.

quant-pharXiv:2512.23469•Dec 30, 2025•0 citations
Coherent states offer a promising path for near-term quantum computing due to their inherent protection against bit-flip noise. However, their large photon numbers can be challenging for numerical simulation. This paper introduces an effective model, representing coherent-state quantum annealing using spin-1/2 degrees of freedom. We demonstrate that this model yields accurate predictions for realistic experimental settings and can therefore serve as a practical tool for optimizing future quantum hardware.
A method of quantum annealing (QA) using Kerr-nonlinear parametric oscillators (KPOs) was proposed. This method is described by bosonic operators and has different characteristics from QA based on the transverse-field Ising model. As the first step to describe this method in the conventional framework of QA, we propose effective spin models of KPOs. The spin models are obtained via a variant of the Holstein-Primakoff transformation and are described by spin-sss operators. The terms for detuning, coherent driving, parametric driving, and the Kerr effect are mapped to the transverse field, longitudinal field, and nonlinear terms for the zzz and xxx components of spins, respectively. By analyzing the spin models corresponding to KPOs in several settings, we demonstrate that the present spin models for a rather large sss and tuned parameters qualitatively reproduce the behavior of KPOs.
Quantum annealing aims at solving combinatorial optimization problems mapped to Ising interactions between quantum spins. Here, with the objective of developing a noise-resilient annealer, we propose a paradigm for quantum annealing with a scalable network of two-photon-driven Kerr-nonlinear resonators. Each resonator encodes an Ising spin in a robust degenerate subspace formed by two coherent states of opposite phases. A fully connected optimization problem is mapped to local fields driving the resonators, which are connected with only local four-body interactions. We describe an adiabatic annealing protocol in this system and analyse its performance in the presence of photon loss. Numerical simulations indicate substantial resilience to this noise channel, leading to a high success probability for quantum annealing. Finally, we propose a realistic circuit QED implementation of this promising platform for implementing a large-scale quantum Ising machine.
Kerr parametric oscillators (KPOs) can stabilize the superpositions of coherent states, which can be utilized as qubits, and are promising candidates for realizing hardware-efficient quantum computers. Although elementary gates for universal quantum computation with KPO qubits have been proposed, these gates are usually based on adiabatic operations and thus need long gate times, which result in errors caused by photon loss in KPOs realized by, e.g., superconducting circuits. In this work we accelerate the elementary gates by experimentally feasible control methods, which are based on numerical optimization of pulse shapes for shortcuts to adiabaticity. By numerical simulations, we show that the proposed methods can achieve speedups compared to adiabatic ones by up to six times with high gate fidelities of 99.9%. These methods are thus expected to be useful for quantum computers with KPOs.
Quantum annealing represents an essential milestone towards the goal of adiabatic quantum computing. In quantum annealing, the computation involves finding the ground state of a classical Ising-like Hamiltonian realized as interactions between qubits. Quantum fluctuations are introduced to allow the wavefunction of the qubits to explore the energy landscape, the hope being that the wavefunction finds a minimum energy configuration and possibly giving the result of the computation. While quantum annealing likely may not be as powerful as adiabatic quantum computing, it is possible that it may be better at optimization compared to analogous classical algorithms. In physical realizations of quantum annealing, there are still questions as to the role of quantum fluctuations in the operation of a device given the short coherence times of the individual qubits. These questions have consistently posed a serious theoretical challenge making it difficult to verify experimental results. Here we simplify the problem by considering a system of qubits with ferromagnetic interactions, modeling the decoherence effects as classical noise in the transverse-field of each qubit. We compare the calculations to data collected from a system of manufactured qubits produced by D-wave Systems by performing a finite-size scaling analysis that captures the competition between quantum fluctuations of the transverse-field and bit-flip errors from the noise. We argue that on time-scales larger than the single-qubit decoherence time, the device produces the expected quantum fluctuations for the many-body system. Using this finite-size scaling, one can diagnose sources of noise in the system. Hopefully, in the near future, these devices will not only be realizing coherent quantum annealing but will likely be useful as another example of synthetic quantum matter.
Quantum annealing offers a promising strategy for solving complex optimization problems by encoding the solution into the ground state of a problem Hamiltonian. While most implementations rely on spin-1/21/21/2 systems, we explore the performance of quantum annealing on a spin-111 system where the problem Hamiltonian includes a single ion anisotropy term of the form D∑(Sz)2D\sum (S^z)^2D∑(Sz)2. Our results reveal that for a suitable range of the anisotropy strength DDD, the spin-111 annealer reaches the ground state with higher fidelity. We attribute this performance to the presence of the intermediate spin level and the tunable anisotropy, which together enable the algorithm to traverse the energy landscape through smaller, incremental steps instead of a single large spin flip. This mechanism effectively lowers barriers in the configuration space and stabilizes the evolution. These findings suggest that higher spin annealers offer intrinsic advantages for robust and flexible quantum optimization, especially for problems naturally formulated with ternary decision variables.