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

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

Mirza Adnan Mohtashim

Published May 9, 2026• 0 citations
Publisher

Abstract

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.

DOI
10.5281/zenodo.20093135

Related papers

Quantum many-body inspired algorithms for quantum simulation on NISQ devices

Riccardo Cioli

Quantum computers provide a promising platform to understand and control the dynamics of quantum many-body systems, yet current devices operate in the noisy intermediate-scale quantum (NISQ) regime, where decoherence caused by interactions with the environment severely limit their ability to accurately carry out computations. This thesis investigates how these limitations affect the simulation of quantum many-body systems, and explores strategies to design efficient quantum algorithms that can operate under realistic experimental constraints. In the first part, we assess the performance of currently available quantum hardware using lattice gauge theory as a challenging testbed. We study digital quantum simulations of a one-dimensional discretization of quantum electrodynamics on Rydberg atom and superconducting platforms, combining classical simulations with realistic noise models and quantum simulations on actual cloud-accessible devices, and analyze the impact of decoherence and gate errors on the accurate reconstruction of dynamical observables. Our findings show that, for the hardware available at the time of the study, reliable simulations without high quality error mitigation are restricted to short circuit depths or small system sizes. These limitations motivate the second part of the work, where we focus on constructing resource-efficient quantum algorithms by exploiting physical insight from quantum many-body physics. First, we introduce an approximate inversion protocol for classical shadows that enables the efficient estimation of global properties of quantum states using shallow quantum circuits. Then, we propose an algorithm for the preparation of short-range correlated quantum states, based on reconstructing the global state by learning local reduced density matrices through classical variational optimization. Taken together, the results of this thesis provide insight into the capabilities of currently available quantum devices and demonstrate how structure inherent to quantum many-body systems can be leveraged to design algorithms compatible with current hardware.

•Nov 10, 2026•0 citations

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

Alberto Bottarelli

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

•May 28, 2026•0 citations

Quantum Machine Learning for Noisy Intermediate-Scale Quantum Devices: A Comprehensive Review

Quantum computing has emerged as a transformative paradigm capable of addressing computational challenges beyond the reach of classical systems.In the current era of Noisy Intermediate-Scale Quantum (NISQ) devices, practical quantum hardware is characterized by limited qubit counts, short coherence times, gate errors, and the absence of full error correction.Despite these constraints, significant progress has been made in developing quantum machine learning (QML) techniques tailored to operate on near-term quantum processors.This paper presents a comprehensive review of Quantum Machine Learning in the context of NISQ computing.We first outline the fundamental principles of quantum computing, including qubits, superposition, entanglement, and quantum parallelism, followed by a detailed discussion of the NISQ computing model and its hardware limitations.The review then examines hybrid quantum-classical learning frameworks, variational quantum algorithms, quantum data encoding strategies, and noise mitigation techniques that enable practical implementation on existing platforms.Emerging applications across healthcare, finance, cybersecurity, climate modeling, and materials science are also surveyed to highlight the real-world potential of QML.Furthermore, key challenges such as scalability, trainability issues, and algorithmic robustness are analyzed, along with current research efforts aimed at overcoming these barriers.The paper concludes by identifying promising future directions for advancing QML toward quantum advantage.This review aims to provide researchers and practitioners with a structured understanding of the capabilities, limitations, and opportunities of quantum machine learning in the NISQ era .

International Research Journal of Modernization in Engineering Technology and Science•Apr 9, 2026•0 citations

NISQ in practice: navigating noise, scale, and hardware constraints of near-term devices in quantum machine learning workflows

Chisomo Daka, Somnath Bhattacharyya

Abstract The arrival of noisy intermediate-scale quantum (NISQ) devices defines an era in which quantum utility is fundamentally constrained by finite coherence times, limited qubit counts, gate infidelities, restricted connectivity, and measurement noise. Within this regime, hybrid quantum-classical frameworks have emerged as the dominant operational paradigm, particularly for quantum machine learning (QML). This review identifies a fundamental trade-off between expressivity, trainability, and noise resilience that governs the performance and scalability of NISQ-era QML systems. To contextualize these challenges, we introduce the resource-constrained iterative routing framework, a hardware-aware conceptual architecture that integrates topology-aware classical compression and distributed quantum orchestration to maintain circuit depths within device-dependent limits while routing representations toward symmetry-constrained Hilbert subspaces to mitigate noise-induced barren plateaus. Furthermore, we shift the discussion of quantum advantage away from asymptotic fault-tolerant complexity toward the notion of operational NISQ advantage based on finite-resource scaling, trainability preservation, and sampling complexity. We evaluate the practical resource efficiency of variational quantum algorithms, quantum kernel methods, and quantum neural networks across superconducting, trapped-ion, neutral-atom, and photonic platforms. The review also examines reproducibility challenges, emphasizing benchmarking against optimized classical baselines, and discusses strategies for managing the sampling overhead of error mitigation alongside distributed execution and quantum circuit compilation. Ultimately, NISQ in Practice positions hybrid QML as a physically constrained computational paradigm while outlining a pathway from contemporary noisy workflows toward early fault-tolerant quantum architectures.

