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:2008.00006 · PRX Quantum

Programmable Quantum Annealing Architectures with Ising Quantum Wires

Xingze Qiu, Peter Zoller, Xiaopeng Li

Published Nov 6, 2020• 54 citations
arXivHTMLPDF

Abstract

Quantum annealing aims at solving optimization problems efficiently by preparing the ground state of an Ising spin-Hamiltonian quantum mechanically.A prerequisite of building a quantum annealer is the implementation of programmable long-range two-, three-, or multispin Ising interactions.We discuss an architecture, where the required spin interactions are implemented via two-port or in general multiport quantum Ising wires connecting the spins of interest.This quantum annealing architecture of spins connected by Ising quantum wires can be realized by exploiting the three-dimensional (3D) character of atomic platforms, including atoms in optical lattices and Rydberg tweezer arrays.The realization only requires engineering on-site terms and two-body interactions between nearest neighboring qubits.The locally coupled spin model on a 3D cubic lattice is sufficient to effectively produce arbitrary all-to-all coupled Ising Hamiltonians.We illustrate the approach for few-spin devices solving Max-Cut and prime factorization problems, and discuss the potential scaling to large atom-based systems.

DOI
10.1103/prxquantum.1.020311

Related papers

A quantum annealing architecture with all-to-all connectivity from local interactions

Wolfgang Lechner, Philipp Hauke, P. Zoller

Quantum annealers are physical devices that aim at solving NP-complete optimization problems by exploiting quantum mechanics. The basic principle of quantum annealing is to encode the optimization problem in Ising interactions between quantum bits (qubits). A fundamental challenge in building a fully programmable quantum annealer is the competing requirements of full controllable all-to-all connectivity and the quasi-locality of the interactions between physical qubits. We present a scalable architecture with full connectivity, which can be implemented with local interactions only. The input of the optimization problem is encoded in local fields acting on an extended set of physical qubits. The output is-in the spirit of topological quantum memories-redundantly encoded in the physical qubits, resulting in an intrinsic fault tolerance. Our model can be understood as a lattice gauge theory, where long-range interactions are mediated by gauge constraints. The architecture can be realized on various platforms with local controllability, including superconducting qubits, NV-centers, quantum dots, and atomic systems.

Science Advances•Oct 2, 2015•255 citations

A coherent quantum annealer with Rydberg atoms

Alexander W. Glaetzle, Rick van Bijnen, P. Zoller +1 more

There is a significant ongoing effort in realizing quantum annealing with different physical platforms. The challenge is to achieve a fully programmable quantum device featuring coherent adiabatic quantum dynamics. Here we show that combining the well-developed quantum simulation toolbox for Rydberg atoms with the recently proposed Lechner-Hauke-Zoller (LHZ) architecture allows one to build a prototype for a coherent adiabatic quantum computer with all-to-all Ising interactions and, therefore, a platform for quantum annealing. In LHZ an infinite-range spin-glass is mapped onto the low energy subspace of a spin-1/2 lattice gauge model with quasi-local four-body parity constraints. This spin model can be emulated in a natural way with Rubidium and Caesium atoms in a bipartite optical lattice involving laser-dressed Rydberg-Rydberg interactions, which are several orders of magnitude larger than the relevant decoherence rates. This makes the exploration of coherent quantum enhanced optimization protocols accessible with state-of-the-art atomic physics experiments.

arXiv:1611.02594•Nature Communications•Jun 22, 2017•90 citations

A quantum annealer with fully programmable all-to-all coupling via Floquet engineering

Tatsuhiro Onodera, Edwin Ng, Peter L. McMahon

Abstract Quantum annealing is a promising approach to heuristically solving difficult combinatorial optimization problems. However, the connectivity limitations in current devices lead to an exponential degradation of performance on general problems. We propose an architecture for a quantum annealer that achieves full connectivity and full programmability while using a number of physical resources only linear in the number of spins. We do so by application of carefully engineered periodic modulations of oscillator-based qubits, resulting in a Floquet Hamiltonian in which all the interactions are tunable. This flexibility comes at the cost of the coupling strengths between qubits being smaller than they would be compared with direct coupling, which increases the demand on coherence times with increasing problem size. We analyze a specific hardware proposal of our architecture based on Josephson parametric oscillators. Our results show how the minimum-coherence-time requirements imposed by our scheme scale, and we find that the requirements are not prohibitive for fully connected problems with up to at least 1000 spins. Our approach could also have impact beyond quantum annealing, since it readily extends to bosonic quantum simulators, and would allow the study of models with arbitrary connectivity between lattice sites.

