Fault-tolerant simulation of Lattice Gauge Theories with gauge covariant codes
- URL: http://arxiv.org/abs/2405.19293v1
- Date: Wed, 29 May 2024 17:21:29 GMT
- Title: Fault-tolerant simulation of Lattice Gauge Theories with gauge covariant codes
- Authors: L. Spagnoli, A. Roggero, N. Wiebe,
- Abstract summary: We show that a strong and easy connection exists between quantum error correction and Lattice Gauge Theories (LGT)
We identify the logical operations on this gauge covariant code and show that the corresponding Hamiltonian can be expressed in terms of these logical operations.
We demonstrate a method to perform fault-tolerant time evolution of the Hamiltonian within the gauge covariant code using both product formulas and qubitization approaches.
- Score: 0.0
- License: http://creativecommons.org/licenses/by/4.0/
- Abstract: We show in this paper that a strong and easy connection exists between quantum error correction and Lattice Gauge Theories (LGT) by using the Gauge symmetry to construct an efficient error-correcting code for Abelian LGTs. We identify the logical operations on this gauge covariant code and show that the corresponding Hamiltonian can be expressed in terms of these logical operations while preserving the locality of the interactions. Furthermore, we demonstrate that these substitutions actually give a new way of writing the LGT as an equivalent hardcore boson model. Finally we demonstrate a method to perform fault-tolerant time evolution of the Hamiltonian within the gauge covariant code using both product formulas and qubitization approaches. This opens up the possibility of inexpensive end to end dynamical simulations that save physical qubits by blurring the lines between simulation algorithms and quantum error correcting codes.
Related papers
- Algorithmic Fault Tolerance for Fast Quantum Computing [37.448838730002905]
We show that fault-tolerant logical operations can be performed with constant time overhead for a broad class of quantum codes.
We prove that the deviation from the ideal measurement result distribution can be made exponentially small in the code distance.
Our work sheds new light on the theory of fault tolerance, potentially reducing the space-time cost of practical fault-tolerant quantum computation by orders of magnitude.
arXiv Detail & Related papers (2024-06-25T15:43:25Z) - Quantum error thresholds for gauge-redundant digitizations of lattice
field theories [9.080653388540972]
We consider the correctable errors for generic finite gauge groups and design the quantum circuits to detect and correct them.
We calculate the error thresholds below which the gauge-redundant digitization with Gauss's law error correction has better fidelity than the gauge-fixed digitization.
arXiv Detail & Related papers (2024-02-26T17:51:48Z) - Quantum Error Correction with Gauge Symmetries [69.02115180674885]
Quantum simulations of Lattice Gauge Theories (LGTs) are often formulated on an enlarged Hilbert space containing both physical and unphysical sectors.
We provide simple fault-tolerant procedures that exploit such redundancy by combining a phase flip error correction code with the Gauss' law constraint.
arXiv Detail & Related papers (2021-12-09T19:29:34Z) - Variational Adiabatic Gauge Transformation on real quantum hardware for
effective low-energy Hamiltonians and accurate diagonalization [68.8204255655161]
We introduce the Variational Adiabatic Gauge Transformation (VAGT)
VAGT is a non-perturbative hybrid quantum algorithm that can use nowadays quantum computers to learn the variational parameters of the unitary circuit.
The accuracy of VAGT is tested trough numerical simulations, as well as simulations on Rigetti and IonQ quantum computers.
arXiv Detail & Related papers (2021-11-16T20:50:08Z) - Hybridized Methods for Quantum Simulation in the Interaction Picture [69.02115180674885]
We provide a framework that allows different simulation methods to be hybridized and thereby improve performance for interaction picture simulations.
Physical applications of these hybridized methods yield a gate complexity scaling as $log2 Lambda$ in the electric cutoff.
For the general problem of Hamiltonian simulation subject to dynamical constraints, these methods yield a query complexity independent of the penalty parameter $lambda$ used to impose an energy cost.
arXiv Detail & Related papers (2021-09-07T20:01:22Z) - Performance of teleportation-based error correction circuits for bosonic
codes with noisy measurements [58.720142291102135]
We analyze the error-correction capabilities of rotation-symmetric codes using a teleportation-based error-correction circuit.
We find that with the currently achievable measurement efficiencies in microwave optics, bosonic rotation codes undergo a substantial decrease in their break-even potential.
arXiv Detail & Related papers (2021-08-02T16:12:13Z) - Suppressing Coherent Gauge Drift in Quantum Simulations [0.0]
For gauge theories, a large class of errors violate gauge symmetry, and thus may result in unphysical processes occurring in the simulation.
We present a method, applicable to non-Abelian gauge theories, for suppressing coherent gauge drift errors through the repeated application of pseudorandom gauge transformation.
arXiv Detail & Related papers (2020-05-26T13:12:27Z) - Simulating nonnative cubic interactions on noisy quantum machines [65.38483184536494]
We show that quantum processors can be programmed to efficiently simulate dynamics that are not native to the hardware.
On noisy devices without error correction, we show that simulation results are significantly improved when the quantum program is compiled using modular gates.
arXiv Detail & Related papers (2020-04-15T05:16:24Z) - Quantum Algorithms for Simulating the Lattice Schwinger Model [63.18141027763459]
We give scalable, explicit digital quantum algorithms to simulate the lattice Schwinger model in both NISQ and fault-tolerant settings.
In lattice units, we find a Schwinger model on $N/2$ physical sites with coupling constant $x-1/2$ and electric field cutoff $x-1/2Lambda$.
We estimate observables which we cost in both the NISQ and fault-tolerant settings by assuming a simple target observable---the mean pair density.
arXiv Detail & Related papers (2020-02-25T19:18:36Z) - Term Grouping and Travelling Salesperson for Digital Quantum Simulation [6.945601123742983]
Digital simulation of quantum dynamics by evaluating the time evolution of a Hamiltonian is the initially proposed application of quantum computing.
The large number of quantum gates required for emulating the complete second quantization form of the Hamiltonian makes such an approach unsuitable for near-term devices.
We propose a new term ordering strategy, max-commute-tsp, that simultaneously mitigates both algorithmic and physical errors.
arXiv Detail & Related papers (2020-01-16T18:33:24Z)
This list is automatically generated from the titles and abstracts of the papers in this site.
This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.