Improving Quantum Simulation Efficiency of Final State Radiation with Dynamic Quantum Circuits
arXiv:2203.10018 · doi:10.1103/PhysRevD.106.036007
Abstract
Reference arXiv:1904.03196 recently introduced an algorithm (QPS) for simulating parton showers with intermediate flavor states using polynomial resources on a digital quantum computer. We make use of a new quantum hardware capability called dynamical quantum computing to improve the scaling of this algorithm to significantly improve the method precision. In particular, we modify the quantum parton shower circuit to incorporate mid-circuit qubit measurements, resets, and quantum operations conditioned on classical information. This reduces the computational depth from to and the qubit requirements are reduced from to . Using "matrix product state" statevector simulators, we demonstrate that the improved algorithm yields expected results for 2, 3, 4, and 5-steps of the algorithm. We compare absolute costs with the original QPS algorithm, and show that dynamical quantum computing can significantly reduce costs in the class of digital quantum algorithms representing quantum walks (which includes the QPS).
Updated to journal version
References in corpus (4)
Cited by in corpus (6)
- Preparations for Quantum Simulations of Quantum Chromodynamics in 1+1 Dimensions: (I) Axial Gauge
- Preparations for Quantum Simulations of Quantum Chromodynamics in 1+1 Dimensions: (II) Single-Baryon -Decay in Real Time
- Collider Events on a Quantum Computer
- State Preparation in the Heisenberg Model through Adiabatic Spiraling
- Preparation for Quantum Simulation of the 1+1D O(3) Non-linear σ-Model using Cold Atoms
- A general approach to quantum integration of cross sections in high-energy physics