In this work, we implement a variational quantum eigensolver (VQE) suitable for investigating ground states and static string breaking in a Z 2 lattice gauge theory (LGT). We consider a two-leg ladder lattice with Kogut-Susskind staggered fermions and verify the results of the VQE simulations using tensor network methods. We find that for varying Hamiltonian parameter regimes and in the presence of external charges, the VQE is able to arrive at the gauge-invariant ground state without explicitly enforcing gauge invariance through penalty terms. Additionally, experiments showing string breaking are performed on IBM’s quantum platform. Thus, VQEs are seen to be a promising tool for Z 2 LGTs, and could serve as a stepping stone toward studies of other gauge groups. We find that the scaling of gradients with the number of qubits is favorable for avoiding barren plateaus. Furthermore, strategies that avoid barren plateaus arise naturally as features of LGTs, such as choosing the initialization by setting the Gauss law sector and restricting the Hilbert space to the gauge-invariant subspace.
In this work, we implement a variational quantum eigensolver (VQE) suitable for investigating ground states and static string breaking in a Z 2 lattice gauge theory (LGT). We consider a two-leg ladder lattice with Kogut-Susskind staggered fermions and verify the results of the VQE simulations using tensor network methods. We find that for varying Hamiltonian parameter regimes and in the presence of external charges, the VQE is able to arrive at the gauge-invariant ground state without explicitly enforcing gauge invariance through penalty terms. Additionally, experiments showing string breaking are performed on IBM’s quantum platform. Thus, VQEs are seen to be a promising tool for Z 2 LGTs, and could serve as a stepping stone toward studies of other gauge groups. We find that the scaling of gradients with the number of qubits is favorable for avoiding barren plateaus. Furthermore, strategies that avoid barren plateaus arise naturally as features of LGTs, such as choosing the initialization by setting the Gauss law sector and restricting the Hilbert space to the gauge-invariant subspace.
We investigate static and dynamical aspects of string breaking in a Z 2 lattice gauge theory coupled to Kogut-Susskind staggered fermions. Using tensor network simulations, we demonstrate that the static potential as well as the site-resolved configuration of the matter sites and gauge links allows us to identify the regimes in which string breaking occurs. Furthermore, we develop a variational quantum eigensolver that allows for reliably preparing the ground state of the theory in both the absence and presence of static charges and to capture the static aspects of the phenomenon. Carrying out state preparation on real quantum hardware for up to 19 qubits, we demonstrate its suitability for current quantum devices. In addition, we study the real-time dynamics of a flux tube between two static charges using both tensor networks and quantum hardware. Using a trotterization for the time-evolution operator, we are able to show that the breaking process starts with the creation of charges inside the string. These eventually redistribute toward the static charges and screen them, which leads to the breaking of the flux tube.
Computing the vacuum and energy spectrum in non-Abelian, interacting lattice gauge theories remains an open challenge, in part because approximating the continuum limit requires large lattices and huge Hilbert spaces. To address this difficulty with near-term quantum computing devices, we adapt the variational quantum eigensolver to non-Abelian gauge theories. We outline scaling advantages when using a spin-network basis to simulate the gauge-invariant Hilbert space and develop a systematic state preparation ansatz that creates gauge-invariant excitations while alleviating the barren plateau problem. We illustrate our method in the context of SU(2) Yang-Mills theory by testing it on a minimal toy model consisting of a single vertex in 3+1 dimensions. In this toy model, simulations allow us to investigate the impact of noise expected in current quantum devices.
Variational Quantum Eigensolver (VQE) algorithms suffer from barren plateaus, where gradients vanish with system size and circuit depth. Although many mitigation strategies exist, their connection to convergence performance under different iteration budgets remains unclear. Moreover, a systematic analysis identifying which state-of-the-art mitigation techniques perform best under specific scenarios is also lacking. We benchmark four approaches, Local-Global, Adiabatic, State Efficient Ansatz (SEA), and Pretrained VQE, against standard VQE on molecular systems from 4 to 14 qubits, analyzing gradient variance up to 50 layers and convergence over 1000 iterations. Our results show that the impact of gradient preservation is iteration-dependent. In the 14-qubit BeH2 system, Pretrained VQE outperforms SEA at 100 iterations despite lower gradient variance, but SEA becomes 2.2x more accurate at 1000 iterations. For smaller systems, SEA achieves near-exact energies (H2: 10^-5 Ha, LiH: 2x10^-4 Ha) with fidelities 0.999, while standard methods plateau early. The results demonstrate that robust barren plateau mitigation depends on aligning the chosen strategy with both system size and available computational budget, rather than treating gradient variance as the sole predictor of performance.
We introduce the Cyclic Variational Quantum Eigensolver (CVQE), a hardware-efficient framework for accurate ground-state quantum simulation on noisy intermediate-scale quantum (NISQ) devices. CVQE departs from conventional VQE by incorporating a measurement-driven feedback cycle: Slater determinants with significant sampling probability are iteratively added to the reference superposition, while a fixed entangler (e.g., single-layer UCCSD) is reused throughout. This adaptive reference growth systematically enlarges the variational space in most promising directions, avoiding manual ansatz or operator-pool design, costly searches, and preserving compile-once circuits. The strategy parallels multi-reference methods in quantum chemistry, while remaining fully automated on quantum hardware. Remarkably, CVQE exhibits a distinctive staircase-like descent pattern, where successive energy drops sharply signal efficient escape from barren plateaus. Benchmarks show that CVQE consistently maintains chemical precision across correlation regimes, outperforms fixed UCCSD by several orders of magnitude, and achieves favorable accuracy-cost trade-offs compared to the Selected Configuration Interaction. These results position CVQE as a scalable, interpretable, and resource-efficient paradigm for near-term quantum simulation.
Variational minimization of tensor network states enables the exploration of low energy states of lattice gauge theories. However, the exact numerical evaluation of high-dimensional tensor network states remains challenging in general. In [E. Zohar and J. I. Cirac, Phys. Rev. D 97, 034510 (2018)] it was shown how, by combining gauged Gaussian projected entangled pair states with a variational Monte Carlo procedure, it is possible to efficiently compute physical observables. In this paper we demonstrate how this approach can be used to investigate numerically the ground state of a lattice gauge theory. More concretely, we explicitly carry out the variational Monte Carlo procedure based on such contraction methods for a pure gauge Kogut-Susskind Hamiltonian with a Z3 gauge field in two spatial dimensions. This is a first proof of principle to the method, which provides an inherent way to increase the number of variational parameters and can be readily extended to systems with physical fermions.
Abstract—Quantum Machine Learning (QML) operating on Noisy Intermediate-Scale Quantum (NISQ) hardware represents an emerging computational paradigm to address high-dimensional optimization problems that challenge classical Von Neumann supercomputing architectures. By mapping complex feature vectors into exponentially large 2^N Hilbert state spaces via Parameterized Quantum Circuits (PQCs) and Variational Quantum Algorithms (VQAs), QML targets computational advantages in combinatorial optimization, high-dimensional classification, and quantum-enhanced molecular modeling. However, the theoretical promise of NISQ-era variational computing is severely constrained by three fundamental bottlenecks: (1) Barren Plateaus, characterized by the exponential concentration of measure and vanishing variance of cost function gradients; (2) Hardware Decoherece Noise and readout error rates that corrupt quantum state fidelity; and (3) Classical-to-Quantum State Preparation bottlenecks that can erase theoretical computational speedups. This paper delivers an exhaustive, mathematically formal technical investigation and empirical benchmark of QML architectures for high-dimensional optimization. We formalize the Haar-distributed geometric mechanics of barren plateaus under 2-design unitary assumptions, evaluate barren plateau mitigation through shallow local cost operators and layer-by-layer parameter initialization, and contrast Variational Quantum Eigensolvers (VQE) with Quantum Kernel Support Vector Machines (Q-SVM). Furthermore, we construct an empirical benchmarking testbed executing across both state-vector simulators and superconducting quantum backends (IBM Quantum Heron / Eagle architectures), evaluating 127-qubit Hamiltonian optimization and high-dimensional financial portfolio allocation. Our findings demonstrate that while global cost functions suffer exponential gradient decay Var[grad] ~ O(2^-N) across circuit depth d >= 4, local Hamiltonian decomposition maintains trainable variance, achieving a 98.2% ground-state fidelity under zero-noise extrapolation (ZNE) error mitigation. Finally, we formulate open challenges in quantum error mitigation scaling, non-perturbative barren plateau escapes, and quantum data loading efficiency. Index Terms—Quantum Machine Learning (QML), Parameterized Quantum Circuits (PQCs), Variational Quantum Eigensolver (VQE), Barren Plateaus, Quantum Kernel Methods, NISQ Computing, Error Mitigation, Hilbert Space.