Quantum Simulation of the First-Quantized Pauli-Fierz Hamiltonian
Priyanka Mukhopadhyay, Torin F. Stetina, Nathan Wiebe

TL;DR
This paper introduces a recursive divide and conquer quantum simulation algorithm for the first-quantized Pauli-Fierz Hamiltonian, demonstrating superior scaling in certain regimes compared to qubitization, with new gate optimization techniques.
Contribution
It presents a novel recursive divide and conquer approach for simulating quantum dynamics of the Pauli-Fierz Hamiltonian, outperforming qubitization in specific parameter regimes.
Findings
Divide and conquer algorithm scales as ( extLambda) N^2 ta^2 t^2 / \u03b5
Qubitization scales as (N(ta+N)(ta +mbda^2) t log(1/psilon))
Divide and conquer can be more efficient for large mbda regimes.
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 for grid size , particles, simulation time , field cutoff and error . Our qubitization algorithm scales as . This shows that even a na\"ive partitioning and low-order splitting formula can yield, through our divide and conquer formalism, superior scaling to qubitization for large…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsQuantum Computing Algorithms and Architecture · Quantum and electron transport phenomena · Quantum Information and Cryptography
