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:2105.07134 · npj Quantum Information

Quantum optimization within lattice gauge theory model on a quantum simulator

Zheng Yan, Zheng Zhou, Yan-Hua Zhou, Yan-Cheng Wang, Xingze Qiu, Zi Yang Meng, Xue‐Feng Zhang

Published Sep 15, 2023• 20 citations
arXivHTMLPDF

Abstract

Abstract Simulating lattice gauge theory (LGT) Hamiltonian and its nontrivial states by programmable quantum devices has attracted numerous attention in recent years. Rydberg atom arrays constitute one of the most rapidly developing arenas for quantum simulation and quantum computing. The $${{\mathbb{Z}}}_{2}$$ Z 2 LGT and topological order has been realized in experiments while the U (1) LGT is being worked hard on the way. States of LGT have local constraints and are fragmented into several winding sectors with topological protection. It is therefore difficult to reach the ground state in target sector for experiments, and it is also an important task for quantum topological memory. Here, we propose a protocol of sweeping quantum annealing (SQA) for searching the ground state among topological sectors. With the quantum Monte Carlo method, we show that this SQA has linear time complexity of size with applications to the antiferromagnetic transverse field Ising model, which has emergent U (1) gauge fields. This SQA protocol can be realized easily on quantum simulation platforms such as Rydberg array and D-wave annealer. We expect this approach would provide an efficient recipe for resolving the topological hindrances in quantum optimization and the preparation of quantum topological state.

DOI
10.1038/s41534-023-00755-z

Related papers

Two-Dimensional Z2 Lattice Gauge Theory on a Near-Term Quantum Simulator: Variational Quantum Optimization, Confinement, and Topological Order

Luca Lumia, Pietro Torta, Glen Bigan Mbeng +4 more

Quantum approximate optimization algorithms can efficiently initialize the ground states of two-dimensional lattice gauge theory in different phases, showing signatures of topological order in systems sizes comparable to modern quantum computing platforms.

arXiv:2112.11787•PRX Quantum•Apr 28, 2022•36 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•96 citations

Speedup of high-order unconstrained binary optimization using quantum $${{\mathbb{Z}}}_{2}$$ lattice gauge theory

Bi-Ying Wang, Xiaopeng Cui, Qingguo Zeng +3 more

An important and difficult problem in optimization is the high-order unconstrained binary optimization, which can represent many optimization problems more efficiently than quadratic unconstrained binary optimization, but how to quickly solve it has remained difficult. Here, we present an approach by mapping the high-order unconstrained binary optimization to quantum $${{\mathbb{Z}}}_{2}$$ lattice gauge theory and propose the gauged local quantum annealing, which is the local quantum annealing protected by the gauge symmetry. We present the quantum algorithm and its corresponding quantum-inspired classical algorithm for this problem and achieve algorithmic speedup by using gauge symmetry. By running the quantum-inspired classical algorithm, we demonstrate that the gauged local quantum annealing reduces the computational time by one order of magnitude from that of the local quantum annealing. The authors propose a quantum annealing scheme for solving a higher-order unconstrained binary optimization problem by mapping it to a quantum Z2 lattice gauge theory on a dual graph. This scheme is shown to achieve a speed-up of at least one order of magnitude in finding the ground state compared to other methods.

arXiv:2406.05958•Communications Physics•Apr 10, 2025•10 citations

Simulation of a Z2 lattice gauge theory on a D-Wave Quantum Processing Unit

Daniil Teplitskiy

