Quantum simulation of quantum field theory using continuous variables
Kevin Marshall, Raphael Pooser, George Siopsis, and Christian, Weedbrook

TL;DR
This paper introduces a new quantum algorithm for continuous-variable quantum computers that achieves exponential speedup in calculating scattering amplitudes in scalar bosonic quantum field theory, supported by a feasible experimental implementation.
Contribution
It presents a novel algorithm leveraging continuous-variable quantum computing for quantum field theory simulations, demonstrating exponential speedup and practical feasibility.
Findings
Algorithm achieves exponential speedup over classical methods
Experimental implementation based on current cluster state technology
Feasible with today's quantum hardware
Abstract
Much progress has been made in the field of quantum computing using continuous variables over the last couple of years. This includes the generation of extremely large entangled cluster states (10,000 modes, in fact) as well as a fault tolerant architecture. This has led to the point that continuous-variable quantum computing can indeed be thought of as a viable alternative for universal quantum computing. With that in mind, we present a new algorithm for continuous-variable quantum computers which gives an exponential speedup over the best known classical methods. Specifically, this relates to efficiently calculating the scattering amplitudes in scalar bosonic quantum field theory, a problem that is believed to be hard using a classical computer. Building on this, we give an experimental implementation based on cluster states that is feasible with today's technology.
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.
