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

Beyond qubits: Quantum optimization and lattice gauge theories in a qudit framework

Alberto Bottarelli

Published May 28, 2026• 0 citations
OpenAlex

Abstract

Quantum computing holds the promise of tackling problems that are intractable for classical machines, yet the path from current noisy intermediate-scale quantum (NISQ) devices to fault-tolerant processors demands both better algorithms and a deeper understanding of how to exploit the full structure of quantum hardware. A key direction in this effort is the move beyond qubits: exploiting higher-dimensional local Hilbert spaces — qudits — to encode information, enforce constraints, and simulate complex physical systems more naturally and efficiently. This thesis investigates two interconnected research fronts in which the qudit framework provides concrete benefits: quantum optimization and the quantum simulation of lattice gauge theories (LGTs). On the optimization side, we show how a single ancilla qudit can enforce inequality constraints in the Quantum Approximate Optimization Algorithm (QAOA) without inflating the solution space, and how counterdiabatic driving, enhanced by symmetry reduction, improves variational performance for qudit-based algorithms. We additionally study the noise robustness of variational algorithms on real hardware, and investigate how nonstabilizerness builds up and relates to optimization performance across both qubit and qutrit protocols. On the simulation side, we analyze the ground-state structure and phase transitions of non-Abelian lattice gauge theories with dihedral symmetry, characterizing confinement and string breaking in DN models, and probing the quantum complexity of ground states across ZN , D3, and SU(2) gauge theories. Together, these results clarify where and how the qudit framework provides algorithmic and representational advantages over the standard qubit paradigm, and contribute to the broader effort of developing practical quantum simulation and optimization tools for near- term hardware

Related papers

NISQ-Era Quantum Simulation of Lattice Gauge Theories: A Review of Encoding Strategies, Variational Methods, and Error Mitigation Techniques

Mirza Adnan Mohtashim

This research paper provides a comprehensive review of quantum simulation methods for lattice gauge theories during the current era of noisy intermediate-scale quantum computing. It focuses on the fundamental framework used to understand strong interactions in high-energy physics and explores how quantum devices can overcome the limitations of traditional computational methods, such as the sign problem found in classical simulations. The manuscript is built around three primary pillars that are critical for near-term progress. The first pillar involves encoding strategies, describing the movement away from simple mapping techniques toward more advanced, compact methods that significantly decrease the number of required quantum bits by focusing only on physically relevant states and exploiting local gauge constraints. The second pillar analyzes specific variational quantum algorithms that use flexible circuit structures to find low-energy states, comparing different approaches based on their circuit depth and suitability for current hardware. The third pillar evaluates various error mitigation techniques used to extract accurate information from imperfect quantum hardware, such as methods that amplify and then remove noise or those that use physical symmetries to detect and discard errors. Additionally, the paper compares different hardware technologies—including those based on superconducting circuits, trapped atoms, and ions—to weigh their respective benefits, such as gate speed and connectivity, against their drawbacks. It also introduces emerging hybrid approaches that combine quantum circuits with artificial neural networks to improve simulation power and state representation. Ultimately, the review identifies pathways toward achieving practical advantages in the field and discusses the challenges that remain for scaling these systems to larger sizes.

•May 9, 2026•0 citations

Quantum simulation of non-Abelian lattice gauge theories: A variational approach to D 8 with dynamical matter

Emanuele Gaz, Pavel P. Popov, Guy Pardo +3 more

Quantum simulation of lattice gauge theories (LGTs) provides a powerful framework for understanding nonperturbative phenomena. However, to realize the hope of answering challenging physics questions on near-term devices it is crucial to develop resource-efficient formulations, in particular for non-Abelian LGTs and beyond (1+1) dimensions. In this work, we address this issue by focusing on the difficulty of simulating fermionic degrees of freedom and on mitigating the Hilbert space redundancy, i.e., the presence of exponentially many nonphysical states that do not obey gauge invariance. First, we show a procedure that removes the matter and improves the hardware-resource efficiency. We demonstrate it for the simplest non-Abelian group addressable with this procedure, D 8 , in the cases of both one and two spatial dimensions. Then, with the objective of running a variational quantum simulation on real quantum hardware, we map the D 8 LGT onto qudit systems with local interactions. We propose a variational scheme for the qudit system with a local Hamiltonian, which can be implemented on a universal qudit quantum device. Our results show the effectiveness of the matter-removing procedure, solving the redundancy problem, and reducing the amount of quantum resources. This approach can serve as a way of simulating LGTs in high spatial dimensions, with non-Abelian gauge groups, and including dynamical fermions.

