Resource-Efficient Simulations of Particle Scattering on a Digital Quantum Computer
Yahui Chai, Joe Gibbs, Vincent R. Pascuzzi, Zo\"e Holmes, Stefan K\"uhn, Francesco Tacchino, Ivano Tavernelli

TL;DR
This paper presents resource-efficient methods for simulating particle scattering in the Thirring model on digital quantum computers, achieving significant circuit compression and accurate dynamics simulation on up to 80 qubits.
Contribution
It introduces tensor network-based circuit compression techniques and demonstrates their effectiveness in simulating complex scattering processes on quantum hardware.
Findings
Circuit depth reduced by a factor of 3.2 using tensor network methods.
Accurate scattering dynamics simulated on 40-qubit hardware.
Wave packet state preparation demonstrated on 80 qubits.
Abstract
We develop and demonstrate methods for simulating the scattering of particle wave packets in the interacting Thirring model on digital quantum computers, with hardware implementations on up to 80 qubits. We identify low-entanglement time slices of the scattering dynamics and exploit their efficient representation by tensor networks. Circuit compression based on matrix product state techniques yields on average a reduction by a factor of 3.2 in circuit depth compared to conventional approaches, allowing longer evolution times to be evaluated with higher fidelity on contemporary quantum processors. Utilizing zero-noise extrapolation in combination with Pauli twirling, on quantum hardware we accurately simulate the full scattering dynamics on 40 qubits, and further demonstrate the wave packet state-preparation on 80 qubits.
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.
