betaFeedback

WorksPhysics and Astronomy

General quantum algorithms for Hamiltonian simulation with applications to a non-Abelian lattice gauge theory

Abstract

With a focus on universal quantum computing for quantum simulation, and through the example of lattice gauge theories, we introduce rather general quantum algorithms that can efficiently simulate certain classes of interactions consisting of correlated changes in multiple (bosonic and fermionic) quantum numbers with non-trivial functional coefficients. In particular, we analyze diagonalization of Hamiltonian terms using a singular-value decomposition technique, and discuss how the achieved diagonal unitaries in the digitized time-evolution operator can be implemented. The lattice gauge theory studied is the SU(2) gauge theory in 1+1 dimensions coupled to one flavor of staggered fermions, for which a complete quantum-resource analysis within different computational models is presented. The algorithms are shown to be applicable to higher-dimensional theories as well as to other Abelian and non-Abelian gauge theories. The example chosen further demonstrates the importance of adopting efficient theoretical formulations: it is shown that an explicitly gauge-invariant formulation using loop, string, and hadron degrees of freedom simplifies the algorithms and lowers the cost compared with the standard formulations based on angular-momentum as well as the Schwinger-boson degrees of freedom. The loop-string-hadron formulation further retains the non-Abelian gauge symmetry despite the inexactness of the digitized simulation, without the need for costly controlled operations. Such theoretical and algorithmic considerations are likely to be essential in quantumly simulating other complex theories of relevance to nature.

Introduction

Motivation and brief overview of the work.—A strong case for the promised quantum advantage offered by quantum computing is the simulation of physical systems at an exponentially reduced cost [1, 2, 3, 4]. Possibilities are countless for advancing various disciplines of theoretical and applied sciences if robust large-scale fault-tolerant universal quantum hardware becomes a reality. Such possibilities in the area of quantum chemistry and material science have led to a vigorous program in quantum-algorithm design and implementation [5, 6, 7, 8, 9, 10, 11]. Furthermore, the promise of substantially speeding up computations with quantum-computing resources has been driving a plethora of quantum-based research and development in nuclear and high-energy physics in recent years [12, 13, 14, 15], from first-principles approaches rooted in quantum field theories of nature [13, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 82, 83, 84, 85, 86, 87, 88] to effective (field) theory descriptions of strongly interacting systems such as nuclei [36, 45, 89, 90, 91, 92, 93, 94, 95, 96, 97, 98, 99, 100].

Simulation algorithms on digital quantum computers, regardless of the theory under study, share a number of general features. Most importantly, these require a digitized approximation to the system’s evolution in real time. An immediate advantage of using quantum bits (qubits) is an exponentially more compact encoding of the degrees of freedom (DOFs) compared with classical encodings. Nonetheless, the efficiency of the simulation relies on how the number of costly operations varies as a function of error tolerance, the system’s size, and model’s parameters. While general statements can be made regarding the efficiency of algorithms for local or nearly local interactions [2, 17, 101], only an exact account of the type and the number of operations in connection to the accuracy goal of the computation can determine the viability of the algorithms. Such an analysis is particularly important in light of the limited capacity of the hardware and the imperfect fidelity of quantum operations (gates) in any practical implementation.

With the ultimate goal of quantifying quantum-resource requirements of complex theories of nature described by gauge field theories, in this paper we tackle the following questions: i) how to “best” digitize time evolution in theories with simultaneous changes in various types of quantum operators, ii) how to avoid quantumly evaluating certain operations to facilitate the simulation, and iii) how to take advantage of better formulations of the simulated theory to simplify operations and retain symmetries? The answers, as will be demonstrated, lie in a geometrical intuition, algebraic tricks, classical pre-processing, and rethinking a theory’s formulation of its DOFs and constraints.

Framework and concrete objectives.—Product formulas use the Trotter-Suzuki expansion to decompose the time-evolution operator e−iHte^{-iHt} (for a system with Hamiltonian HH and evolution time tt) into products of efficiently implementable exponentials in various ways [102, 103, 104]. For example, the (first-order) Lie-Trotter formula amounts to implementing e−iHte^{-iHt} with H=∑j=1nHjH=\sum_{j=1}^{n}H_j as

V1(t)≡[∏j=1ne−itHj/s]s,(1)V_1(t)\equiv\left[\prod_{j=1}^{n}e^{-itH_j/s}\right]^s, \tag*{(1)}

up to an error that scales as O(t2/s)O(t^2/s). Product formulas, given their simplicity, have been the primary digitization method in quantum simulation, and they require no extra qubits beyond what is needed to encode the physical DOFs. There exists a range of other quantum-simulation algorithms that take advantage of techniques such as Taylor series expansion and linear combinations of unitaries [105, 106], quantum signal processing [107], qubitization and block encodings [108, 109], singular-value transformation [110], off-diagonal Hamiltonian expansion [111], and hybrid algorithms [112]. Compared with product formulas, the gate complexities of these algorithms generally scale better with the error tolerance and the system’s size and parameters asymptotically, but they involve more complicated circuits and often have a non-negligible ancilla-qubit overhead. It is, in fact, known empirically that in certain problems, product formulas perform better than what theoretical bounds on them indicate [101, 113, 114], pointing to the fact that such bounds are generally not tight, or that they involve small pre-factors, which can impact concrete resource estimates. For concreteness, we focus on product formulas in analyzing the time-evolution operator in this work, but many of the ideas to be introduced are applicable to other quantum-simulation methods as well.

Now given the time-evolution algorithm, a first estimate of resource requirements is obtained by counting the number of costly operations needed to guarantee an error tolerance ϵ>0\epsilon> 0, defined as ∥V(t)−e−iHt∥≤ϵ\lVert V(t) - e^{-iHt} \rVert\le\epsilon, given the system’s size and parameters. Here, V(t)V(t) is the product-formula approximation to the exact time-evolution operator and ∥⋅∥\lVert\cdot\rVert denotes the spectral norm. This estimate is not complete as the cost of state preparation and observable measurement need to be included subsequently. However, as many preparation and observable-evaluation routines require implementing e−iHte^{-iHt} as an ingredient, the cost estimate of time evolution is a useful indicator of the gate complexity of the full simulation. Two computational models are often considered. In the near term, when fault tolerance is out of reach but noise-mitigation strategies may ameliorate the accuracy loss [3], the number of two-qubit entangling gates (e.g., CNOT gates) needs to be minimized as such gates exhibit lower fidelities. In the far-term, when the gate errors meet certain thresholds, it becomes possible to correct anticipated qubit errors [115]. However, T gates are known to require costly error-correction encodings and hence it is the T-gate count that needs to be minimized in the far term.

Diagonalization, shearing transformation, and singular-value decomposition.—The question of how to best decompose exponentiated operators representing steps of time evolution, namely the “propagators”, in theories with interactions involving numerous DOFs is, for example, of paramount importance in the context of (lattice) gauge theories. There, multiple types of fermionic and bosonic fields may interact, and further the interactions are locally constrained by Gauss’s laws. Consider the propagator e−iHjte^{-iH_jt} where HjH_j is a term or appropriate collection of terms in the Hamiltonian, chosen such that e−iHjte^{-iH_jt} can be decomposed exactly to a universal set of gates. If HjH_j is a diagonal operator when expressed in the computational basis of qubit registers (that represent the DOFs in the original theory), then single- and two-qubit Pauli-Z rotations provide a complete basis for implementing e−iHjte^{-iH_jt}, making its circuit synthesis rather straightforward. On the other hand, for non-diagonal HjH_j one needs to proceed with a simultaneous diagonalization in the basis states of all types of quantum registers involved in HjH_j, which is a non-trivial task in general, and may lead to approximations, hence a potential violation of original symmetries. An example of this is the implementation of the fermion-gauge-boson hopping propagator in the lattice Schwinger model, where the decomposition proposed in Ref. [54], while being efficient, introduces violations of Gauss’s law.

