Self-mitigating Trotter circuits for SU(2) lattice gauge theory on a quantum computer

• URL: http://arxiv.org/abs/2205.09247v2
• Date: Fri, 14 Oct 2022 02:29:37 GMT
• Title: Self-mitigating Trotter circuits for SU(2) lattice gauge theory on a quantum computer
• Abstract summary: Quantum computers can implement lattice gauge theory in Minkowski rather than Euclidean spacetime. In this work, calculations within SU(2) pure gauge theory are able to show the motion of an excitation traveling across a spatial lattice in real time.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Quantum computers offer the possibility to implement lattice gauge theory in Minkowski rather than Euclidean spacetime, thus allowing calculations of processes that evolve in real time. In this work, calculations within SU(2) pure gauge theory are able to show the motion of an excitation traveling across a spatial lattice in real time. This is accomplished by using a simple yet powerful method for error mitigation, where the original circuit is used both forward and backward in time. For a two-plaquette lattice, meaningful results are obtained from a circuit containing hundreds of CNOT gates. The same method is used for a five-plaquette lattice, where calculations show that residual systematic effects can be reduced through follow-up mitigation.

Related papers

• Simulation of exchange coupling effects in double quantum dot FinFET-like structures [43.64338380623755]
  We use a GPU-accelerated Schrdinger-Poisson solver to characterize exchange coupling in a hole spin double-qubit device.<n>We show that our simulation framework is capable of reproducing the magneto-electrostatic behavior of the devices of interest.
  arXiv  Detail & Related papers  (2026-07-09T13:08:37Z)
• Classical simulation of parity-preserving quantum circuits [0.0]
  We present a classical simulation method for fermionic quantum systems without loss of generality. We map such circuits to a fermionic tensor network and introduce a novel decomposition of non-Matchgate gates. Our algorithm significantly lowers resource requirements for simulating parity-preserving circuits while retaining high accuracy.
  arXiv  Detail & Related papers  (2025-04-27T17:42:39Z)
• Quantum computation of SU(2) lattice gauge theory with continuous variables [0.0]
  We present a quantum computational framework for SU(2) lattice gauge theory. We leverage continuous variables instead of discrete qubits to represent the infinite-dimensional Hilbert space of the gauge fields.
  arXiv  Detail & Related papers  (2024-10-18T16:29:39Z)
• On the Constant Depth Implementation of Pauli Exponentials [49.48516314472825]
  We decompose arbitrary exponentials into circuits of constant depth using $mathcalO(n)$ ancillae and two-body XX and ZZ interactions. We prove the correctness of our approach, after introducing novel rewrite rules for circuits which benefit from qubit recycling.
  arXiv  Detail & Related papers  (2024-08-15T17:09:08Z)
• A multiple-circuit approach to quantum resource reduction with application to the quantum lattice Boltzmann method [39.671915199737846]
  We introduce a multiple-circuit algorithm for a quantum lattice Boltzmann method (QLBM) solve of the incompressible Navier--Stokes equations.<n>The presented method is validated and demonstrated for 2D lid-driven cavity flow.
  arXiv  Detail & Related papers  (2024-01-20T15:32:01Z)
• Quantum information spreading in generalised dual-unitary circuits [44.99833362998488]
  We show that local operators spread at the speed of light as in dual-unitary circuits. We use these properties to find a closed-form expression for the entanglement membrane in these circuits.
  arXiv  Detail & Related papers  (2023-12-05T18:09:27Z)
• A Floquet-Rydberg quantum simulator for confinement in $\mathbb{Z}_2$ gauge theories [44.99833362998488]
  Recent advances in the field of quantum technologies have opened up the road for the realization of small-scale quantum simulators. We present a scalable Floquet scheme for the quantum simulation of the real-time dynamics in a $mathbbZ$ LGT. We show that an observation of gauge-invariant confinement dynamics in the Floquet-Rydberg setup is at reach of current experimental techniques.
  arXiv  Detail & Related papers  (2023-11-28T13:01:24Z)
• Forward and Backward Constrained Bisimulations for Quantum Circuits using Decision Diagrams [3.788308836856851]
  We develop efficient methods for the simulation of quantum circuits on classic computers. In particular, we show that constrained bisimulation can boost decision-diagram-based quantum circuit simulation by several orders of magnitude.
  arXiv  Detail & Related papers  (2023-08-18T12:40:47Z)
• Efficient quantum implementation of 2+1 U(1) lattice gauge theories with Gauss law constraints [1.5675763601034223]
  We show how to break the exponential scaling of a naive implementation of a U(1) gauge theory in two spatial dimensions. We study the errors from finite Suzuki-Trotter time-step, circuit approximation, and quantum noise in a calculation of an explicit observable using IBMQ superconducting qubit hardware.
  arXiv  Detail & Related papers  (2022-11-18T20:14:15Z)
• Real time evolution and a traveling excitation in SU(2) pure gauge theory on a quantum computer [0.0]
  Hamiltonian approach can be used successfully to study the real-time evolution of a non-Abelian lattice gauge theory on noisy quantum computers. Results from the real-time evolution of SU(2) pure gauge theory on IBM hardware are presented.
  arXiv  Detail & Related papers  (2022-10-20T21:43:46Z)
• Lattice Renormalization of Quantum Simulations [8.771066413050963]
  We show that trotterized time-evolution operators can be related by analytic continuation to the Euclidean transfer matrix on an anisotropic lattice. Based on the tools of Euclidean lattice field theory, we propose two schemes to determine Minkowski lattice spacings.
  arXiv  Detail & Related papers  (2021-07-02T16:10:45Z)
• Preparation of excited states for nuclear dynamics on a quantum computer [117.44028458220427]
  We study two different methods to prepare excited states on a quantum computer. We benchmark these techniques on emulated and real quantum devices. These findings show that quantum techniques designed to achieve good scaling on fault tolerant devices might also provide practical benefits on devices with limited connectivity and gate fidelity.
  arXiv  Detail & Related papers  (2020-09-28T17:21:25Z)
• Hardware-Encoding Grid States in a Non-Reciprocal Superconducting Circuit [62.997667081978825]
  We present a circuit design composed of a non-reciprocal device and Josephson junctions whose ground space is doubly degenerate and the ground states are approximate codewords of the Gottesman-Kitaev-Preskill (GKP) code. We find that the circuit is naturally protected against the common noise channels in superconducting circuits, such as charge and flux noise, implying that it can be used for passive quantum error correction.
  arXiv  Detail & Related papers  (2020-02-18T16:45:09Z)
• Simulation of Thermal Relaxation in Spin Chemistry Systems on a Quantum Computer Using Inherent Qubit Decoherence [53.20999552522241]
  We seek to take advantage of qubit decoherence as a resource in simulating the behavior of real world quantum systems. We present three methods for implementing the thermal relaxation. We find excellent agreement between our results, experimental data, and the theoretical prediction.
  arXiv  Detail & Related papers  (2020-01-03T11:48:11Z)
• Efficient classical simulation of random shallow 2D quantum circuits [104.50546079040298]
  Random quantum circuits are commonly viewed as hard to simulate classically. We show that approximate simulation of typical instances is almost as hard as exact simulation. We also conjecture that sufficiently shallow random circuits are efficiently simulable more generally.
  arXiv  Detail & Related papers  (2019-12-31T19:00:00Z)

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.