Quantum Simulation of the First-Quantized Pauli-Fierz Hamiltonian
Fuente:
arXiv
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Preprint |
| Published: |
2023
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866910368712884224 |
|---|---|
| author | Mukhopadhyay, Priyanka Stetina, Torin F. Wiebe, Nathan |
| author_facet | Mukhopadhyay, Priyanka Stetina, Torin F. Wiebe, Nathan |
| contents | 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 $\widetilde{O}(ΛN^2η^2 t^2 /ε)$ for grid size $N$, $η$ particles, simulation time $t$, field cutoff $Λ$ and error $ε$. Our qubitization algorithm scales as $\widetilde{O}(N(η+N)(η+Λ^2) t\log(1/ε)) $. 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 $Λ$. 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. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2306_11198 |
| institution | arXiv |
| publishDate | 2023 |
| record_format | arxiv |
| spellingShingle | Quantum Simulation of the First-Quantized Pauli-Fierz Hamiltonian Mukhopadhyay, Priyanka Stetina, Torin F. Wiebe, Nathan Quantum Physics 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 $\widetilde{O}(ΛN^2η^2 t^2 /ε)$ for grid size $N$, $η$ particles, simulation time $t$, field cutoff $Λ$ and error $ε$. Our qubitization algorithm scales as $\widetilde{O}(N(η+N)(η+Λ^2) t\log(1/ε)) $. 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 $Λ$. 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. |
| title | Quantum Simulation of the First-Quantized Pauli-Fierz Hamiltonian |
| topic | Quantum Physics |
| url | https://arxiv.org/abs/2306.11198 |