Quantum chromodynamics fundamentally governs the strong interaction, yet central phenomena such as confinement and hadronization remain inherently non-perturbative and inaccessible via conventional perturbation theory. Lattice gauge theory emerged as a rigorous framework to formulate these strongly coupled regimes on a discretized spacetime. However, full non-Abelian lattice simulations remain computationally demanding, motivating the study of discrete gauge models such as $\mathbb{Z}_2$ gauge theory, which capture essential non-perturbative mechanisms, including confinement-deconfinement transitions and string tension, within a simplified setting. In this work, we simulate a $\mathbb{Z}_2$ lattice gauge theory in $(2+1)$ dimensions on a D-Wave ‘Research’ Quantum Processing Unit (QPU) using multicolor annealing. To implement the model on hardware, we identify the Union-Jack lattice as the geometric dual of the QPU’s native square-octagonal connectivity graph. By formulating the gauge Hamiltonian on the Union-Jack lattice and applying an exact duality transformation [1], we map the constrained gauge theory directly to an unconstrained transverse-field Ising Hamiltonian on the square-octagonal graph. We use this mapped Hamiltonian to realize and study the real-time dynamics of the lattice gauge theory directly on quantum annealing hardware.

•Jan 1, 2026•0 citations

SU(2) lattice gauge theory on a quantum annealer

Sarmed A Rahman, Randy Lewis, Emanuele Mendicelli +1 more

Lattice gauge theory is an essential tool for strongly interacting non-Abelian fields, such as those in quantum chromodynamics where lattice results have been of central importance for several decades. Recent studies suggest that quantum computers could extend the reach of lattice gauge theory in dramatic ways, but the usefulness of quantum annealing hardware for lattice gauge theory has not yet been explored. In this work, we implement SU(2) pure gauge theory on a quantum annealer for lattices comprising a few plaquettes in a row with a periodic boundary condition. These plaquettes are in two spatial dimensions and calculations use the Hamiltonian formulation where time is not discretized. Numerical results are obtained from calculations on D-Wave Advantage hardware for eigenvalues, eigenvectors, vacuum expectation values, and time evolution. The success of this initial exploration indicates that the quantum annealer might become a useful hardware platform for some aspects of lattice gauge theories.

arXiv:2103.08661•Physical review. D/Physical review. D.•Aug 13, 2021•101 citations

Rapid counter-diabatic sweeps in lattice gauge adiabatic quantum computing

Andreas Hartmann, Wolfgang Lechner

We present a coherent counter-diabatic quantum protocol to prepare ground states in the lattice gauge mapping of all-to-all Ising models (LHZ) with considerably enhanced final ground state fidelity compared to a quantum annealing protocol.We make use of a variational method to find approximate counter-diabatic Hamiltonians that has recently been introduced by Sels and Polkovnikov (2017 Proc.Natl.Acad.Sci.114 3909).The resulting additional terms in our protocol are time-dependent local onsite y-magnetic fields.These additional Hamiltonian terms do not increase the minimal energy gap, but instead compensate for the Berry curvature.A single free parameter is introduced which is optimized via classical updates.The protocol consists only of local and nearest-neighbor terms which makes it attractive for implementation in near term experiments.