arXiv:1907.05483•npj Quantum Information•May 29, 2020•52 citations

Quantum annealing for lattice models with competing long-range interactions

Jan Alexander Koziol, Kai Phillip Schmidt

We use superconducting qubit quantum annealing devices to determine the ground state of Ising models with algebraically decaying competing long-range interactions in the thermodynamic limit. This is enabled by a unit-cell-based optimization scheme, in which the finite optimizations on each unit cell are performed using commercial quantum annealing hardware. To demonstrate the capabilities of the approach, we choose three exemplary problems relevant for other quantum simulation platforms and material science: (i) the calculation of devil's staircases of magnetization plateaux of the long-range Ising model in a longitudinal field on the triangular lattice, motivated by atomic and molecular quantum simulators; (ii) the evaluation of the ground state of the same model on the Kagome lattice in the absence of a field, motivated by artificial spin ice metamaterials; (iii) the study of models with additional few-nearest-neighbor interactions relevant for frustrated Ising compounds with potential long-range interactions. The approach discussed in this work provides a useful and realistic application of existing quantum annealing technology, applicable across many research areas in which lattice problems with resummable long-range interactions are relevant.

quant-pharXiv:2511.08336•Communications Physics•Nov 12, 2025•0 citations

Quantum annealing of Cayley-tree Ising spins at small scales

Yunheung Song, Minhyuk Kim, Hansub Hwang +2 more

Significant efforts are being directed towards developing a quantum annealer capable of solving combinatorial optimization problems. The challenges are Hamiltonian programming and large-scale implementations. Here we report quantum annealing demonstration of Ising Hamiltonians programmed with up to $N=22$ spins mapped on various Cayley tree graphs. Experiments are performed with a Rydberg-atom quantum simulator, in which rubidium single atoms are arranged in three dimensional space in such a way that their Rydberg atoms and blockaded strong couplings respectively represent the nodes and edges of each graph. Three different Cayley-tree graphs of $Z=3$ neighbors and of up to $S=4$ shells are constructed, and their ground-state phases and N\'{e}el's order formations are probed. In good agreement with model calculations, the anti-ferromagnetic phase in regular Cayley trees and frustrated competing ground-states in a dual-center Cayley tree are directly observed. This demonstrates the possibilities of high-dimensional qubit connection programming in quantum simulators.

arXiv:2011.01653•Nov 3, 2020•34 citations

Scalable 2-local architecture for quantum annealing of Ising models with arbitrary dimensions

Ana Palacios, Artur García-Sáez, Bruno Juliá-Díaz +1 more

Quantum annealing is a promising approach to solving a diversity of classical optimization problems across different fields, but real-world problems are often represented by densely connected graphs, which cannot be directly implemented in hardware in a scalable way. This work overcomes this limitation by presenting a very sparse architecture that results in effective dense connectivities. This result will have an impact on the engineering challenge of building large-scale quantum annealing devices that can solve practical optimization problems in several industry sectors, such as logistics, energy, or finance.