A subsequent work [116] guided by a geometrical interpretation of the transitions in the space of quantum numbers showed that a better diagonalization in the lattice Schwinger model is achievable via a “shearing” transformation, requiring negligible additional quantum resources over the earlier approach, but with the advantage of preserving the local constraints. In § 2, we introduce an algebraic procedure that is a generalization of the shearing transformation. The approach reduces the diagonalizing of HjH_j and subsequently e−iHjte^{-iH_jt} to a modest distortion of the exact propagator (if any) through the use of singular-value decompositions (SVDs) of relevant matrices in the space of quantum numbers. While in the example of the Schwinger model, a fully gauge-invariant implementation of the local hopping propagator is achievable, in the example of the non-Abelian SU(2) lattice gauge theory (LGT) coupled to fermions that is studied in this work, the hopping propagator can be efficiently circuitized while maintaining some but not necessarily all of the local constraints, which is still an improvement over existing algorithms [69]. This diagonalization methodology, as will be shown, is applicable to more complex propagators such as those corresponding to magnetic interactions in gauge theories.1 Furthermore, the procedure is relevant beyond implementing the time-evolution operator. For example, to measure a Hamiltonian’s expectation value, one may diagonalize its summands and estimate the expectation value of each summand individually, then add the results. Minimizing the length of this sum reduces the number of measurements required.

Phase evaluation and classical pre-processing.—After transforming the propagators to a computational basis, the remaining diagonal operations involve, at their core, a set of ZZ-rotations. In scenarios where the rotation angle (phase) is a constant, implementation amounts to a circuit synthesis with known counts of ancillary qubits and CNOT gates or T gates, given the algorithm used and the synthesis accuracy aimed. On the other hand, in many instances, the phases are non-trivial functions of dynamical quantum numbers, which despite being diagonal in the computational basis of their respective registers, need to be evaluated at each step of the evolution. As is known, while such function evaluations can proceed via a “phase-kickback” algorithm [117] and embedded quantum arithmetic routines [118, 119], they are prohibitively costly in the near term, requiring abundant ancillary registers and controlled operations to evaluate, store, and reprocess function values. This will likely be the biggest bottleneck to quantum simulations of non-Abelian gauge theories, as the non-Abelian algebra (in the irrep basis) involves Clebsch-Gordan coefficients (and generalizations of), which find their way to the exponent of diagonal propagators for both fermion-gauge hopping and the magnetic interactions.

Instead of quantumly evaluating these functions on the go, as a near-term strategy to be described in this work, one can locally decompose them to strings of Pauli-ZZ operations with now fixed coefficients, and within a fixed tolerance, systematically neglect rotations with small angles. The classical pre-processing involved in obtaining the Pauli decomposition of diagonal functions scales exponentially with the number of qubits per lattice site. It is, therefore, only a function of the cutoff on the gauge-field quantum numbers in the LGT example studied, but is independent of system’s size. Our strategy is similar in spirit to that proposed in Ref. [68] which uses the pre-processed local operations in simulating propagators in a pure SU(3) LGT. Nonetheless, despite the strategy in Ref. [68], our method does not require a hard encoding of the Clebsch-Gordan coefficients in the circuit a priori using controlled rotations with pre-set angles, but rather pre-evaluates the functional form for any input, as will be discussed in § 2.2.1.

Basis/formulation considerations and symmetry imposition.—It is known that equivalent expressions of the Hilbert space may lead to different algorithmic complexity in quantum simulation. A known example is the use of position-space versus momentum-space wave functions (see. e.g., Ref. [113]), and the first- or second-quantized formulations (see e.g., Refs. [120, 121, 122, 123, 124, 125]) in simulating electronic systems and quantum chemistry. In the context of this work, the question of what is the best basis to represent the DOFs not only concerns the potential reduction of the qubit cost of encoding, but also the simplicity of interactions (e.g., the type and the number of quantum registers to be operated on simultaneously), of phase-function evaluations, and of the expression of symmetries and constraints.

We make the need for wiser choices of basis evident through the SU(2) LGT example considered. In the irrep basis, where the electric Hamiltonian is diagonal at the cost of off-diagonal hopping and magnetic Hamiltonians, the states are characterized by their fermionic and gauge-flux content. The electric-field hence gauge-link DOFs can be represented, for example, in the standard angular-momentum formulation [126], the Schwinger-boson (prepotential) formulation [127, 128, 129, 130], or the recently-developed loop-string-hadron (LSH) formulation [131]. As will be demonstrated, while the qubit count and the gate complexity of the diagonalization routine for the various formulations are found to be comparable, the absolute cost of performing diagonal functions is reduced substantially in the LSH formulation.

Furthermore, as already discussed, decomposing the various propagators to a set of gates in product formulas amounts to breaking up a collection of terms in the Hamiltonian that are only gauge invariant together, and this can potentially break the Gauss’s laws throughout the evolution. In the case of the SU(2) theory, this problem is circumvented all together in the LSH formulation that builds the physical Hilbert space a priori using a complete set of gauge-invariant local operators [131], eliminating the need for encoding a large unphysical Hilbert space [132]. A remaining link-local Abelian constraint can be easily retained by our diagonalization algorithm, making it possible to achieve an evolution that satisfies both non-Abelian and Abelian Gauss’s law constraints, improving upon quantum algorithms of Ref. [69]. Such a reformulation of the theory also eliminates the need for various symmetry-protection protocols [133, 134, 135, 136, 137], Gauss’s law verification circuits [38, 39], or expensive controlled operations [68] to enforce the gauge symmetries. For example, while Ref. [68] introduces a valuable strategy in simulating an SU(3) LGT by constraining local transitions to those satisfying the Gauss’s law using controlled operations, it is conceivable that generalizations of the LSH formulation to the case of SU(3) [138] will simplify the evolution there as well.

Generalizations and future applications.—Finally, in light of lessons learned from the investigation of this work for a non-Abelian LGT in 1+1 dimensions (D), and given the rather general algorithms and strategies proposed, one can explore future directions, with an eye on generalization to theories in 3+1 D, and other gauge groups such as quantum chromodynamics (QCD). Such discussions will follow in § 4, including remarks on the applicability of our approach to other quantum-simulation algorithms, and ideas for improving upon the algorithmic error bounds obtained in this work.

Methods: Strategies for simulating product formulas

The goal of this section is to introduce generic methods to derive quantum circuits that approximate the unitary e−itHe^{-itH}, where HH is a Hermitian operator acting simultaneously on multiple qubit registers and t>0t>0 is a real parameter. HH could represent the full Hamiltonian of a physical system or a term (or collection of terms) that is exponentiated separately in a product-formula approximation to the evolution operator. Given a product formula, the quantum circuit that implements it can be derived using the identity

e−itH=U†e−itDU,(2)e^{-itH}=\mathcal{U}^{\dagger}e^{-itD}\mathcal{U}, \tag*{(2)}

where U\mathcal{U} is a unitary that diagonalizes HH and DD is the diagonalized form of HH in the computational basis of the qubit registers. This reduces the task of simulating HH to the task of providing quantum circuits for U\mathcal{U} and e−itDe^{-itD}, which turned out to be more tractable. An overarching task of quantum simulation is to implement Eq. (2) to within some fixed accuracy ϵ\epsilon. The error can be considered as the spectral norm of the difference between the approximate and ideal unitaries, which is a useful quantity to bound the error in observables given an arbitrary initial state [54]. The error bound can be improved by assuming a specific input state or an input-state distribution [139, 140, 141] but such improvements will not be considered here.

When deriving quantum circuits for e−itHe^{-itH} via Eq. (2) for a Hamiltonian H=∑jHj=∑jUj†DjUjH=\sum_j H_j=\sum_j\mathcal{U}_j^\dagger D_j\mathcal{U}_j, a balance must be found in minimizing i) the cost of implementing exponential of each summand HjH_j, ii) the number of costly summand exponentials, and iii) the Trotter error. This is because some Uj\mathcal{U}_j and e−itDje^{-itD_j} could dominate the quantum-computational cost of the simulation, so it is important to split the Hamiltonian to the summands HjH_j properly. This split, on the other hand, should be informed by Trotter-error considerations since this error depends on the commutators among the summands. For example, consider Hj=Hj(1)+Hj(2)H_j=H_j^{(1)}+H_j^{(2)}. It may be that the sum cost of implementing Uj(1)\mathcal{U}_j^{(1)}, e−itDj(1)e^{-itD_j^{(1)}}, Uj(2)\mathcal{U}_j^{(2)}, and e−itDj(2)e^{-itD_j^{(2)}} is higher than that of Uj\mathcal{U}_j and e−itDje^{-itD_j}, in which case, it is beneficial to not split HjH_j, as long as diagonalization of HjH_j and an inexpensive implementation of Uj\mathcal{U}_j and e−itDje^{-itD_j} can be found. If instead, Uj(1)\mathcal{U}_j^{(1)}, e−itDj(1)e^{-itD_j^{(1)}}, Uj(2)\mathcal{U}_j^{(2)}, and e−itDj(2)e^{-itD_j^{(2)}} can be implemented more economically, it may make sense to consider the split to Hj(1)H_j^{(1)} and Hj(2)H_j^{(2)}, notwithstanding this will increase the Trotter error if [Hj(1),Hj(2)]≠0[H_j^{(1)},H_j^{(2)}]\ne0. Another consideration in choosing the summands is minimizing the symmetry violation in Trotter evolution, which may offer some benefits. For example, the more symmetries kept throughout the evolution, the more error diagnostics and noise-mitigation tools at one’s disposal to (partially) verify and/or correct noisy intermediate-scale quantum simulations.