arXiv:1807.02053•New Journal of Physics•Mar 29, 2019•60 citations
Abstract Simulating lattice gauge theory (LGT) Hamiltonian and its nontrivial states by programmable quantum devices has attracted numerous attention in recent years. Rydberg atom arrays constitute one of the most rapidly developing arenas for quantum simulation and quantum computing. The Z2{{\mathbb{Z}}}_{2}Z2​ Z 2 LGT and topological order has been realized in experiments while the U (1) LGT is being worked hard on the way. States of LGT have local constraints and are fragmented into several winding sectors with topological protection. It is therefore difficult to reach the ground state in target sector for experiments, and it is also an important task for quantum topological memory. Here, we propose a protocol of sweeping quantum annealing (SQA) for searching the ground state among topological sectors. With the quantum Monte Carlo method, we show that this SQA has linear time complexity of size with applications to the antiferromagnetic transverse field Ising model, which has emergent U (1) gauge fields. This SQA protocol can be realized easily on quantum simulation platforms such as Rydberg array and D-wave annealer. We expect this approach would provide an efficient recipe for resolving the topological hindrances in quantum optimization and the preparation of quantum topological state.
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.
Speedup of high-order unconstrained binary optimization using quantum Z2{{\mathbb{Z}}}_{2}Z2​ lattice gauge theory
An important and difficult problem in optimization is the high-order unconstrained binary optimization, which can represent many optimization problems more efficiently than quadratic unconstrained binary optimization, but how to quickly solve it has remained difficult. Here, we present an approach by mapping the high-order unconstrained binary optimization to quantum Z2{{\mathbb{Z}}}_{2}Z2​ lattice gauge theory and propose the gauged local quantum annealing, which is the local quantum annealing protected by the gauge symmetry. We present the quantum algorithm and its corresponding quantum-inspired classical algorithm for this problem and achieve algorithmic speedup by using gauge symmetry. By running the quantum-inspired classical algorithm, we demonstrate that the gauged local quantum annealing reduces the computational time by one order of magnitude from that of the local quantum annealing. The authors propose a quantum annealing scheme for solving a higher-order unconstrained binary optimization problem by mapping it to a quantum Z2 lattice gauge theory on a dual graph. This scheme is shown to achieve a speed-up of at least one order of magnitude in finding the ground state compared to other methods.
Quantum chromodynamics fundamentally governs the strong interaction, yet central phenomena such as confinement and hadronization remain inherently non-perturbative and inaccessible via conventional perturbation theory. Lattice gauge theory emerged as a rigorous framework to formulate these strongly coupled regimes on a discretized spacetime. However, full non-Abelian lattice simulations remain computationally demanding, motivating the study of discrete gauge models such as Z2\mathbb{Z}_2Z2​ gauge theory, which capture essential non-perturbative mechanisms, including confinement-deconfinement transitions and string tension, within a simplified setting. In this work, we simulate a Z2\mathbb{Z}_2Z2​ lattice gauge theory in (2+1)(2+1)(2+1) dimensions on a D-Wave ‘Research’ Quantum Processing Unit (QPU) using multicolor annealing. To implement the model on hardware, we identify the Union-Jack lattice as the geometric dual of the QPU’s native square-octagonal connectivity graph. By formulating the gauge Hamiltonian on the Union-Jack lattice and applying an exact duality transformation [1], we map the constrained gauge theory directly to an unconstrained transverse-field Ising Hamiltonian on the square-octagonal graph. We use this mapped Hamiltonian to realize and study the real-time dynamics of the lattice gauge theory directly on quantum annealing hardware.
Lattice gauge theory is an essential tool for strongly interacting non-Abelian fields, such as those in quantum chromodynamics where lattice results have been of central importance for several decades. Recent studies suggest that quantum computers could extend the reach of lattice gauge theory in dramatic ways, but the usefulness of quantum annealing hardware for lattice gauge theory has not yet been explored. In this work, we implement SU(2) pure gauge theory on a quantum annealer for lattices comprising a few plaquettes in a row with a periodic boundary condition. These plaquettes are in two spatial dimensions and calculations use the Hamiltonian formulation where time is not discretized. Numerical results are obtained from calculations on D-Wave Advantage hardware for eigenvalues, eigenvectors, vacuum expectation values, and time evolution. The success of this initial exploration indicates that the quantum annealer might become a useful hardware platform for some aspects of lattice gauge theories.
We present a coherent counter-diabatic quantum protocol to prepare ground states in the lattice gauge mapping of all-to-all Ising models (LHZ) with considerably enhanced final ground state fidelity compared to a quantum annealing protocol.We make use of a variational method to find approximate counter-diabatic Hamiltonians that has recently been introduced by Sels and Polkovnikov (2017 Proc.Natl.Acad.Sci.114 3909).The resulting additional terms in our protocol are time-dependent local onsite y-magnetic fields.These additional Hamiltonian terms do not increase the minimal energy gap, but instead compensate for the Berry curvature.A single free parameter is introduced which is optimized via classical updates.The protocol consists only of local and nearest-neighbor terms which makes it attractive for implementation in near term experiments.