arXiv:2404.06861•Physical Review Applied•May 27, 2025•4 citations
Quantum annealing aims at solving optimization problems efficiently by preparing the ground state of an Ising spin-Hamiltonian quantum mechanically.A prerequisite of building a quantum annealer is the implementation of programmable long-range two-, three-, or multispin Ising interactions.We discuss an architecture, where the required spin interactions are implemented via two-port or in general multiport quantum Ising wires connecting the spins of interest.This quantum annealing architecture of spins connected by Ising quantum wires can be realized by exploiting the three-dimensional (3D) character of atomic platforms, including atoms in optical lattices and Rydberg tweezer arrays.The realization only requires engineering on-site terms and two-body interactions between nearest neighboring qubits.The locally coupled spin model on a 3D cubic lattice is sufficient to effectively produce arbitrary all-to-all coupled Ising Hamiltonians.We illustrate the approach for few-spin devices solving Max-Cut and prime factorization problems, and discuss the potential scaling to large atom-based systems.
Quantum annealers are physical devices that aim at solving NP-complete optimization problems by exploiting quantum mechanics. The basic principle of quantum annealing is to encode the optimization problem in Ising interactions between quantum bits (qubits). A fundamental challenge in building a fully programmable quantum annealer is the competing requirements of full controllable all-to-all connectivity and the quasi-locality of the interactions between physical qubits. We present a scalable architecture with full connectivity, which can be implemented with local interactions only. The input of the optimization problem is encoded in local fields acting on an extended set of physical qubits. The output is-in the spirit of topological quantum memories-redundantly encoded in the physical qubits, resulting in an intrinsic fault tolerance. Our model can be understood as a lattice gauge theory, where long-range interactions are mediated by gauge constraints. The architecture can be realized on various platforms with local controllability, including superconducting qubits, NV-centers, quantum dots, and atomic systems.
There is a significant ongoing effort in realizing quantum annealing with different physical platforms. The challenge is to achieve a fully programmable quantum device featuring coherent adiabatic quantum dynamics. Here we show that combining the well-developed quantum simulation toolbox for Rydberg atoms with the recently proposed Lechner-Hauke-Zoller (LHZ) architecture allows one to build a prototype for a coherent adiabatic quantum computer with all-to-all Ising interactions and, therefore, a platform for quantum annealing. In LHZ an infinite-range spin-glass is mapped onto the low energy subspace of a spin-1/2 lattice gauge model with quasi-local four-body parity constraints. This spin model can be emulated in a natural way with Rubidium and Caesium atoms in a bipartite optical lattice involving laser-dressed Rydberg-Rydberg interactions, which are several orders of magnitude larger than the relevant decoherence rates. This makes the exploration of coherent quantum enhanced optimization protocols accessible with state-of-the-art atomic physics experiments.
Abstract Quantum annealing is a promising approach to heuristically solving difficult combinatorial optimization problems. However, the connectivity limitations in current devices lead to an exponential degradation of performance on general problems. We propose an architecture for a quantum annealer that achieves full connectivity and full programmability while using a number of physical resources only linear in the number of spins. We do so by application of carefully engineered periodic modulations of oscillator-based qubits, resulting in a Floquet Hamiltonian in which all the interactions are tunable. This flexibility comes at the cost of the coupling strengths between qubits being smaller than they would be compared with direct coupling, which increases the demand on coherence times with increasing problem size. We analyze a specific hardware proposal of our architecture based on Josephson parametric oscillators. Our results show how the minimum-coherence-time requirements imposed by our scheme scale, and we find that the requirements are not prohibitive for fully connected problems with up to at least 1000 spins. Our approach could also have impact beyond quantum annealing, since it readily extends to bosonic quantum simulators, and would allow the study of models with arbitrary connectivity between lattice sites.
We use superconducting qubit quantum annealing devices to determine the ground state of Ising models with algebraically decaying competing long-range interactions in the thermodynamic limit. This is enabled by a unit-cell-based optimization scheme, in which the finite optimizations on each unit cell are performed using commercial quantum annealing hardware. To demonstrate the capabilities of the approach, we choose three exemplary problems relevant for other quantum simulation platforms and material science: (i) the calculation of devil's staircases of magnetization plateaux of the long-range Ising model in a longitudinal field on the triangular lattice, motivated by atomic and molecular quantum simulators; (ii) the evaluation of the ground state of the same model on the Kagome lattice in the absence of a field, motivated by artificial spin ice metamaterials; (iii) the study of models with additional few-nearest-neighbor interactions relevant for frustrated Ising compounds with potential long-range interactions. The approach discussed in this work provides a useful and realistic application of existing quantum annealing technology, applicable across many research areas in which lattice problems with resummable long-range interactions are relevant.
Significant efforts are being directed towards developing a quantum annealer capable of solving combinatorial optimization problems. The challenges are Hamiltonian programming and large-scale implementations. Here we report quantum annealing demonstration of Ising Hamiltonians programmed with up to N=22N=22N=22 spins mapped on various Cayley tree graphs. Experiments are performed with a Rydberg-atom quantum simulator, in which rubidium single atoms are arranged in three dimensional space in such a way that their Rydberg atoms and blockaded strong couplings respectively represent the nodes and edges of each graph. Three different Cayley-tree graphs of Z=3Z=3Z=3 neighbors and of up to S=4S=4S=4 shells are constructed, and their ground-state phases and N\'{e}el's order formations are probed. In good agreement with model calculations, the anti-ferromagnetic phase in regular Cayley trees and frustrated competing ground-states in a dual-center Cayley tree are directly observed. This demonstrates the possibilities of high-dimensional qubit connection programming in quantum simulators.
Quantum annealing is a promising approach to solving a diversity of classical optimization problems across different fields, but real-world problems are often represented by densely connected graphs, which cannot be directly implemented in hardware in a scalable way. This work overcomes this limitation by presenting a very sparse architecture that results in effective dense connectivities. This result will have an impact on the engineering challenge of building large-scale quantum annealing devices that can solve practical optimization problems in several industry sectors, such as logistics, energy, or finance.