Quantum Simulation of the First-Quantized Pauli-Fierz Hamiltonian

Abstract

We provide an explicit recursive divide and conquer approach for simulating quantum dynamics and derive a discrete first quantized non-relativistic QED Hamiltonian based on the many-particle Pauli Fierz Hamiltonian. We apply this recursive divide and conquer algorithm to this Hamiltonian and compare it to a concrete simulation algorithm that uses qubitization. Our divide and conquer algorithm, using lowest order Trotterization, scales for fixed grid spacing as $\tilde{O}(\Lambda N^2{\eta }^2{t}^2/\epsilon )$ for grid size $N$, $\eta$ particles, simulation time $t$, field cutoff $\Lambda$ and error $\epsilon$. Our qubitization algorithm scales as $\tilde{O}(N(\eta +N)(\eta +{\Lambda }^2)t\log (1/\epsilon ))$. This shows that even a naïve partitioning and low-order splitting formula can yield, through our divide and conquer formalism, superior scaling to qubitization for large $\Lambda$. We compare the relative costs of these two algorithms on systems that are relevant for applications such as the spontaneous emission of photons, and the photoionization of electrons. We observe that for different parameter regimes, one method can be favored over the other. Finally, we give new algorithmic and circuit level techniques for gate optimization including a new way of implementing a group of multi-controlled-X gates that can be used for better analysis of circuit cost.

arXiv commentAccepted in PRX Quantum

References in corpus (54)

• Quantum Simulation
• Cold atoms in cavity-generated dynamical optical potentials
• Hamiltonian Simulation by Qubitization
• Quantum algorithms for quantum chemistry and quantum materials science
• Optimal Hamiltonian Simulation by Quantum Signal Processing
• Simulating Hamiltonian dynamics with a truncated Taylor series
• Efficient quantum algorithms for simulating sparse Hamiltonians
• Self-Verifying Variational Quantum Simulation of the Lattice Schwinger Model
• Atoms and Molecules in Cavities: From Weak to Strong Coupling in QED Chemistry
• A Theory of Trotter Error
• Theory of variational quantum simulation
• Quantum Simulations of Lattice Gauge Theories using Ultracold Atoms in Optical Lattices
• Polynomial-time quantum algorithm for the simulation of chemical dynamics
• Encoding Electronic Spectra in Quantum Circuits with Linear T Complexity
• Digital quantum simulation of fermionic models with a superconducting circuit
• Quantum-state preparation with universal gate decompositions
• Architectures for a quantum random access memory
• IBM Q Experience as a versatile experimental testbed for simulating open quantum systems
• Solving strongly correlated electron models on a quantum computer
• Halving the cost of quantum addition
• Novel constructions for the fault-tolerant Toffoli gate
• A concise review of Rydberg atom based quantum computation and quantum simulation
• Standard Model Physics and the Digital Quantum Revolution: Thoughts about the Interface
• A divide-and-conquer algorithm for quantum state preparation
• Quantum arithmetic with the Quantum Fourier Transform
• Delay in atomic photoionization
• Higher Order Decompositions of Ordered Operator Exponentials
• Time-resolved photoemission by attosecond streaking: extraction of time information
• Digital Quantum Simulation of Minimal AdS/CFT
• Quantum Algorithms for Simulating the Lattice Schwinger Model
• Superconducting Circuits for Quantum Simulation of Dynamical Gauge Fields
• Efficient synthesis of universal Repeat-Until-Success circuits
• Quantum algorithm for simulating real time evolution of lattice Hamiltonians
• A quantum algorithm for high energy physics simulations
• Attosecond streaking of correlated two-electron transitions in helium
• Quantum Simulation of Interacting Fermion Lattice Models in Trapped Ions
• Time delay between photoemission from the 2p and 2s subshells of Neon
• Time delays for attosecond streaking in photoionization of neon
• Quantum Simulation of Chemistry with Sublinear Scaling in Basis Size
• Quantum simulation with hybrid tensor networks
• Provably accurate simulation of gauge theories and bosonic systems
• Practical approximation of single-qubit unitaries by single-qubit quantum Clifford and T circuits
• On the CNOT-complexity of CNOT-PHASE circuits
• Bounding the costs of quantum simulation of many-body physics in real space
• Polarization effects in attosecond photoelectron spectroscopy
• Hybridized Methods for Quantum Simulation in the Interaction Picture
• T-count and T-depth of any multi-qubit unitary
• Many-body calculations of two-photon, two color matrix elements for attosecond delays
• On the complexity of implementing Trotter steps
• Reducing the CNOT count for Clifford+T circuits on NISQ architectures
• Attosecond photoionization dynamics in neon
• Synthesizing efficient circuits for Hamiltonian simulation
• Experimental Simulation of Loop Quantum Gravity on a Photonic Chip
• Photoionization of aligned excited states in neon by attosecond laser pulses

Cited by in corpus (3)

• Strong Error Bounds for Trotter & Strang-Splittings and Their Implications for Quantum Chemistry
• A quantum random access memory (QRAM) using a polynomial encoding of binary strings
• Quantum algorithm for solving generalized eigenvalue problems with application to the Schrödinger equation