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.

Accepted in PRX Quantum

References in corpus (15)

• Cold atoms in cavity-generated dynamical optical potentials
• Simulating Hamiltonian dynamics with a truncated Taylor series
• Polynomial-time quantum algorithm for the simulation of chemical dynamics
• Digital quantum simulation of fermionic models with a superconducting circuit
• Quantum-state preparation with universal gate decompositions
• Architectures for a quantum random access memory
• Novel constructions for the fault-tolerant Toffoli gate
• A concise review of Rydberg atom based quantum computation and quantum simulation
• Delay in atomic photoionization
• Efficient synthesis of universal Repeat-Until-Success circuits
• Time delay between photoemission from the 2p and 2s subshells of Neon
• On the complexity of implementing Trotter steps
• Attosecond photoionization dynamics in neon
• Synthesizing efficient circuits for Hamiltonian simulation
• Experimental Simulation of Loop Quantum Gravity on a Photonic Chip

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