Gluon Digitization via Character Expansion for Quantum Computers

• URL: http://arxiv.org/abs/2203.02330v1
• Date: Fri, 4 Mar 2022 14:12:52 GMT
• Title: Gluon Digitization via Character Expansion for Quantum Computers
• Authors: Yao Ji, Henry Lamm, Shuchen Zhu
• Abstract summary: Scheme based on discrete subgroups use a smaller, fixed number of qubits at the cost of systematic errors. We systematize this approach by deriving the single plaquette action through matching the continuous group action to that of a discrete one. We accompany this scheme by simulations of pure gauge over the largest discrete crystal-like subgroup of $SU(3)$ up to the fifth-order in the coupling constant.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Efficient digitization is required for quantum simulations of gauge theories. Schemes based on discrete subgroups use a smaller, fixed number of qubits at the cost of systematic errors. We systematize this approach by deriving the single plaquette action through matching the continuous group action to that of a discrete one via group character expansions modulo the field fluctuation contributions. We accompany this scheme by simulations of pure gauge over the largest discrete crystal-like subgroup of $SU(3)$ up to the fifth-order in the coupling constant.

Related papers

• Universality of critical dynamics with finite entanglement [68.8204255655161]
  We study how low-energy dynamics of quantum systems near criticality are modified by finite entanglement. Our result establishes the precise role played by entanglement in time-dependent critical phenomena.
  arXiv  Detail & Related papers  (2023-01-23T19:23:54Z)
• Digitizing SU(2) Gauge Fields and What to Look Out for When Doing So [0.0]
  We present our results for a handful of discretization approaches for the non-trivial example of SU(2). A generalized version of the Fibonacci spiral appears to be particularly efficient and close to optimal.
  arXiv  Detail & Related papers  (2022-12-19T14:31:47Z)
• Three-fold way of entanglement dynamics in monitored quantum circuits [68.8204255655161]
  We investigate the measurement-induced entanglement transition in quantum circuits built upon Dyson's three circular ensembles. We obtain insights into the interplay between the local entanglement generation by the gates and the entanglement reduction by the measurements.
  arXiv  Detail & Related papers  (2022-01-28T17:21:15Z)
• Digitising SU(2) Gauge Fields and the Freezing Transition [0.0]
  For any Lie group other than U$(1)$, there is no class ofally dense discrete subgroups. Discretisations limited to subgroups are bound to lead to freezing of Monte Carlo simulations at weak couplings. A generalised version of the Fibonacci spiral appears to be particularly efficient and close to optimal.
  arXiv  Detail & Related papers  (2022-01-24T12:09:09Z)
• Unitary Selective Coupled-Cluster Method [0.8258451067861933]
  Simulating molecules using the Variational Quantum Eigensolver method is one of the promising applications for NISQ-era quantum computers. Designing an efficient ansatz to represent the electronic wave function is crucial in such simulations. We present a unitary selective coupled-cluster method, a way to construct a unitary coupled-cluster ansatz iteratively using a selection procedure with excitations up to fourth order.
  arXiv  Detail & Related papers  (2021-09-26T17:02:16Z)
• Quantum simulation of $\phi^4$ theories in qudit systems [53.122045119395594]
  We discuss the implementation of quantum algorithms for lattice $Phi4$ theory on circuit quantum electrodynamics (cQED) system. The main advantage of qudit systems is that its multi-level characteristic allows the field interaction to be implemented only with diagonal single-qudit gates.
  arXiv  Detail & Related papers  (2021-08-30T16:30:33Z)
• Algebraic Compression of Quantum Circuits for Hamiltonian Evolution [52.77024349608834]
  Unitary evolution under a time dependent Hamiltonian is a key component of simulation on quantum hardware. We present an algorithm that compresses the Trotter steps into a single block of quantum gates. This results in a fixed depth time evolution for certain classes of Hamiltonians.
  arXiv  Detail & Related papers  (2021-08-06T19:38:01Z)
• Gluon Field Digitization via Group Space Decimation for Quantum Computers [0.0]
  Scheme based on discrete subgroups use fewer qubits at the cost of systematic errors. We systematize this approach by deriving a single plaquette action for approximating general continuous gauge groups. We accompany the scheme by simulations of pure gauge over the largest discrete subgroup of $SU(3)$ up to the third order.
  arXiv  Detail & Related papers  (2020-05-28T18:31:58Z)
• 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)
• Operator-algebraic renormalization and wavelets [62.997667081978825]
  We construct the continuum free field as the scaling limit of Hamiltonian lattice systems using wavelet theory. A renormalization group step is determined by the scaling equation identifying lattice observables with the continuum field smeared by compactly supported wavelets.
  arXiv  Detail & Related papers  (2020-02-04T18:04:51Z)

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.