The quantum link [1] Hamiltonian was introduced two decades ago a alternative to Wilson's Euclidean lattice QCD with gauge fields represented by bi-linear fermion/anti-fermion operators. When generalized this new microscopic representation of lattice field theories is referred as D-theory [2]. Recast as a Hamiltonian in Minkowski space for real time evolution, D-theory leads naturally to quantum Qubit algorithms. Here to explore digital quantum computing for gauge theories, the simplest example of U(1) compact QED on triangular lattice is defined and gauge invariant kernels for the Suzuki-Trotter expansions are expressed as Qubit circuits capable of being tested on the IMB-Q and other existing Noisy Intermediate Scale Quantum (NISQ) hardware. This is a modest step in exploring the quantum complexity of D-theory to guide future applications to high energy physics and condensed matter quantum field theories.
The quantum link [1] Hamiltonian was introduced two decades ago a alternative to Wilson's Euclidean lattice QCD with gauge fields represented by bi-linear fermion/anti-fermion operators. When generalized this new microscopic representation of lattice field theories is referred as D-theory [2]. Recast as a Hamiltonian in Minkowski space for real time evolution, D-theory leads naturally to quantum Qubit algorithms. Here to explore digital quantum computing for gauge theories, the simplest example of U(1) compact QED on triangular lattice is defined and gauge invariant kernels for the Suzuki-Trotter expansions are expressed as Qubit circuits capable of being tested on the IMB-Q and other existing Noisy Intermediate Scale Quantum (NISQ) hardware. This is a modest step in exploring the quantum complexity of D-theory to guide future applications to high energy physics and condensed matter quantum field theories.
A new quantum link microstructure was proposed for the lattice quantum chromodynamics (QCD) Hamiltonian, replacing the Wilson gauge links with a bilinear of fermionic qubits, later generalized to D-theory. This formalism provides a general framework for building lattice field theory algorithms for quantum computing. We focus mostly on the simplest case of a quantum rotor for a single compact U(1) field. We also make some progress for non-Abelian setups, making it clear that the ideas developed in the U(1) case extend to other groups. These in turn are building blocks for 1 + 0 -dimensional ( 1 + 0 -D) matrix models, 1 + 1 -D sigma models and non-Abelian gauge theories in 2 + 1 and 3 + 1 dimensions. By introducing multiple flavors for the U(1) field, where the flavor symmetry is gauged, we can efficiently approach the infinite-dimensional Hilbert space of the quantum O(2) rotor with increasing flavors. The emphasis of the method is on preserving the symplectic algebra exchanging fermionic qubits by sigma matrices (or hard bosons) and developing a formal strategy capable of generalization to a SU ( 3 ) field for lattice QCD and other non-Abelian 1 + 1 -D sigma models or 3 + 1 -D gauge theories. For U(1), we discuss briefly the qubit algorithms for the study of the discrete 1 + 1 -D sine-Gordon equation. Published by the American Physical Society 2024
The simulation of real-time dynamics in lattice gauge theories is particularly hard for classical computing due to the exponential scaling of the required resources. On the other hand, quantum algorithms can potentially perform the same calculation with a polynomial dependence on the number of degrees of freedom. A precise estimation is however particularly challenging for the simulation of lattice gauge theories in arbitrary dimensions, where gauge fields are dynamical variables, in addition to the particle fields. Moreover, there exist several choices for discretizing particles and gauge fields on a lattice, each of them coming at different prices in terms of qubit register size and circuit depth. Here we provide a resource counting for real-time evolution of U(1) gauge theories, such as quantum electrodynamics, on arbitrary dimension using the Wilson fermion representation for the particles, and the quantum link model approach for the gauge fields. We study the phenomena of flux-string breaking up to a genuine bidimensional model using classical simulations of the quantum circuits and discuss the advantages of our discretization choice in simulation of more challenging SU(N) gauge theories such as quantum chromodynamics.
<!--HTML-->Quantum link models provide an extension of Wilson's lattice gauge theory in which the link variables have operator-valued entries. For example, in a U(1) quantum link model the link variables are raising and lowering operators of quantum spins that belong to a link-based SU(2) embedding algebra. For non-Abelian SU(N), Spin(N), or Sp(N) quantum link models, the embedding algebras are SU(2N), Spin(2N), and Sp(2N), respectively. In contrast to Wilson's framework, quantum link models can be realized in a finite-dimensional link Hilbert space corresponding to a representation of the embedding algebra. This is well suited for a resource efficient implementation of quantum link models in quantum simulation experiments. The quantum link dynamics can be embodied with a finite number of well-controlled states of ultra-cold matter, including atoms in an optical lattice, ions in a trap, or quantum circuits. For example, using dual variables, a densely encoded quantum circuit has recently been constructed for a (2+1)-d U(1) quantum link model on a triangular lattice that shows qualitatively new nematic phases with rich confining dynamics. Quantum spins and quantum links are discrete quantum variables which give rise to collective low-energy excitations. In (2+1)-d, SU(N) quantum spins give rise to massless Goldstone bosons which undergo dimensional reduction to (1+1)-d asymptotically free CP(N-1) models. This can be realized in quantum simulation experiments with alkaline-earth atoms in an optical lattice. In (3+1)-d, Abelian quantum links give rise to massless photons which undergo dimensional reduction to (2+1)-d confining U(1) gauge theory, which can be embodied with spin-ice. In (4+1)-d, non-Abelian quantum links give rise to massless gluons which undergo dimensional reduction to (3+1)-d Yang-Mills theory. Quarks are naturally included as domain wall fermions. The dimensional reduction of discrete quantum variables defines D-theory, in which quantum field theories emerge from a minimal set of degrees of freedom, thus enabling resource efficient implementations in quantum simulation experiments. D-theory provides a concrete vision how to realize the ultimate long-term goal of quantum simulating QCD.
The quantum simulation of fermionic gauge field theories is one of the anticipated uses of quantum computers in the noisy intermediate-scale quantum (NISQ) era. Recently work has been done to simulate properties of the fermionic Z2 gauge field theory in (1+1)D and the pure gauge theory in (2+1)D. In this work, we investigate various options for simulating the fermionic Z2 gauge field theory in (2+1)D. To simulate the theory on a NISQ device it is vital to minimize both the number of qubits used and the circuit depth. In this work we propose ways to optimize both criteria for simulating time dynamics. In particular, we develop a new way to simulate this theory on a quantum computer, with minimal qubit requirements. We provide a quantum circuit for simulating a single first-order Trotter step that minimizes the number of 2-qubit gates needed and gives comparable results to methods requiring more qubits. Furthermore, we investigate variational Trotterization approaches that allow us to further decrease the circuit depth.
Lattice gauge theories in varying dimensions, lattice volumes, and truncations offer a rich family of targets for Hamiltonian simulation on quantum devices. In return, formulating quantum simulations can provide new ways of thinking about the quantum structure of gauge theories. In this work, we consider pure S U ( 3 ) gauge theory in two and three spatial dimensions in a streamlined version of the electric basis. We use a formulation of the theory that balances locality of the Hamiltonian and size of the gauge-invariant state space, and we classically pre-compute dictionaries of plaquette operator matrix elements for use in circuit construction. We build circuits for simulating time evolution on arbitrary lattice volumes, spanning circuits suitable for Noisy Intermediate-Scale Quantum era hardware to future fault-tolerant devices. Relative to spin models, time evolution in lattice gauge theories involves more complex local unitaries, and the Hilbert space of all quantum registers may have large unphysical subspaces. Based on these features, we develop general, volume-scalable tools for optimizing circuit depth, including pruning and fusion algorithms for collections of large multicontrolled unitaries. We describe scalings of quantum resources needed to simulate larger circuits and some directions for future algorithmic development.
A bstract Gauge theory is the framework of the Standard Model of particle physics and is also important in condensed matter physics. As its major non-perturbative approach, lattice gauge theory is traditionally implemented using Monte Carlo simulation, consequently it usually suffers such problems as the Fermion sign problem and the lack of real-time dynamics. Hopefully they can be avoided by using quantum simulation, which simulates quantum systems by using controllable true quantum processes. The field of quantum simulation is under rapid development. Here we present a circuit-based digital scheme of quantum simulation of quantum ℤ 2 lattice gauge theory in 2 + 1 and 3 + 1 dimensions, using quantum adiabatic algorithms implemented in terms of universal quantum gates. Our algorithm generalizes the Trotter and symmetric decompositions to the case that the Hamiltonian varies at each step in the decomposition. Furthermore, we carry through a complete demonstration of this scheme in classical GPU simulator, and obtain key features of quantum ℤ 2 lattice gauge theory, including quantum phase transitions, topological properties, gauge invariance and duality. Hereby dubbed pseudoquantum simulation, classical demonstration of quantum simulation in state-of-art fast computers not only facilitates the development of schemes and algorithms of real quantum simulation, but also represents a new approach of practical computation.