Abstract

The Schwinger model (quantum electrodynamics in 1+1 dimensions) is a testbed for the study of quantum gauge field theories. We give scalable, explicit digital quantum algorithms to simulate the lattice Schwinger model in both NISQ and fault-tolerant settings. In particular, we perform a tight analysis of low-order Trotter formula simulations of the Schwinger model, using recently derived commutator bounds, and give upper bounds on the resources needed for simulations in both scenarios. In lattice units, we find a Schwinger model onN/2physical sites with coupling constantx−1/2and electric field cutoffx−1/2Λcan be simulated on a quantum computer for time2xTusing a number ofT-gates or CNOTs inO~(N3/2T3/2xΛ)for fixed operator error. This scaling with the truncationΛis better than that expected from algorithms such as qubitization or QDRIFT. Furthermore, we give scalable measurement schemes and algorithms to estimate observables which we cost in both the NISQ and fault-tolerant settings by assuming a simple target observable–the mean pair density. Finally, we bound the root-mean-square error in estimating this observable via simulation as a function of the diamond distance between the ideal and actual CNOT channels. This work provides a rigorous analysis of simulating the Schwinger model, while also providing benchmarks against which subsequent simulation algorithms can be tested.

Highlights

  • The 20th century saw tremendous success in discovering and explaining the properties of Nature at the smallest accessible length scales, with just one of the crowning achievements being the formulation of the Standard Model

  • We report explicit algorithms that could be used for time evolution in the lattice Schwinger model, a gauge theory in one spatial dimension that shares qualitative features with quantum chromodynamics (QCD) [66]— making it a testbed for the gauge theories that are so central to the Standard Model

  • Due to the need to work with hardware constraints that will change over time, we provide algorithms that could be realized in the Noisy Intermediate Scale Quantum (NISQ) era, followed by efficient algorithms suitable for fault-tolerant computers where the most costly operation has transitioned from entangling gates (CNOT gates), to non-Clifford operations (T -gates)

Read more

Summary

Introduction

The 20th century saw tremendous success in discovering and explaining the properties of Nature at the smallest accessible length scales, with just one of the crowning achievements being the formulation of the Standard Model. While strides are being made in developing the theory for quantum simulation of gauge field theories [3, 4, 6, 8, 19, 27, 34, 44, 46, 53,54,55,56, 60, 62, 64, 65, 71, 78, 79, 86, 87], much remains to be explored in terms of developing explicit gate implementations that are scalable and can surpass what is possible with classical machines. We discuss how to take advantage of the geometric locality of the lattice Schwinger model Hamiltonian may be used in simulating time evolution or in estimating expectation values of observables in Section 8 before concluding

Schwinger Model Hamiltonian
Qubit Representation of the Hamiltonian
Trotterized Time Evolution
Comparison to Qubitization and Linear Combination of Unitaries Methods
Trotter-Suzuki Decomposition for the Schwinger Model
Noisy Entangling Gate Model
Fault-Tolerant Model
Trotter Step Implementation for Noisy Entangling Gate Model
Cost to Implement Approximate Time Step in Noisy Entangling Gate Model
Trotter Step Implementation in Fault-Tolerant Model
Cost to Implement Approximate Time Step in Fault-Tolerant Setting
Estimating Mean Pair Density
Estimating Mean Pair Density using Sampling
Estimating Mean Pair Density using Amplitude Estimation
Importance Sampling
Simulation including Estimation of Mean Pair Density
Cost Analysis in Fault-Tolerant Model
Cost Analysis in NEG Model
Therefore we have that min
Incorporating Locality Constraints via the Lieb-Robinson Bound
Conclusion
10 Acknowledgements
11 Notations
A Computing Commutators for Second-Order Error Bound
B Numerical Evaluation and Analysis of T -Count Upper Bounds
Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call