arXiv:2501.17863•Physical Review Research•Jun 16, 2025•15 citations

Efficient Quantum Gauge Simulations with the Triamond

Ali Hosseinzadehkavaki

Quantum simulation provides a promising framework for studying non-perturbative phenomena in lattice gauge theories that are difficult to access using classical computational methods. In particular, classical Monte Carlo approaches suffer from the sign problem, limiting their applicability to real-time dynamics and finite-density regimes. Quantum computers, by directly encoding quantum dynamics, offer a natural pathway to overcoming these limitations. In this thesis, we study quantum simulations of a truncated SU(2) lattice gauge theory using a Hamiltonian formulation, representing an important non-Abelian step toward quantum chromodynamics. We focus on three-dimensional gauge-theory simulations in the noisy intermediate-scale quantum (NISQ) era, where limited qubit resources pose a significant challenge. To address this, we introduce the triamond lattice, a three-dimensional lattice geometry that enforces local gauge invariance while providing an economical encoding of gauge degrees of freedom, thereby reducing qubit overhead compared to conventional lattice constructions. We derive the corresponding Hamiltonian, construct physical gauge-invariant states, and implement quantum simulations using quantum imaginary time evolution to prepare ground states, alongside real-time evolution methods to study dynamical behavior. Error-mitigation techniques are employed to extract reliable physical observables from noisy quantum hardware. Our results demonstrate that the triamond lattice enables resource-efficient three-dimensional quantum gauge simulations and represents a practical step toward scalable quantum simulations of non-perturbative gauge theories.

•Dec 5, 2025•0 citations

Quantum Computing 2+1-dimensional Quantum Electrodynamics

Arianna Crippa

This thesis investigates advances in quantum simulation methods for lattice gauge theories, with a focus on (2+1)-dimensional quantum electrodynamics (QED), which shares important features with (3+1)-dimensional quantum chromodynamics (QCD), such as confinement and asymptotic freedom. Two main projects are developed. The first project investigates the ongoing coupling in a compact pure U(1) gauge theory using a step-scaling function approach. A quantum variational method allows calculations over a wide range of couplings. Plaquette expectation value results are compared with classical Monte Carlo simulations to obtain, in principle, the physical value of the lattice spacing. This method can potentially be extended to the study of QED, which also includes fermionic matter. The second project investigates the static potential between two charges, analyzing the Coulomb, confining, and string-breaking regimes. It involves the development of a tailored variational approach that incorporates system symmetries and mutual information to represent fermionic degrees of freedom. Results from a trapped-ion quantum device agree well with classical simulations, validating the method. Furthermore, this work evaluates superconducting quantum devices, noting issues with noise but also demonstrating improvements in hardware and potential through error limitation. Overall, this work underscores the feasibility of variational quantum algorithms for lattice gauge theory simulations and demonstrates their promise for advancing theoretical physics with quantum computers. This thesis explores advancements in quantum simulation methods for lattice gauge theories, focusing on (2+1)-dimensional Quantum Electrodynamics (QED), which shares key features with (3+1)-dimensional Quantum Chromodynamics (QCD), such as confinement and asymptotic freedom. Two main projects are developed. The first investigates the running coupling in a compact U(1) pure gauge theory using a step scaling function approach. A quantum variational method enables computation across a wide range of couplings. The plaquette expectation value is matched with classical Monte Carlo simulations to obtain, in principle, the physical value of the lattice spacing. This method can be eventually extended to study QED, where fermionic matter is included. The second project examines the static potential between two charges, analyzing Coulomb, confining, and string-breaking regimes. It involves developing a custom variational Ansatz that incorporates system symmetries and mutual information to represent fermionic degrees of freedom. Results from a trapped-ion quantum device align well with exact classical simulations, validating the method. Additionally, the thesis evaluates superconducting devices, identifying noise challenges but noting improvements in hardware and the potential of error mitigation. Overall, this work highlights the viability of variational quantum algorithms for lattice gauge theory simulations and demonstrates their promise for advancing theoretical physics with quantum computing.

