pith. sign in

arxiv: 1811.10085 · v1 · pith:5FJ2Z5UYnew · submitted 2018-11-25 · ✦ hep-lat · hep-th· quant-ph

Simulating quantum field theory with a quantum computer

classification ✦ hep-lat hep-thquant-ph
keywords quantumfieldwillcomputersdigitalhadronicphysicsprogress
0
0 comments X
read the original abstract

Forthcoming exascale digital computers will further advance our knowledge of quantum chromodynamics, but formidable challenges will remain. In particular, Euclidean Monte Carlo methods are not well suited for studying real-time evolution in hadronic collisions, or the properties of hadronic matter at nonzero temperature and chemical potential. Digital computers may never be able to achieve accurate simulations of such phenomena in QCD and other strongly-coupled field theories; quantum computers will do so eventually, though I'm not sure when. Progress toward quantum simulation of quantum field theory will require the collaborative efforts of quantumists and field theorists, and though the physics payoff may still be far away, it's worthwhile to get started now. Today's research can hasten the arrival of a new era in which quantum simulation fuels rapid progress in fundamental physics.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 4 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. Entanglement Maximization and Symmetry Selection in Composite Higgs Models

    hep-ph 2026-05 unverdicted novelty 7.0

    Maximizing entanglement in the top-quark helicity space of Composite Higgs models selects symmetry structures that enforce a finite Higgs potential and relate left- and right-handed top sectors.

  2. Fault-Tolerant Resource Comparison of Qudit and Qubit Encodings for Diagonal Quadratic Operators

    quant-ph 2026-04 unverdicted novelty 6.0

    Qudit encodings for quadratic diagonal evolutions require exponentially stronger synthesis advantages than qubits to win asymptotically in product formulas but can yield constant-factor savings in LCU at low d.

  3. Fault-Tolerant Resource Comparison of Qudit and Qubit Encodings for Diagonal Quadratic Operators

    quant-ph 2026-04 unverdicted novelty 5.0

    The paper derives explicit finite-d break-even synthesis costs for qudit vs. qubit encodings of diagonal quadratic operators in product-formula and LCU simulations, identifying low-d regions where qudits yield savings.

  4. All Hilbert spaces are the same: consequences for generalized coordinates and momenta

    quant-ph 2025-02 unverdicted novelty 5.0

    All separable Hilbert spaces of given dimension being isomorphic implies exactly six basic generalized coordinate operators and seven coordinate-momentum pairs via self-adjoint or Neumark extensions.