Analytically optimizing this problem in search for the best choice of summands is not trivial in general, nor is numerically finding the optimized choice given the sheer dimensionality of the operators. While systematic strategies such as efficient numerical approaches for navigating this complex optimization problem are desired, finding the balance among the goals mentioned here may be possible on a case-by-case basis. As will be discussed in the example of the non-Abelian LGT studied in § 3, the knowledge of the Hamiltonian structure and symmetries, and the commutator algebra involved, allow for decomposition choices that are more optimal than the others.

Given the summand HjH_j, one may wonder if classical-computing methods can be used to circuitize either e−itHje^{-itH_j} directly or Uj\mathcal{U}_j and e−itDje^{-itD_j}. Circuitizing e−itHje^{-itH_j} directly generally amounts to finding the Pauli decomposition of HjH_j. Since, in general, HjH_j is not diagonal in the computational basis of the qubits, one would need to determine 4⌈log⁡2(d)⌉4^{\lceil\log_2(d)\rceil} coefficients, with dd being the dimensionality of the relevant Hilbert space. Thus, this method is costly for large Hilbert-space sizes, and is not scalable. Furthermore, simulating e−itHje^{-itH_j} by Pauli decomposition introduces significant Trotter error, as e−itHje^{-itH_j} must be simulated through applications of a product formula, and Pauli strings do not necessarily commute. As a result, the Pauli-decomposition method should not be considered as the method of choice whenever alternative methods can be found that are exact and use circuits of comparable or lower cost.

