Recognition: unknown
Quantum Algorithms for Quantum Field Theories
read the original abstract
Quantum field theory reconciles quantum mechanics and special relativity, and plays a central role in many areas of physics. We develop a quantum algorithm to compute relativistic scattering probabilities in a massive quantum field theory with quartic self-interactions (phi-fourth theory) in spacetime of four and fewer dimensions. Its run time is polynomial in the number of particles, their energy, and the desired precision, and applies at both weak and strong coupling. In the strong-coupling and high-precision regimes, our quantum algorithm achieves exponential speedup over the fastest known classical algorithm.
This paper has not been read by Pith yet.
Forward citations
Cited by 9 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...
-
Ground state preparation in $(2+1)$-dimensional pure $\mathbb{Z}_2$ lattice gauge theory via deterministic quantum imaginary time evolution
Deterministic QITE made gauge-invariant via commuting Pauli operators achieves relative error below 0.1 percent for ground-state preparation in 2+1D Z2 LGT on systems up to twelve plaquettes, as shown by tensor-networ...
-
Ether of Orbifolds
Orbifold lattices incur m^4 Trotter overhead, m^2 contamination, and mandatory mass extrapolation, rendering them 10^4 to 10^10 times costlier than alternatives for a 10^3 calculation.
-
Toward selective quantum advantage in hadronic tomography:explicit cases from Compton form factors, GPDs, TMDs, and GTMDs
Quantum advantage in hadronic tomography should be evaluated selectively for CFFs, GPDs, TMDs, and GTMDs because their light-front and real-time correlation functions create ill-posed inverse problems that quantum alg...
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.