•Dec 4, 2025•0 citations

Non-Abelian dynamics on a cube: Improving quantum compilation through qudit-based simulations

Jacky Jiang, Natalie Klco, Olivia Di Matteo

Recent developments in mapping lattice gauge theories relevant to the Standard Model onto digital quantum computers identify scalable paths with well-defined quantum compilation challenges toward the continuum. As an entry point to these challenges, we address the simulation of SU(2) lattice gauge theory. Using qudit registers to encode the digitized gauge field, we provide quantum resource estimates, in terms of elementary qudit gates, for arbitrarily high local gauge field truncations. We then demonstrate an end-to-end simulation of real-time, qutrit-digitized SU(2) dynamics on a cube. Through optimizing the simulation, we improved circuit decompositions for uniformly controlled qudit rotations, an algorithmic primitive for general applications of quantum computing. The decompositions also apply to mixed-dimensional qudit systems, which we found advantageous for compiling lattice gauge theory simulations. Furthermore, we parallelize the evolution of opposite faces in anticipation of similar opportunities arising in three-dimensional lattice volumes. This work details an ambitious executable for future qudit hardware and attests to the value of codesign strategies between lattice gauge theory simulation and quantum compilation.

arXiv:2506.10945•Physical review. D/Physical review. D.•Sep 9, 2025•19 citations

Enabling large-scale digital quantum simulations with superconducting qubits

Laurin E. Fischer

Quantum computing promises to revolutionize several scientific and technological domains through fundamentally new ways of processing information. Among its most compelling applications is digital quantum simulation, where quantum computers are used to replicate the behavior of other quantum systems. This could enable the study of problems that are otherwise intractable on classical computers, transforming fields such as quantum chemistry, condensed matter physics, and materials science. Despite this potential, realizations of practical quantum advantage for relevant problems are hindered by imperfections of current devices. This also affects quantum hardware based on superconducting circuits which is among the most advanced and scalable platforms. The envisaged long-term solution of fault-tolerant quantum computers that correct their own errors remains out of reach mainly due to the associated qubit number overhead. As a result, the field has developed strategies that combine quantum and classical resources, exploit hardware-native operations, and employ error mitigation techniques to extract meaningful results from noisy data. This doctoral thesis contributes to this broader effort by exploring methods for advancing quantum simulation across the full computational stack, including hardware-level innovations, refined techniques for noise modeling and error mitigation, and algorithmic improvements enabled by efficient measurement processing.