References

  1. [1]Richard P. Feynman. “Simulating physics with computers”. Int. J. Theor. Phys. 21, 467–488 (1982). 1
  2. [2]Seth Lloyd. “Universal quantum simulators”. Science 273, 1073–1078 (1996). 1
  3. [3]John Preskill. “Quantum computing in the NISQ era and beyond”. Quantum 2, 79 (2018). arXiv:1801.00862. 1DOI
  4. [4]Iulia M Georgescu, Sahel Ashhab, and Franco Nori. “Quantum simulation”. Reviews of Modern Physics 86, 153 (2014). arXiv:1308.6253. 1DOI
  5. [5]Dave Wecker, Matthew B Hastings, Nathan Wiebe, Bryan K Clark, Chetan Nayak, and Matthias Troyer. “Solving strongly correlated electron models on a quantum computer”. Physical Review A 92, 062318 (2015). arXiv:1506.05135. 1DOI
  6. [6]Sam McArdle, Suguru Endo, Alán Aspuru-Guzik, Simon C Benjamin, and Xiao Yuan. “Quantum computational chemistry”. Reviews of Modern Physics 92, 015003 (2020). arXiv:1808.10402.DOI
  7. [7]Yudong Cao, Jonathan Romero, Jonathan P Olson, Matthias Degroote, Peter D Johnson, Mária Kieferová, Ian D Kivlichan, Tim Menke, Borja Peropadre, Nicolas PD Sawaya, et al. “Quantum chemistry in the age of quantum computing”. Chemical Reviews 119, 10856–10915 (2019). arXiv:1812.09976.DOI
  8. [8]Ryan Babbush, Nathan Wiebe, Jarrod McClean, James McClain, Hartmut Neven, and Garnet Kin-Lic Chan. “Low-depth quantum simulation of materials”. Physical Review X 8, 011044 (2018). arXiv:1706.00023.DOI
  9. [9]Bela Bauer, Sergey Bravyi, Mario Motta, and Garnet Kin-Lic Chan. “Quantum algorithms for quantum chemistry and quantum materials science”. Chemical Reviews 120, 12685–12717 (2020). arXiv:2001.03685.
  10. [10]Vera von Burg, Guang Hao Low, Thomas Häner, Damian S Steiger, Markus Reiher, Martin Roetteler, and Matthias Troyer. “Quantum computing enhanced computational catalysis”. Physical Review Research 3, 033055 (2021). arXiv:2007.14460.DOI
  11. [11]He Ma, Marco Govoni, and Giulia Galli. “Quantum simulations of materials on near-term quantum computers”. npj Computat. Mater. 6, 85 (2020). 1
  12. [12]Matthew Dietrich, David Hertzog, Martin J. Savage, et al. “Nuclear Physics and Quantum Information Science: Report by the NSAC QIS Subcommittee”. Technical Report NSAC-QIS-2019. NSF & DOE Office of Science (2019). url: https://science.osti.gov/-/media/np/pdf/Reports/NSAC-QIS_Report.pdf. 1
  13. [13]Christian W. Bauer et al. “Quantum Simulation for High-Energy Physics”. PRX Quantum 4, 027001 (2023). arXiv:2204.03381. 1DOI
  14. [14]Simon Catterall et al. “Report of the snowmass 2021 theory frontier topical group on quantum information science”. In Snowmass 2021. (2022). arXiv:2209.14839.arxiv.org/abs/2209.14839
  15. [15]Travis S. Humble, Gabriel N. Perdue, and Martin J. Savage. “Snowmass computational frontier: Topical group report on quantum computing” (2022). arXiv:2209.06786. 1arxiv.org/abs/2209.06786
  16. [16]Tim Byrnes and Yoshihisa Yamamoto. “Simulating lattice gauge theories on a quantum computer”. Phys. Rev. A 73, 022328 (2006). arXiv:quant-ph/0510027. 1DOI
  17. [17]Stephen P. Jordan, Keith S.M. Lee, and John Preskill. “Quantum Algorithms for Quantum Field Theories”. Science 336, 1130–1133 (2012). arXiv:1111.3633. 1DOI
  18. [18]Stephen P. Jordan, Keith S. M. Lee, and John Preskill. “Quantum Computation of Scattering in Scalar Quantum Field Theories”. Quant. Inf. Comput. 14, 1014–1080 (2014). arXiv:1112.4833.arxiv.org/abs/1112.4833
  19. [19]Erez Zohar and Benni Reznik. “Confinement and lattice QED electric flux-tubes simulated with ultracold atoms”. Phys. Rev. Lett. 107, 275301 (2011). arXiv:1108.1562.DOI
  20. [20]L. Tagliacozzo, A. Celi, A. Zamora, and M. Lewenstein. “Optical Abelian Lattice Gauge Theories”. Annals Phys. 330, 160–191 (2013). arXiv:1205.0496.DOI
  21. [21]D. Banerjee, M. Dalmonte, M. Muller, E. Rico, P. Stebler, U.-J. Wiese, and P. Zoller. “Atomic Quantum Simulation of Dynamical Gauge Fields coupled to Fermionic Matter: From String Breaking to Evolution after a Quench”. Phys. Rev. Lett. 109, 175302 (2012). arXiv:1205.6366.DOI
  22. [22]Erez Zohar, J.Ignacio Cirac, and Benni Reznik. “Cold-Atom Quantum Simulator for SU(2) Yang-Mills Lattice Gauge Theory”. Phys. Rev. Lett. 110, 125304 (2013). arXiv:1211.2241.DOI
  23. [23]Erez Zohar, J. Ignacio Cirac, and Benni Reznik. “Quantum simulations of gauge theories with ultracold atoms: local gauge invariance from angular momentum conservation”. Phys. Rev. A 88, 023617 (2013). arXiv:1303.5040.DOI
  24. [24]Stephen P. Jordan, Keith S. M. Lee, and John Preskill. “Quantum Algorithms for Fermionic Quantum Field Theories” (2014). arXiv:1404.7115.arxiv.org/abs/1404.7115
  25. [25]Erez Zohar and Michele Burrello. “Formulation of lattice gauge theories for quantum simulations”. Phys. Rev. D 91, 054506 (2015). arXiv:1409.3085. 3.1DOI
  26. [26]Kevin Marshall, Raphael Pooser, George Siopsis, and Christian Weedbrook. “Quantum simulation of quantum field theory using continuous variables”. Phys. Rev. A 92, 063825 (2015). arXiv:1503.08121.DOI
  27. [27]A. Mezzacapo, E. Rico, C. Sabín, I.L. Egusquiza, L. Lamata, and E. Solano. “Non-Abelian SU(2) Lattice Gauge Theories in Superconducting Circuits”. Phys. Rev. Lett. 115, 240502 (2015). arXiv:1505.04720.DOI
  28. [28]E.A. Martinez et al. “Real-time dynamics of lattice gauge theories with a few-qubit quantum computer”. Nature 534, 516–519 (2016). arXiv:1605.04570.DOI
  29. [29]Erez Zohar, Alessandro Farace, Benni Reznik, and J. Ignacio Cirac. “Digital quantum simulation of Z₂ lattice gauge theories with dynamical fermionic matter”. Phys. Rev. Lett. 118, 070501 (2017). arXiv:1607.03656.DOI
  30. [30]Erez Zohar, Alessandro Farace, Benni Reznik, and J. Ignacio Cirac. “Digital lattice gauge theories”. Phys. Rev. A 95, 023604 (2017). arXiv:1607.08121.DOI
  31. [31]Ali Hamed Moosavian and Stephen Jordan. “Faster Quantum Algorithm to Simulate Fermionic Quantum Field Theory”. Phys. Rev. A 98, 012332 (2018). arXiv:1711.04006.DOI
  32. [32]T.V. Zache, F. Hebenstreit, F. Jendrzejewski, M.K. Oberthaler, J. Berges, and P. Hauke. “Quantum simulation of lattice gauge theories using Wilson fermions”. Sci. Technol. 3, 034010 (2018). arXiv:1802.06704.DOI
  33. [33]Frederik Görg, Kilian Sandholzer, Joaquín Minguzzi, Rémi Desbuquois, Michael Messer, and Tilman Esslinger. “Realization of density-dependent Peierls phases to engineer quantized gauge fields coupled to ultracold matter”. Nature Phys. 15, 1161–1167 (2019). arXiv:1812.05895.DOI
  34. [34]Christian Schweizer, Fabian Grusdt, Moritz Berngruber, Luca Barbiero, Eugene Demler, Nathan Goldman, Immanuel Bloch, and Monika Aidelsburger. “Floquet approach to Z2 lattice gauge theories with ultracold atoms in optical lattices”. Nature Physics 15, 1168–1173 (2019). arXiv:1901.07103.DOI
  35. [35]N. Klco, E.F. Dumitrescu, A.J. McCaskey, T.D. Morris, R.C. Pooser, M. Sanz, E. Solano, P. Lougovski, and M.J. Savage. “Quantum-classical computation of Schwinger model dynamics using quantum computers”. Phys. Rev. A 98, 032331 (2018). arXiv:1803.03326.
  36. [36]Hsuan-Hao Lu et al. “Simulations of Subatomic Many-Body Physics on a Quantum Frequency Processor”. Phys. Rev. A 100, 012320 (2019). arXiv:1810.03959. 1DOI
  37. [37]Arpan Bhattacharyya, Arvind Shekar, and Arindam Sinha. “Circuit complexity in interacting QFTs and RG flows”. JHEP 10, 140 (2018). arXiv:1808.03105.DOI
  38. [38]Jesse R. Stryker. “Oracles for Gauss’s law on digital quantum computers”. Phys. Rev. A 99, 042301 (2019). arXiv:1812.01617. 1, 3.1DOI
  39. [39]Indrakshi Raychowdhury and Jesse R. Stryker. “Solving Gauss’s Law on Digital Quantum Computers with Loop-String-Hadron Digitization”. Phys. Rev. Res. 2, 033039 (2020). arXiv:2012.07554. 1
  40. [40]Di Luo, Jiayu Shen, Michael Highman, Bryan K. Clark, Brian DeMarco, Aida Z. El-Khadra, and Bryce Gadway. “Framework for simulating gauge theories with dipolar spin systems”. Phys. Rev. A 102, 032617 (2020). arXiv:1912.11488.DOI
  41. [41]Federica M. Surace, Paolo P. Mazza, Giuliano Giudici, Alessio Lerose, Andrea Gambassi, and Marcello Dalmonte. “Lattice gauge theories and string dynamics in Rydberg atom quantum simulators”. Phys. Rev. X 10, 021041 (2020). arXiv:1902.09551.DOI
  42. [42]Alexander Mil, Torsten V. Zache, Apoorva Hegde, Andy Xia, Rohit P. Bhatt, Markus K. Oberthaler, Philipp Hauke, Jürgen Berges, and Fred Jendrzejewski. “A scalable realization of local U(1) gauge invariance in cold atomic mixtures”. Science 367, 1128–1130 (2020). arXiv:1909.07641.
  43. [43]Natalie Klco, Jesse R. Stryker, and Martin J. Savage. “SU(2) non-Abelian gauge field theory in one dimension on digital quantum computers”. Phys. Rev. D 101, 074512 (2020). arXiv:1908.06935.DOI
  44. [44]Natalie Klco and Martin J. Savage. “Digitization of scalar fields for quantum computing”. Phys. Rev. A 99, 052335 (2019). arXiv:1808.10378.DOI
  45. [45]Christian W. Bauer, Wibe A. de Jong, Benjamin Nachman, and Davide Provasoli. “Quantum Algorithm for High Energy Physics Simulations”. Phys. Rev. Lett. 126, 062001 (2021). arXiv:1904.03196.DOI
  46. [46]Zohreh Davoudi, Mohammad Hafezi, Christopher Monroe, Guido Pagano, Alireza Seif, and Andrew Shaw. “Towards analog quantum simulations of lattice gauge theories with trapped ions”. Phys. Rev. Res. 2, 023015 (2020). arXiv:1908.03210.DOI
  47. [47]Natalie Klco and Martin J. Savage. “Systematically Localizable Operators for Quantum Simulations of Quantum Field Theories”. Phys. Rev. A 102, 012619 (2020). arXiv:1912.03577.DOI
  48. [48]Henry Lamm, Scott Lawrence, and Yukari Yamauchi. “Parton physics on a quantum computer”. Phys. Rev. Res. 2, 013272 (2020). arXiv:1908.10439.DOI
  49. [49]Niklas Mueller, Andrey Tarasov, and Raju Venugopalan. “Deeply inelastic scattering structure functions on a hybrid quantum computer”. Phys. Rev. D 102, 016007 (2020). arXiv:1908.07051.DOI
  50. [50]Henry Lamm, Scott Lawrence, and Yukari Yamauchi. “General Methods for Digital Quantum Simulation of Gauge Theories”. Phys. Rev. D 100, 034518 (2019). arXiv:1903.08807.DOI
  51. [51]Andrei Alexandru, Paulo F. Bedaque, Siddhartha Harmalkar, Henry Lamm, Scott Lawrence, and Neill C. Warrington. “Gluon Field Digitization for Quantum Computers”. Phys. Rev. D 100, 114501 (2019). arXiv:1906.11213.DOI
  52. [52]Natalie Klco and Martin J. Savage. “Fixed-point quantum circuits for quantum field theories”. Phys. Rev. A 102, 052422 (2020). arXiv:2002.02018.DOI
  53. [53]Bing Yang, Hui Sun, Robert Ott, Han-Yi Wang, Torsten V. Zache, Jad C. Halimeh, Zhen-Sheng Yuan, Philipp Hauke, and Jian-Wei Pan. “Observation of gauge invariance in a 71-site Bose-Hubbard quantum simulator”. Nature 587, 392–396 (2020). arXiv:2003.08945.DOI
  54. [54]Alexander F. Shaw, Pavel Lougovski, Jesse R. Stryker, and Nathan Wiebe. “Quantum Algorithms for Simulating the Lattice Schwinger Model”. Quantum 4, 306 (2020). arXiv:2002.11146.DOI
  55. [55]Bipasha Chakraborty, Masazumi Honda, Taku Izubuchi, Yuta Kikuchi, and Akio Tomiya. “Classically emulated digital quantum simulation of the Schwinger model with a topological term via adiabatic state preparation”. Phys. Rev. D 105, 094503 (2022). arXiv:2201.00485.
  56. [56]Junyu Liu and Yuan Xin. “Quantum simulation of quantum field theories as quantum chemistry”. JHEP 12, 011 (2020). arXiv:2004.13234.DOI
  57. [57]Michael Kreshchuk, William M. Kirby, Gary Goldstein, Hugo Beauchemin, and Peter J. Love. “Quantum simulation of quantum field theory in the light-front formulation”. Phys. Rev. A 105, 032418 (2022). arXiv:2002.04016.DOI
  58. [58]Jan F. Haase, Luca Dellantonio, Alessio Celi, Danny Paulson, Angus Kan, Karl Jansen, and Christine A. Muschik. “A resource efficient approach for quantum and classical simulations of gauge theories in particle physics”. Quantum 5, 393 (2021). arXiv:2006.14160.DOI
  59. [59]Danny Paulson et al. “Towards simulating 2D effects in lattice gauge theories on a quantum computer”. PRX Quantum 2, 020334 (2021). arXiv:2008.09252.DOI
  60. [60]Raka Dasgupta and Indrakshi Raychowdhury. “Cold-atom quantum simulator for string and hadron dynamics in non-Abelian lattice gauge theory”. Phys. Rev. A 105, 023322 (2022). arXiv:2009.13969.arxiv.org/abs/2009.13969
  61. [61]Simon V. Mathis, Guglielmo Mazzola, and Ivano Tavernelli. “Toward scalable simulations of lattice gauge theories on quantum computers”. Phys. Rev. D 102, 094501 (2020). arXiv:2005.10271.DOI
  62. [62]Yasar Y. Atas, Jinglei Zhang, Randy Lewis, Amin Jahnapour, Jan F. Haase, and Christine A. Muschik. “SU(2) hadrons on a quantum computer via a variational approach”. Nature Commun. 12, 6499 (2021). arXiv:2102.08920.DOI
  63. [63]Sarmed A Rahman, Randy Lewis, Emanuele Mendicelli, and Sarah Powell. “SU(2) lattice gauge theory on a quantum annealer”. Phys. Rev. D 104, 034501 (2021). arXiv:2103.08661.DOI
  64. [64]Zohreh Davoudi, Norbert M. Linke, and Guido Pagano. “Toward simulating quantum field theories with controlled phonon-ion dynamics: A hybrid analog-digital approach”. Phys. Rev. Res. 3, 043072 (2021). arXiv:2104.09346.DOI
  65. [65]João Barata, Niklas Mueller, Andrey Tarasov, and Raju Venugopalan. “Single-particle digitization strategy for quantum computation of a φ⁴ scalar field theory”. Phys. Rev. A 103, 042410 (2021). arXiv:2012.00020.DOI
  66. [66]Wibe A. de Jong, Kyle Lee, James Mulligan, Mateusz Płoskoń, Felix Ringer, and Xiaojun Yao. “Quantum simulation of nonequilibrium dynamics and thermalization in the Schwinger model”. Phys. Rev. D 106, 054508 (2022). arXiv:2106.08394.DOI
  67. [67]Anthony N. Ciavarella and Ivan A. Chernyshev. “Preparation of the SU(3) lattice Yang-Mills vacuum with variational quantum methods”. Phys. Rev. D 105, 074504 (2022). arXiv:2112.09083.DOI
  68. [68]Anthony Ciavarella, Natalie Klco, and Martin J. Savage. “Trailhead for quantum simulation of SU(3) Yang-Mills lattice gauge theory in the local multiplet basis”. Phys. Rev. D 103, 094501 (2021). arXiv:2101.10227. 1, 3.1, 4DOI
  69. [69]Angus Kan and Yunseong Nam. “Lattice Quantum Chromodynamics and Electrodynamics on a Universal Quantum Computer” (2021). arXiv:2107.12769. 1, 2.1, 3, 3.2, 15, 4arxiv.org/abs/2107.12769
  70. [70]Thomas D. Cohen, Henry Lamm, Scott Lawrence, and Yukari Yamauchi. “Quantum algorithms for transport coefficients in gauge theories”. Phys. Rev. D 104, 094514 (2021). arXiv:2104.02024.DOI
  71. [71]Bárbara Andrade, Zohreh Davoudi, Tobias Graß, Mohammad Hafezi, Guido Pagano, and Alireza Seif. “Engineering an effective three-spin Hamiltonian in trapped-ion systems for applications in quantum simulation”. Quantum Sci. Technol. 7, 034001 (2022). arXiv:2108.01022.DOI
  72. [72]M. Sohaib Alam, Stuart Hadfield, Henry Lamm, and Andy C. Y. Li. “Primitive quantum gates for dihedral gauge theories”. Phys. Rev. D 105, 114501 (2022). arXiv:2108.13305.DOI
  73. [73]Nhung H. Nguyen, Minh C. Tran, Yingyue Zhu, Alina M. Green, C. Huerta Alderete, Zohreh Davoudi, and Norbert M. Linke. “Digital Quantum Simulation of the Schwinger Model and Symmetry Protection with Trapped Ions”. PRX Quantum 3, 020324 (2022). arXiv:2112.14262.DOI
  74. [74]Jinglei Zhang, Ryan Ferguson, Stefan Kühn, Jan F. Haase, C. M. Wilson, Karl Jansen, and Christine A. Muschik. “Simulating gauge theories with variational quantum eigensolvers in superconducting microwave cavities”. Quantum 7, 1148 (2023). arXiv:2108.08248.DOI
  75. [75]Masazumi Honda, Etsuko Itou, Yuta Kikuchi, Lento Nagano, and Takuya Okuda. “Classically emulated digital quantum simulation for screening and confinement in the Schwinger model with a topological term”. Phys. Rev. D 105, 014504 (2022). arXiv:2105.03276.DOI
  76. [76]Zhao-Yu Zhou, Guo-Xian Su, Jad C. Halimeh, Robert Ott, Hui Sun, Philipp Hauke, Bing Yang, Zhen-Sheng Yuan, Jürgen Berges, and Jian-Wei Pan. “Thermalization dynamics of a gauge theory on a quantum simulator”. Science 377, 311–314 (2022). arXiv:2107.13563.DOI
  77. [77]Daniel González-Cuadra, Torsten V. Zache, Jose Carrasco, Barbara Kraus, and Peter Zoller. “Hardware Efficient Quantum Simulation of Non-Abelian Gauge Theories with Qudits on Rydberg Platforms”. Phys. Rev. Lett. 129, 160501 (2022). arXiv:2203.15541.
  78. [78]Jesse Osborne, Ian P. McCulloch, Bing Yang, Philipp Hauke, and Jad C. Halimeh. “Large-Scale 2+1D U(1) Gauge Theory with Dynamical Matter in a Cold-Atom Quantum Simulator” (2022). arXiv:2211.01380.DOI
  79. [79]Zohreh Davoudi, Niklas Mueller, and Connor Powers. “Towards Quantum Computing Phase Diagrams of Gauge Theories with Thermal Pure Quantum States”. Phys. Rev. Lett. 131, 081901 (2023). arXiv:2208.13112.DOI
  80. [80]Niklas Mueller, Joseph A. Carolan, Andrew Connelly, Zohreh Davoudi, Eugene F. Dumitrescu, and Kübra Yeter-Aydeniz. “Quantum Computation of Dynamical Quantum Phase Transitions and Entanglement Tomography in a Lattice Gauge Theory”. PRX Quantum 4, 030323 (2023). arXiv:2210.03089.arxiv.org/abs/2210.03089
  81. [81]Edison M. Murairi, Michael J. Cervia, Hersh Kumar, Paulo F. Bedaque, and Andrei Alexandru. “How many quantum gates do gauge theories require?”. Phys. Rev. D 106, 094504 (2022). arXiv:2208.11789.DOI
  82. [82]Roland C. Farrell, Ivan A. Chernyshev, Sarah J. M. Powell, Nikita A. Zemlevskiy, Marc Illa, and Martin J. Savage. “Preparations for quantum simulations of quantum chromodynamics in 1+1 dimensions. I. Axial gauge”. Phys. Rev. D 107, 054512 (2023). arXiv:2207.01731.DOI
  83. [83]Roland C. Farrell, Ivan A. Chernyshev, Sarah J. M. Powell, Nikita A. Zemlevskiy, Marc Illa, and Martin J. Savage. “Preparations for quantum simulations of quantum chromodynamics in 1+1 dimensions. II. Single-baryon β-decay in real time”. Phys. Rev. D 107, 054513 (2023). arXiv:2209.10781.DOI
  84. [84]Giuseppe Clemente, Arianna Crippa, and Karl Jansen. “Strategies for the determination of the running coupling of (2+1)-dimensional QED with quantum computing”. Phys. Rev. D 106, 114511 (2022). arXiv:2206.12454.DOI
  85. [85]Guy Pardo, Tomer Greenberg, Aryeh Fortinsky, Nadav Katz, and Erez Zohar. “Resource-efficient quantum simulation of lattice gauge theories in arbitrary dimensions: Solving for Gauss’s law and fermion elimination”. Phys. Rev. Res. 5, 023077 (2023). arXiv:2206.00685.DOI
  86. [86]M.C. Banuls et al. “Simulating Lattice Gauge Theories within Quantum Technologies”. Eur. Phys. J. D 74, 165 (2020). arXiv:1911.00003.DOI
  87. [87]Natalie Klco, Alessandro Roggero, and Martin J. Savage. “Standard model physics and the digital quantum revolution: thoughts about the interface”. Rept. Prog. Phys. 85, 064301 (2022). arXiv:2107.04769.DOI
  88. [88]Erez Zohar. “Quantum simulation of lattice gauge theories in more than one space dimension—requirements, challenges and methods”. Phil. Trans. A. Math. Phys. Eng. Sci. 380, 20210069 (2021). arXiv:2106.04609. 1DOI
  89. [89]E. F. Dumitrescu, A. J. McCaskey, G. Hagen, G. R. Jansen, T. D. Morris, T. Papenbrock, R. C. Pooser, D. J. Dean, and P. Lougovski. “Cloud Quantum Computing of an Atomic Nucleus”. Phys. Rev. Lett. 120, 210501 (2018). arXiv:1801.03897. 1DOI
  90. [90]Omar Shehab, Kevin A. Landsman, Yunseong Nam, Daiwei Zhu, Norbert M. Linke, Matthew J. Keesan, Raphael C. Pooser, and Christopher R. Monroe. “Toward convergence of effective field theory simulations on digital quantum computers”. Phys. Rev. A 100, 062319 (2019). arXiv:1904.04338.DOI
  91. [91]Alessandro Roggero and Joseph Carlson. “Dynamic linear response quantum algorithm”. Phys. Rev. C 100, 034610 (2019). arXiv:1804.01505.
  92. [92]Alessandro Roggero, Andy C. Y. Li, Joseph Carlson, Rajan Gupta, and Gabriel N. Perdue. “Quantum Computing for Neutrino-Nucleus Scattering”. Phys. Rev. D 101, 074038 (2020). arXiv:1911.06368.DOI
  93. [93]Weijie Du, James P. Vary, Xingbo Zhao, and Wei Zuo. “Quantum simulation of nuclear inelastic scattering”. Phys. Rev. A 104, 012611 (2021). arXiv:2006.01369.DOI
  94. [94]Weijie Du, James P. Vary, Xingbo Zhao, and Wei Zuo. “Ab initio nuclear structure via quantum adiabatic algorithm” (2021). arXiv:2105.08910.arxiv.org/abs/2105.08910
  95. [95]Alessandro Roggero, Chenyi Gu, Alessandro Baroni, and Thomas Papenbrock. “Preparation of excited states for nuclear dynamics on a quantum computer”. Phys. Rev. C 102, 064624 (2020). arXiv:2009.13485.DOI
  96. [96]Eric T. Holland, Kyle A. Wendt, Konstantinos Kravvaris, Xian Wu, W. Erich Ormand, Jonathan L DuBois, Sofia Quaglioni, and Francesco Pederiva. “Optimal Control for the Quantum Simulation of Nuclear Dynamics”. Phys. Rev. A 101, 062307 (2020). arXiv:1908.08222.DOI
  97. [97]Dmitri E. Kharzeev and Yuta Kikuchi. “Real-time chiral dynamics from a digital quantum simulation”. Phys. Rev. Res. 2, 023342 (2020). arXiv:2001.00698.DOI
  98. [98]Michael Kreshchuk, Shaoyang Jia, William M. Kirby, Gary Goldstein, James P. Vary, and Peter J. Love. “Simulating Hadronic Physics on NISQ devices using Basis Light-Front Quantization”. Phys. Rev. A 103, 062601 (2021). arXiv:2011.13443.DOI
  99. [99]Khadeejah Bepari, Sarah Malik, Michael Spannowsky, and Simon Williams. “Towards a quantum computing algorithm for helicity amplitudes and parton showers”. Phys. Rev. D 103, 076020 (2021). arXiv:2010.00046.DOI
  100. [100]Christian W. Bauer, Marat Freytsis, and Benjamin Nachman. “Simulating Collider Physics on Quantum Computers Using Effective Field Theories”. Phys. Rev. Lett. 127, 212001 (2021). arXiv:2102.05044. 1DOI
  101. [101]Andrew M Childs and Yuan Su. “Nearly optimal lattice simulation by product formulas”. Physical review letters 123, 050503 (2019). arXiv:1901.00564. 1, 1DOI
  102. [102]Masuo Suzuki. “General theory of fractal path integrals with applications to many-body theories and statistical physics”. Journal of Mathematical Physics 32, 400–407 (1991). 1DOI
  103. [103]Nathan Wiebe, Dominic Berry, Peter Hoyer, and Barry C. Sanders. “Higher order decompositions of ordered operator exponentials”. Journal of Physics A: Mathematical and Theoretical 43, 065203 (2010). arXiv:0812.0562.DOI
  104. [104]Andrew M Childs, Yuan Su, Minh C Tran, Nathan Wiebe, and Shuchen Zhu. “Theory of Trotter error with commutator scaling”. Physical Review X 11, 011020 (2021). arXiv:1912.08854. 1, 3.3, C
  105. [105]Andrew M Childs and Nathan Wiebe. “Hamiltonian simulation using linear combinations of unitary operations”. Quantum Information and Computation 12, 901–921 (2012). arXiv:1202.5822. 1DOI
  106. [106]Dominic W Berry, Andrew M Childs, Richard Cleve, Robin Kothari, and Rolando D Somma. “Simulating Hamiltonian dynamics with a truncated Taylor series”. Physical Review Letters 114, 090502 (2015). arXiv:1412.4687. 1DOI
  107. [107]Guang Hao Low and Isaac L. Chuang. “Optimal Hamiltonian Simulation by Quantum Signal Processing”. Phys. Rev. Lett. 118, 010501 (2017). arXiv:1606.02685. 1DOI
  108. [108]Guang Hao Low and Isaac L Chuang. “Hamiltonian simulation by qubitization”. Quantum 3, 163 (2019). arXiv:1610.06546. 1DOI
  109. [109]Shantanav Chakraborty, András Gilyén, and Stacey Jeffrey. “The power of block-encoded matrix powers: improved regression techniques via faster Hamiltonian simulation”. Leibniz International Proceedings in Informatics (LIPIcs) 132, 33:1–33:14 (2019). arXiv:1804.01973. 1DOI
  110. [110]András Gilyén, Yuan Su, Guang Hao Low, and Nathan Wiebe. “Quantum singular value transformation and beyond: Exponential improvements for quantum matrix arithmetics”. In Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing. Page 193–204. New York, NY, USA (2019). Association for Computing Machinery. arXiv:1806.01838. 1DOI
  111. [111]Amir Kalev and Itay Hen. “Quantum algorithm for simulating hamiltonian dynamics with an off-diagonal series expansion”. Quantum 5, 426 (2021). arXiv:2006.02539. 1DOI
  112. [112]Abhishek Rajput, Alessandro Roggero, and Nathan Wiebe. “Hybridized Methods for Quantum Simulation in the Interaction Picture”. Quantum 6, 780 (2022). arXiv:2109.03308. 1, 4DOI
  113. [113]Torin F. Stetina, Anthony Ciavarella, Xiaosong Li, and Nathan Wiebe. “Simulating Effective QED on Quantum Computers”. Quantum 6, 622 (2022). arXiv:2101.00111. 1DOI
  114. [114]Johann Ostmeyer. “Optimised Trotter decompositions for classical and quantum computing”. J. Phys. A 56, 285303 (2023). arXiv:2211.02691. 1DOI
  115. [115]Peter W Shor. “Fault-tolerant quantum computation”. In Proceedings of 37th Conference on Foundations of Computer Science. Pages 56–65. IEEE (1996). arXiv:quant-ph/9605011. 1arxiv.org/abs/quant-ph/9605011
  116. [116]Jesse R. Stryker. “Shearing approach to gauge invariant Trotterization” (2021). arXiv:2105.11548. 1, 2.1DOI
  117. [117]Andrew M Childs and Wim van Dam. “Quantum algorithms for algebraic problems”. Reviews of Modern Physics 82, 1 (2010). arXiv:0812.0380. 1DOI
  118. [118]Thomas Häner, Martin Roetteler, and Krysta M. Svore. “Optimizing Quantum Circuits for Arithmetic” (2018). arXiv:1805.12445. 1, 16, A
  119. [119]Thomas Haener, Mathias Soeken, Martin Roetteler, and Krysta M Svore. “Quantum circuits for floating-point arithmetic”. In International Conference on Reversible Computation. Pages 162–174. Springer (2018). arXiv:1807.02023. 1
  120. [120]Ian D Kivlichan, Nathan Wiebe, Ryan Babbush, and Alán Aspuru-Guzik. “Bounding the costs of quantum simulation of many-body physics in real space”. Journal of Physics A: Mathematical and Theoretical 50, 305301 (2017). arXiv:1608.05696. 1DOI
  121. [121]Yuan Su, Dominic W. Berry, Nathan Wiebe, Nicholas Rubin, and Ryan Babbush. “Fault-Tolerant Quantum Simulations of Chemistry in First Quantization”. PRX Quantum 2, 040332 (2021). arXiv:2105.12767.DOI
  122. [122]Ryan Babbush, Dominic W Berry, Ian D Kivlichan, Annie Y Wei, Peter J Love, and Alán Aspuru-Guzik. “Exponentially more precise quantum simulation of fermions in second quantization”. New Journal of Physics 18, 033032 (2016). arXiv:1506.01020.DOI
  123. [123]Poul Jorgensen. “Second quantization-based methods in quantum chemistry”. Elsevier. (2012).
  124. [124]Nikolaj Moll, Andreas Fuhrer, Peter Staar, and Ivano Tavernelli. “Optimizing qubit resources for quantum chemistry simulations in second quantization on a quantum computer”. Journal of Physics A: Mathematical and Theoretical 49, 295301 (2016). arXiv:1510.04048.DOI
  125. [125]Ryan Babbush, Dominic W Berry, Yuval r Sanders, Ian D Kivlichan, Artur Scherer, Annie Y Wei, Peter J Love, and Alán Aspuru-Guzik. “Exponentially more precise quantum simulation of fermions in the configuration interaction representation”. Quantum Science and Technology 3, 015006 (2017). arXiv:1506.01029. 1DOI
  126. [126]John B. Kogut and Leonard Susskind. “Hamiltonian Formulation of Wilson’s Lattice Gauge Theories”. Phys. Rev. D 11, 395–408 (1975). 1, 2.1, 3, 3.1DOI
  127. [127]J. Schwinger. “On angular momentum”. Technical report. Harvard University (1952). 1
  128. [128]Manu Mathur. “Harmonic oscillator potentials in SU(2) lattice gauge theory”. J. Phys. A 38, 10015–10026 (2005). arXiv:hep-lat/0403029.DOI
  129. [129]Ramesh Anishetty, Manu Mathur, and Indrakshi Raychowdhury. “Irreducible SU(3) Schwinger Bosons”. J. Math. Phys. 50, 053506 (2009). arXiv:0901.0644. 3
  130. [130]Manu Mathur, Indrakshi Raychowdhury, and Ramesh Anishetty. “SU(N) Irreducible Schwinger Bosons”. J. Math. Phys. 51, 093504 (2010). arXiv:1003.5487. 1DOI
  131. [131]Indrakshi Raychowdhury and Jesse R. Stryker. “Loop, String, and Hadron Dynamics in SU(2) Hamiltonian Lattice Gauge Theories”. Phys. Rev. D 101, 114502 (2020). arXiv:1912.06133. 1, 3.1.2, 3.1.2, BDOI
  132. [132]Zohreh Davoudi, Indrakshi Raychowdhury, and Andrew Shaw. “Search for efficient formulations for Hamiltonian simulation of non-Abelian lattice gauge theories”. Phys. Rev. D 104, 074505 (2021). arXiv:2009.11802. 1, 3, 3.1, 3.1, 4DOI
  133. [133]Jad C. Halimeh, Haifeng Lang, Julius Mildenberger, Zhang Jiang, and Philipp Hauke. “Gauge-Symmetry Protection Using Single-Body Terms”. PRX Quantum 2, 040311 (2021). arXiv:2007.00668. 1DOI
  134. [134]Minh C. Tran, Yuan Su, Daniel Carney, and Jacob M. Taylor. “Faster Digital Quantum Simulation by Symmetry Protection”. Phys. Rev. X. Quantum. 2, 010323 (2021). arXiv:2006.16248.DOI
  135. [135]Valentin Kasper, Torsten V. Zache, Fred Jelezko, Maciej Lewenstein, and Erez Zohar. “Non-Abelian gauge invariance from dynamical decoupling”. Phys. Rev. D 107, 014506 (2023). arXiv:2012.08620.arxiv.org/abs/2012.08620
  136. [136]Henry Lamm, Scott Lawrence, and Yukari Yamauchi. “Suppressing Coherent Gauge Drift in Quantum Simulations” (2020). arXiv:2005.12688.arxiv.org/abs/2005.12688
  137. [137]Jad C. Halimeh, Haifeng Lang, and Philipp Hauke. “Gauge protection in non-abelian lattice gauge theories”. New J. Phys. 24, 033015 (2022). arXiv:2106.09032. 1DOI
  138. [138]Saurabh V. Kadam, Indrakshi Raychowdhury, and Jesse R. Stryker. “Loop-string-hadron formulation of an SU(3) gauge theory with dynamical quarks”. Phys. Rev. D 107, 094513 (2023). arXiv:2212.04490. 1DOI
  139. [139]Yuan Su, Hsin-Yuan Huang, and Earl T. Campbell. “Nearly tight Trotterization of interacting electrons”. Quantum 5, 495 (2021). arXiv:2012.09194. 2, 4DOI
  140. [140]Burak Şahinoğlu and Rolando D. Somma. “Hamiltonian simulation in the low-energy subspace”. npj Quantum Inf. 7, 119 (2021). arXiv:2006.02660.DOI
  141. [141]Changhao Yi and Elizabeth Crosson. “Spectral analysis of product formulas for quantum simulation”. npj Quantum Information 8, 37 (2022). arXiv:2102.12655. 2, 4arxiv.org/abs/2102.12655
  142. [142]Wikipedia contributors. “Logic synthesis — Wikipedia, the free encyclopedia” (2013). [Online; accessed Dec-2022]. 2
  143. [143]Boris Goubolov, Aleksandr Efimov, and Valentin Skvortsov. “Walsh series and transforms: theory and applications”. Volume 64. Springer Science & Business Media. (2012). 2.2.1
  144. [144]Rao K Yarlagadda and John E Hershey. “Hadamard matrix analysis and synthesis: with applications to communications and signal/image processing”. Volume 383. Springer Science & Business Media. (2012). 2.2.1
  145. [145]Jonathan Welch, Daniel Greenbaum, Sarah Mostame, and Alan Aspuru-Guzik. “Efficient quantum circuits for diagonal unitaries without ancillas”. New Journal of Physics 16, 033040 (2014). arXiv:1306.3991. 2.2.1, 3.2.1DOI
  146. [146]Christopher Kane, Dorota M. Grabowska, Benjamin Nachman, and Christian W. Bauer. “Efficient quantum implementation of 2+1 U(1) lattice gauge theories with Gauss law constraints” (2022). arXiv:2211.10497. 2.2.1, 3.2.1arxiv.org/abs/2211.10497
  147. [147]Manu Mathur and T. P. Sreeraj. “Lattice Gauge Theories and Spin Models”. Phys. Rev. D 94, 085029 (2016). arXiv:1604.00315. 3, 3.1DOI
  148. [148]Manu Mathur and Atul Rathor. “Exact duality and local dynamics in SU(N) lattice gauge theory”. Phys. Rev. D 107, 074506 (2023). arXiv:2109.00992. 3.1arxiv.org/abs/2109.00992
  149. [149]N. E. Ligterink, N. R. Walet, and R. F. Bishop. “Towards a many body treatment of Hamiltonian lattice SU(N) gauge theory”. Annals Phys. 284, 215–262 (2000). arXiv:hep-lat/0001028.DOI
  150. [150]Pietro Silvi, Enrique Rico, Marcello Dalmonte, Ferdinand Tschirsich, and Simone Montangero. “Finite-density phase diagram of a (1+1)-d non-abelian lattice gauge theory with tensor networks”. Quantum 1, 9 (2017). arXiv:1606.05510.DOI
  151. [151]R. Brower, S. Chandrasekharan, and U. J. Wiese. “QCD as a quantum link model”. Phys. Rev. D 60, 094502 (1999). arXiv:hep-th/9740106. 3DOI
  152. [152]Stefan Kühn, J. Ignacio Cirac, and Mari Carmen Ba{\~n}uls. “Non-Abelian string breaking phenomena with Matrix Product States”. JHEP 07, 130 (2015). arXiv:1505.04441. 3DOI
  153. [153]Mari Carmen Ba{\~n}uls, Krzysztof Cichy, J. Ignacio Cirac, Karl Jansen, and Stefan Kühn. “Efficient basis formulation for 1+1 dimensional SU(2) lattice gauge theory: Spectral calculations with matrix product states”. Phys. Rev. X 7, 041046 (2017). arXiv:1707.06434.DOI
  154. [154]P. Sala, T. Shi, S. Kühn, M. C. Ba{\~n}uls, E. Demler, and J. I. Cirac. “Variational study of U(1) and SU(2) lattice gauge theories with Gaussian states in 1+1 dimensions”. Phys. Rev. D 98, 034505 (2018). arXiv:1805.05190. 3DOI
  155. [155]C. J. Hamer, Wei-hong Zheng, and J. Oitmaa. “Series expansions for the massive Schwinger model in Hamiltonian lattice gauge theory”. Phys. Rev. D 56, 55–67 (1997). arXiv:hep-lat/9701015. 3.1DOI
  156. [156]Yu Tong, Victor V. Albert, Jarrod R. McClean, John Preskill, and Yuan Su. “Provably accurate simulation of gauge theories and bosonic systems”. Quantum 6, 816 (2022). arXiv:2110.06942. 3.1DOI
  157. [157]Frank Gray. “Pulse code communication”. U.S. Patent No. 2,632,058 (1953). 12
  158. [158]Stephen S Bullock and Igor Markov. “Smaller circuits for arbitrary n-qubit diagonal computations”. Quantum Information and Computation 4, 027–047 (2004). arXiv:quant-ph/0303039. 13DOI
  159. [159]Eyal Kushilevitz and Yishay Mansour. “Learning decision trees using the fourier spectrum”. In Proceedings of the twenty-third annual ACM symposium on Theory of computing. Pages 455–464. (1991). 14
  160. [160]Alex Bocharov, Martin Roetteler, and Krysta M Svore. “Efficient synthesis of universal repeat-until-success quantum circuits”. Physical Review Letters 114, 080502 (2015). arXiv:1404.5320. 3.2.1, 3.2.1, 3.2.1, 3.2.2, 3.2.2DOI
  161. [161]Adriano Barenco, Charles H. Bennett, Richard Cleve, David P. DiVincenzo, Norman Margolus, Peter Shor, Tycho Sleator, John Smolin, and Harald Weinfurter. “Elementary gates for quantum computation”. Phys. Rev. A 52, 3457 (1995). arXiv:quant-ph/9503016. 3.2.2DOI
  162. [162]Yong He, Ming-Xing Luo, E. Zhang, Hong-Ke Wang, and Xiao-Feng Wang. “Decompositions of n-qubit toffoli gates with linear circuit complexity”. International Journal of Theoretical Physics 56, 2350–2361 (2017). 3.2.2
  163. [163]Z. Davoudi and J. R. Styker. “On the quantum-computing cost of lattice quantum chromodynamics”. work in progress (2023). 4
  164. [164]Daniel C. Hackett, Kiel Howe, Ciaran Hughes, William Jay, Ethan T. Neil, and James N. Simone. “Digitizing Gauge Fields: Lattice Monte Carlo Results for Future Quantum Computers”. Phys. Rev. A 99, 062341 (2019). arXiv:1811.03629. 4DOI
  165. [165]Tobias Hartung, Timo Jakobs, Karl Jansen, Johann Ostmeyer, and Carsten Urbach. “Digitising SU(2) gauge fields and the freezing transition”. Eur. Phys. J. C 82, 237 (2022). arXiv:2201.09625. 4DOI
  166. [166]Andrew M Childs, Dmitri Maslov, Yunseong Nam, Neil J Ross, and Yuan Su. “Toward the first quantum simulation with quantum speedup”. Proceedings of the National Academy of Sciences 115, 9456–9461 (2018). arXiv:1711.10980. 4DOI
  167. [167]Dong An, Di Fang, and Lin Lin. “Time-dependent unbounded Hamiltonian simulation with vector norm scaling”. Quantum 5, 459 (2021). arXiv:2012.13105. 4DOI
  168. [168]Qi Zhao, You Zhou, Alexander F. Shaw, Tongyang Li, and Andrew M. Childs. “Hamiltonian Simulation with Random Inputs”. Phys. Rev. Lett. 129, 270502 (2022). arXiv:2111.04773. 4DOI
  169. [169]Marcela Carena, Henry Lamm, Ying-Ying Li, and Wanqiang Liu. “Lattice renormalization of quantum simulations”. Phys. Rev. D 104, 094519 (2021). arXiv:2107.01166. 4DOI
  170. [170]Anthony Ciavarella. “Algorithm for quantum computation of particle decays”. Phys. Rev. D 102, 094505 (2020). arXiv:2007.04447.DOI
  171. [171]Raúl A. Briceño, Juan V. Guerrero, Maxwell T. Hansen, and Alexandru M. Sturzu. “Role of boundary conditions in quantum computations of scattering observables”. Phys. Rev. D 103, 014506 (2021). arXiv:2007.01155. 4DOI
  172. [172]Michael A Nielsen and Isaac Chuang. “Quantum computation and quantum information”. Cambridge University Press. (2002). A
  173. [173]Craig Gidney. “Halving the cost of quantum addition”. Quantum 2, 74 (2018). arXiv:1709.06648. A, 15, A, A, ADOI
  174. [174]Cody Jones. “Low-overhead constructions for the fault-tolerant toffoli gate”. Physical Review A 87, 022328 (2013). arXiv:1212.5069. ADOI
  175. [175]Steven A. Cuccaro, Thomas G. Draper, Samuel A. Kutin, and David Petrie Moulton. “A new quantum ripple-carry addition circuit” (2004). arXiv:quant-ph/0410184. ADOI
  176. [176]Mihir K Bhaskar, Stuart Hadfield, Angargya Papanagou, and Jasonas Petras. “Quantum algorithms and circuits for scientific computing”. Quantum Information and Computation 16, 0197–0236 (2016). arXiv:1511.08253. A

Paper details

vlnc:W_jxfdps9f
Version
v1 · latest
Published
Fresh — added to the Hub within the last 30 days
Added
License
CC BY 4.0
Usage

views · 0

downloads · 0

A view counts once per browser per day, a download each time the PDF is requested.

  • Physics and Astronomy

Not recorded for this paper

View statement
Looking for related papers…
Contents