Recognition: unknown
Quantum Computation of Scattering in Scalar Quantum Field Theories
read the original abstract
Quantum field theory provides the framework for the most fundamental physical theories to be confirmed experimentally and has enabled predictions of unprecedented precision. However, calculations of physical observables often require great computational complexity and can generally be performed only when the interaction strength is weak. A full understanding of the foundations and rich consequences of quantum field theory remains an outstanding challenge. We develop a quantum algorithm to compute relativistic scattering amplitudes in massive phi-fourth theory in spacetime of four and fewer dimensions. The algorithm runs in a time that is polynomial in the number of particles, their energy, and the desired precision, and applies at both weak and strong coupling. Thus, it offers exponential speedup over existing classical methods at high precision or strong coupling.
This paper has not been read by Pith yet.
Forward citations
Cited by 6 Pith papers
-
Tightening energy-based boson truncation bound using Monte Carlo-assisted methods
Monte Carlo-assisted tightening of the energy-based boson truncation bound substantially reduces volume dependence in (1+1)D scalar field theory and (2+1)D U(1) gauge theory.
-
Tightening energy-based boson truncation bound using Monte Carlo-assisted methods
A Monte Carlo-assisted analytic method tightens energy-based bounds on boson truncation errors, substantially reducing the volume dependence of the required cutoff in scalar and gauge theories.
-
A collider as a quantum computer
Collider scattering processes such as electron-positron annihilation to muon pairs can be represented as quantum circuits with unitary and non-unitary components.
-
Quantum Simulation of the Real-time Dynamics in the multi-flavor Gross-Neveu Model at the utility scale using Superconducting Quantum Computers
A scalable Trotterization and Localized Diagonal Operator Approximation enable real-time quantum simulation of the multi-flavor Gross-Neveu model on utility-scale superconducting hardware.
-
Fault-Tolerant Resource Comparison of Qudit and Qubit Encodings for Diagonal Quadratic Operators
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.
-
Exponentially improved quantum simulation of scalar QFT
Diagonalizing field operators before Pauli-string decomposition exponentially cuts circuit depth and Trotter errors in 2+1D scalar QFT simulations, with faster local-truncation convergence for Lorentzian energy-energy...
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.