quant-pharXiv:2602.04719•Feb 5, 2026•1 citation
Quantum computing holds the promise of tackling problems that are intractable for classical machines, yet the path from current noisy intermediate-scale quantum (NISQ) devices to fault-tolerant processors demands both better algorithms and a deeper understanding of how to exploit the full structure of quantum hardware. A key direction in this effort is the move beyond qubits: exploiting higher-dimensional local Hilbert spaces — qudits — to encode information, enforce constraints, and simulate complex physical systems more naturally and efficiently. This thesis investigates two interconnected research fronts in which the qudit framework provides concrete benefits: quantum optimization and the quantum simulation of lattice gauge theories (LGTs). On the optimization side, we show how a single ancilla qudit can enforce inequality constraints in the Quantum Approximate Optimization Algorithm (QAOA) without inflating the solution space, and how counterdiabatic driving, enhanced by symmetry reduction, improves variational performance for qudit-based algorithms. We additionally study the noise robustness of variational algorithms on real hardware, and investigate how nonstabilizerness builds up and relates to optimization performance across both qubit and qutrit protocols. On the simulation side, we analyze the ground-state structure and phase transitions of non-Abelian lattice gauge theories with dihedral symmetry, characterizing confinement and string breaking in DN models, and probing the quantum complexity of ground states across ZN , D3, and SU(2) gauge theories. Together, these results clarify where and how the qudit framework provides algorithmic and representational advantages over the standard qubit paradigm, and contribute to the broader effort of developing practical quantum simulation and optimization tools for near- term hardware
This research paper provides a comprehensive review of quantum simulation methods for lattice gauge theories during the current era of noisy intermediate-scale quantum computing. It focuses on the fundamental framework used to understand strong interactions in high-energy physics and explores how quantum devices can overcome the limitations of traditional computational methods, such as the sign problem found in classical simulations. The manuscript is built around three primary pillars that are critical for near-term progress. The first pillar involves encoding strategies, describing the movement away from simple mapping techniques toward more advanced, compact methods that significantly decrease the number of required quantum bits by focusing only on physically relevant states and exploiting local gauge constraints. The second pillar analyzes specific variational quantum algorithms that use flexible circuit structures to find low-energy states, comparing different approaches based on their circuit depth and suitability for current hardware. The third pillar evaluates various error mitigation techniques used to extract accurate information from imperfect quantum hardware, such as methods that amplify and then remove noise or those that use physical symmetries to detect and discard errors. Additionally, the paper compares different hardware technologies—including those based on superconducting circuits, trapped atoms, and ions—to weigh their respective benefits, such as gate speed and connectivity, against their drawbacks. It also introduces emerging hybrid approaches that combine quantum circuits with artificial neural networks to improve simulation power and state representation. Ultimately, the review identifies pathways toward achieving practical advantages in the field and discusses the challenges that remain for scaling these systems to larger sizes.
Quantum simulation of lattice gauge theories (LGTs) provides a powerful framework for understanding nonperturbative phenomena. However, to realize the hope of answering challenging physics questions on near-term devices it is crucial to develop resource-efficient formulations, in particular for non-Abelian LGTs and beyond (1+1) dimensions. In this work, we address this issue by focusing on the difficulty of simulating fermionic degrees of freedom and on mitigating the Hilbert space redundancy, i.e., the presence of exponentially many nonphysical states that do not obey gauge invariance. First, we show a procedure that removes the matter and improves the hardware-resource efficiency. We demonstrate it for the simplest non-Abelian group addressable with this procedure, D 8 , in the cases of both one and two spatial dimensions. Then, with the objective of running a variational quantum simulation on real quantum hardware, we map the D 8 LGT onto qudit systems with local interactions. We propose a variational scheme for the qudit system with a local Hamiltonian, which can be implemented on a universal qudit quantum device. Our results show the effectiveness of the matter-removing procedure, solving the redundancy problem, and reducing the amount of quantum resources. This approach can serve as a way of simulating LGTs in high spatial dimensions, with non-Abelian gauge groups, and including dynamical fermions.
Quantum simulation provides a promising framework for studying non-perturbative phenomena in lattice gauge theories that are difficult to access using classical computational methods. In particular, classical Monte Carlo approaches suffer from the sign problem, limiting their applicability to real-time dynamics and finite-density regimes. Quantum computers, by directly encoding quantum dynamics, offer a natural pathway to overcoming these limitations. In this thesis, we study quantum simulations of a truncated SU(2) lattice gauge theory using a Hamiltonian formulation, representing an important non-Abelian step toward quantum chromodynamics. We focus on three-dimensional gauge-theory simulations in the noisy intermediate-scale quantum (NISQ) era, where limited qubit resources pose a significant challenge. To address this, we introduce the triamond lattice, a three-dimensional lattice geometry that enforces local gauge invariance while providing an economical encoding of gauge degrees of freedom, thereby reducing qubit overhead compared to conventional lattice constructions. We derive the corresponding Hamiltonian, construct physical gauge-invariant states, and implement quantum simulations using quantum imaginary time evolution to prepare ground states, alongside real-time evolution methods to study dynamical behavior. Error-mitigation techniques are employed to extract reliable physical observables from noisy quantum hardware. Our results demonstrate that the triamond lattice enables resource-efficient three-dimensional quantum gauge simulations and represents a practical step toward scalable quantum simulations of non-perturbative gauge theories.
This thesis investigates advances in quantum simulation methods for lattice gauge theories, with a focus on (2+1)-dimensional quantum electrodynamics (QED), which shares important features with (3+1)-dimensional quantum chromodynamics (QCD), such as confinement and asymptotic freedom. Two main projects are developed. The first project investigates the ongoing coupling in a compact pure U(1) gauge theory using a step-scaling function approach. A quantum variational method allows calculations over a wide range of couplings. Plaquette expectation value results are compared with classical Monte Carlo simulations to obtain, in principle, the physical value of the lattice spacing. This method can potentially be extended to the study of QED, which also includes fermionic matter. The second project investigates the static potential between two charges, analyzing the Coulomb, confining, and string-breaking regimes. It involves the development of a tailored variational approach that incorporates system symmetries and mutual information to represent fermionic degrees of freedom. Results from a trapped-ion quantum device agree well with classical simulations, validating the method. Furthermore, this work evaluates superconducting quantum devices, noting issues with noise but also demonstrating improvements in hardware and potential through error limitation. Overall, this work underscores the feasibility of variational quantum algorithms for lattice gauge theory simulations and demonstrates their promise for advancing theoretical physics with quantum computers. This thesis explores advancements in quantum simulation methods for lattice gauge theories, focusing on (2+1)-dimensional Quantum Electrodynamics (QED), which shares key features with (3+1)-dimensional Quantum Chromodynamics (QCD), such as confinement and asymptotic freedom. Two main projects are developed. The first investigates the running coupling in a compact U(1) pure gauge theory using a step scaling function approach. A quantum variational method enables computation across a wide range of couplings. The plaquette expectation value is matched with classical Monte Carlo simulations to obtain, in principle, the physical value of the lattice spacing. This method can be eventually extended to study QED, where fermionic matter is included. The second project examines the static potential between two charges, analyzing Coulomb, confining, and string-breaking regimes. It involves developing a custom variational Ansatz that incorporates system symmetries and mutual information to represent fermionic degrees of freedom. Results from a trapped-ion quantum device align well with exact classical simulations, validating the method. Additionally, the thesis evaluates superconducting devices, identifying noise challenges but noting improvements in hardware and the potential of error mitigation. Overall, this work highlights the viability of variational quantum algorithms for lattice gauge theory simulations and demonstrates their promise for advancing theoretical physics with quantum computing.
Recent developments in mapping lattice gauge theories relevant to the Standard Model onto digital quantum computers identify scalable paths with well-defined quantum compilation challenges toward the continuum. As an entry point to these challenges, we address the simulation of SU(2) lattice gauge theory. Using qudit registers to encode the digitized gauge field, we provide quantum resource estimates, in terms of elementary qudit gates, for arbitrarily high local gauge field truncations. We then demonstrate an end-to-end simulation of real-time, qutrit-digitized SU(2) dynamics on a cube. Through optimizing the simulation, we improved circuit decompositions for uniformly controlled qudit rotations, an algorithmic primitive for general applications of quantum computing. The decompositions also apply to mixed-dimensional qudit systems, which we found advantageous for compiling lattice gauge theory simulations. Furthermore, we parallelize the evolution of opposite faces in anticipation of similar opportunities arising in three-dimensional lattice volumes. This work details an ambitious executable for future qudit hardware and attests to the value of codesign strategies between lattice gauge theory simulation and quantum compilation.
Quantum computing promises to revolutionize several scientific and technological domains through fundamentally new ways of processing information. Among its most compelling applications is digital quantum simulation, where quantum computers are used to replicate the behavior of other quantum systems. This could enable the study of problems that are otherwise intractable on classical computers, transforming fields such as quantum chemistry, condensed matter physics, and materials science. Despite this potential, realizations of practical quantum advantage for relevant problems are hindered by imperfections of current devices. This also affects quantum hardware based on superconducting circuits which is among the most advanced and scalable platforms. The envisaged long-term solution of fault-tolerant quantum computers that correct their own errors remains out of reach mainly due to the associated qubit number overhead. As a result, the field has developed strategies that combine quantum and classical resources, exploit hardware-native operations, and employ error mitigation techniques to extract meaningful results from noisy data. This doctoral thesis contributes to this broader effort by exploring methods for advancing quantum simulation across the full computational stack, including hardware-level innovations, refined techniques for noise modeling and error mitigation, and algorithmic improvements enabled by efficient measurement processing.