Solving lattice gauge theories using the quantum Krylov algorithm and qubitization

Abstract

Computing vacuum states of lattice gauge theories (LGTs) containing fermionic degrees of freedom can present significant challenges for classical computation using Monte-Carlo methods. Quantum algorithms may offer a pathway towards more scalable computation of groundstate properties of LGTs. However, a comprehensive understanding of the quantum computational resources required for such a problem is thus far lacking. In this work, we investigate using the quantum subspace expansion (QSE) algorithm to compute the groundstate of the Schwinger model, an archetypal LGT describing quantum electrodynamics in one spatial dimension. We perform numerical simulations, including the effect of measurement noise, to extrapolate the resources required for the QSE algorithm to achieve a desired accuracy for a range of system sizes. Using this, we present a full analysis of the resources required to compute LGT vacuum states using a quantum algorithm using qubitization within a fault tolerant framework. We develop of a novel method for performing qubitization of a LGT Hamiltonian based on a 'linear combination of unitaries' (LCU) approach. The cost of the corresponding block encoding operation scales as $\tilde{O}(N)$ with system size $N$. Including the corresponding prefactors, our method reduces the gate cost by multiple orders of magnitude when compared to previous LCU methods for the QSE algorithm, which scales as $\tilde{O}(N^2)$ when applied to the Schwinger model. While the qubit and single circuit T-gate cost resulting from our resource analysis is appealing to early fault-tolerant implementation, we find that the number of shots required to avoid numerical instability within the QSE procedure must be significantly reduced in order to improve the feasibility of the methodology we consider and discuss how this might be achieved.

22+22 pages, 7+9 figures, 0+5 tables. Published version

References in corpus (72)

• Barren plateaus in quantum neural network training landscapes
• Computational complexity and fundamental limitations to fermionic quantum Monte Carlo simulations
• Cost Function Dependent Barren Plateaus in Shallow Parametrized Quantum Circuits
• Hamiltonian Simulation by Qubitization
• Determining eigenstates and thermal states on a quantum computer using quantum imaginary time evolution
• Connecting ansatz expressibility to gradient magnitudes and barren plateaus
• Self-Verifying Variational Quantum Simulation of the Lattice Schwinger Model
• Quantum singular value transformation and beyond: exponential improvements for quantum matrix arithmetics
• Hybrid Quantum-Classical Hierarchy for Mitigation of Decoherence and Determination of Excited States
• Simulating Lattice Gauge Theories within Quantum Technologies
• Robust determination of molecular spectra on a quantum processor
• Quantum-Classical Computation of Schwinger Model Dynamics using Quantum Computers
• A random compiler for fast Hamiltonian simulation
• A Race Track Trapped-Ion Quantum Processor
• Quantum Simulation for High Energy Physics
• Computational Complexity of interacting electrons and fundamental limitations of Density Functional Theory
• The mass spectrum of the Schwinger model with Matrix Product States
• Qubitization of Arbitrary Basis Quantum Chemistry Leveraging Sparsity and Low Rank Factorization
• N-representability is QMA-complete
• Magic State Distillation: Not as Costly as You Think
• Quantum Computing for High-Energy Physics: State of the Art and Challenges. Summary of the QC4HEP Working Group
• Increasing the representation accuracy of quantum simulations of chemistry without extra quantum resources
• Matrix product states for gauge field theories
• Quantum simulation of a lattice Schwinger model in a chain of trapped ions
• Real-time Dynamics in U(1) Lattice Gauge Theories with Tensor Networks
• Ground state preparation and energy estimation on early fault-tolerant quantum computers via quantum eigenvalue transformation of unitary matrices
• A Non-Orthogonal Variational Quantum Eigensolver
• Quantum Algorithms for Simulating the Lattice Schwinger Model
• Towards simulating 2D effects in lattice gauge theories on a quantum computer
• Digital Quantum Simulation of the Schwinger Model and Symmetry Protection with Trapped Ions
• Real Time Dynamics and Confinement in the ${\mathbb{Z}}_n$ Schwinger-Weyl lattice model for 1+1 QED
• Decoding quantum errors with subspace expansions
• Quantum simulation of the Schwinger model: A study of feasibility
• On barren plateaus and cost function locality in variational quantum algorithms
• Quantum Krylov subspace algorithms for ground and excited state energy estimation
• Phase transition in Random Circuit Sampling
• Quantum simulation of non-equilibrium dynamics and thermalization in the Schwinger model
• Quantum Power Method by a Superposition of Time-Evolved States
• Efficient Basis Formulation for (1+1)-Dimensional SU(2) Lattice Gauge Theory: Spectral calculations with matrix product states
• Topological vacuum structure of the Schwinger model with matrix product states
• Real-time simulation of the Schwinger effect with Matrix Product States
• Chiral condensate in the Schwinger model with Matrix Product Operators
• A measurement-based variational quantum eigensolver
• Finite-representation approximation of lattice gauge theories at the continuum limit with tensor networks
• Generalized quantum subspace expansion
• Phase Transitions in $Z_n$ Gauge Models: Towards Quantum Simulations of the Schwinger-Weyl QED
• Exact and efficient Lanczos method on a quantum computer
• Quantum Filter Diagonalization: Quantum Eigendecomposition without Full Quantum Phase Estimation
• Provably accurate simulation of gauge theories and bosonic systems
• Entanglement generation in $(1+1)D$ QED scattering processes
• A theory of quantum subspace diagonalization
• Quantum Algorithms for Fermionic Quantum Field Theories
• Tensor Networks and their use for Lattice Gauge Theories
• Realization of quantum signal processing on a noisy quantum computer
• Faster Quantum Algorithm to simulate Fermionic Quantum Field Theory
• Accelerating lattice quantum field theory calculations via interpolator optimization using NISQ-era quantum computing
• Towards the continuum limit of a $(1+1)$d quantum link Schwinger model
• Two-dimensional ${\mathbb{Z}}_2$ lattice gauge theory on a near-term quantum simulator: variational quantum optimization, confinement, and topological order
• Gauge invariant quantum circuits for $U(1)$ and Yang-Mills lattice gauge theories
• Tensor network simulation of QED on infinite lattices: learning from (1+1)d, and prospects for (2+1)d
• Real-Time Krylov Theory for Quantum Computing Algorithms
• Lanczos recursion on a quantum computer for the Green's function and ground state
• Hamiltonian operator approximation for energy measurement and ground state preparation
• Nearly-optimal state preparation for quantum simulations of lattice gauge theories
• Exploring the CP-violating Dashen phase in the Schwinger model with tensor networks
• A stochastic quantum Krylov protocol with double factorized Hamiltonians
• Analysis of quantum Krylov algorithms with errors
• Site-by-site quantum state preparation algorithm for preparing vacua of fermionic lattice field theories
• Coarse grained intermolecular interactions on quantum processors
• Decomposing Quantum Generalized Toffoli with an Arbitrary Number of Ancilla
• Tensor networks for gauge field theories
• Efficient Implementation of Multi-Controlled Quantum Gates

Cited by in corpus (4)

• Block encoding bosons by signal processing
• Partitioned Quantum Subspace Expansion
• Fermion Discretization Effects in the Two-Flavor Lattice Schwinger Model: A Study with Matrix Product States
• Eigenstate Thermalization in 1+1-Dimensional SU(2) Lattice Gauge Theory Coupled with Dynamical Fermions