New Journal of Physics•Jun 22, 2026•1 citation

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

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
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 computers provide a promising platform to understand and control the dynamics of quantum many-body systems, yet current devices operate in the noisy intermediate-scale quantum (NISQ) regime, where decoherence caused by interactions with the environment severely limit their ability to accurately carry out computations. This thesis investigates how these limitations affect the simulation of quantum many-body systems, and explores strategies to design efficient quantum algorithms that can operate under realistic experimental constraints. In the first part, we assess the performance of currently available quantum hardware using lattice gauge theory as a challenging testbed. We study digital quantum simulations of a one-dimensional discretization of quantum electrodynamics on Rydberg atom and superconducting platforms, combining classical simulations with realistic noise models and quantum simulations on actual cloud-accessible devices, and analyze the impact of decoherence and gate errors on the accurate reconstruction of dynamical observables. Our findings show that, for the hardware available at the time of the study, reliable simulations without high quality error mitigation are restricted to short circuit depths or small system sizes. These limitations motivate the second part of the work, where we focus on constructing resource-efficient quantum algorithms by exploiting physical insight from quantum many-body physics. First, we introduce an approximate inversion protocol for classical shadows that enables the efficient estimation of global properties of quantum states using shallow quantum circuits. Then, we propose an algorithm for the preparation of short-range correlated quantum states, based on reconstructing the global state by learning local reduced density matrices through classical variational optimization. Taken together, the results of this thesis provide insight into the capabilities of currently available quantum devices and demonstrate how structure inherent to quantum many-body systems can be leveraged to design algorithms compatible with current hardware.
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
Quantum computing has emerged as a transformative paradigm capable of addressing computational challenges beyond the reach of classical systems.In the current era of Noisy Intermediate-Scale Quantum (NISQ) devices, practical quantum hardware is characterized by limited qubit counts, short coherence times, gate errors, and the absence of full error correction.Despite these constraints, significant progress has been made in developing quantum machine learning (QML) techniques tailored to operate on near-term quantum processors.This paper presents a comprehensive review of Quantum Machine Learning in the context of NISQ computing.We first outline the fundamental principles of quantum computing, including qubits, superposition, entanglement, and quantum parallelism, followed by a detailed discussion of the NISQ computing model and its hardware limitations.The review then examines hybrid quantum-classical learning frameworks, variational quantum algorithms, quantum data encoding strategies, and noise mitigation techniques that enable practical implementation on existing platforms.Emerging applications across healthcare, finance, cybersecurity, climate modeling, and materials science are also surveyed to highlight the real-world potential of QML.Furthermore, key challenges such as scalability, trainability issues, and algorithmic robustness are analyzed, along with current research efforts aimed at overcoming these barriers.The paper concludes by identifying promising future directions for advancing QML toward quantum advantage.This review aims to provide researchers and practitioners with a structured understanding of the capabilities, limitations, and opportunities of quantum machine learning in the NISQ era .
Abstract The arrival of noisy intermediate-scale quantum (NISQ) devices defines an era in which quantum utility is fundamentally constrained by finite coherence times, limited qubit counts, gate infidelities, restricted connectivity, and measurement noise. Within this regime, hybrid quantum-classical frameworks have emerged as the dominant operational paradigm, particularly for quantum machine learning (QML). This review identifies a fundamental trade-off between expressivity, trainability, and noise resilience that governs the performance and scalability of NISQ-era QML systems. To contextualize these challenges, we introduce the resource-constrained iterative routing framework, a hardware-aware conceptual architecture that integrates topology-aware classical compression and distributed quantum orchestration to maintain circuit depths within device-dependent limits while routing representations toward symmetry-constrained Hilbert subspaces to mitigate noise-induced barren plateaus. Furthermore, we shift the discussion of quantum advantage away from asymptotic fault-tolerant complexity toward the notion of operational NISQ advantage based on finite-resource scaling, trainability preservation, and sampling complexity. We evaluate the practical resource efficiency of variational quantum algorithms, quantum kernel methods, and quantum neural networks across superconducting, trapped-ion, neutral-atom, and photonic platforms. The review also examines reproducibility challenges, emphasizing benchmarking against optimized classical baselines, and discusses strategies for managing the sampling overhead of error mitigation alongside distributed execution and quantum circuit compilation. Ultimately, NISQ in Practice positions hybrid QML as a physically constrained computational paradigm while outlining a pathway from contemporary noisy workflows toward early fault-tolerant quantum architectures.
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.
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.