Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:1503.08121 · Physical Review A

Quantum simulation of quantum field theory using continuous variables

Kevin Marshall, Raphael C. Pooser, George Siopsis, Christian Weedbrook

Published Dec 14, 2015• 73 citations
arXivHTMLPDF

Abstract

The year 1982 is often credited as the year that theoretical quantum computing was started with a keynote speech by Richard Feynman, who proposed a universal quantum simulator, the idea being that if you had such a machine you could in principle ``imitate any quantum system, including the physical world.'' With that in mind, we present an algorithm for a continuous-variable quantum computing architecture 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 continuous-variable states that is feasible with today's technology.

DOI
10.1103/physreva.92.063825

Related papers

Quantum computation of scattering amplitudes in scalar quantum electrodynamics

Kübra Yeter Aydeniz, George Siopsis

We present a quantum algorithm for the calculation of scattering amplitudes of massive charged scalar particles in scalar quantum electrodynamics. Our algorithm is based on continuous-variable quantum computing architecture resulting in exponential speedup over classical methods. We derive a simple form of the Hamiltonian including interactions and a straightforward implementation of the constraint due to gauge invariance.

arXiv:1709.02355•Physical review. D/Physical review. D.•Feb 12, 2018•15 citations

Quantum Computation of Scattering in Scalar Quantum Field Theories

Stephen P. Jordan, Keith S. M. Lee, John P. Preskill

Quantum field theory provides the framework for the most fundamental physical theories to be confirmed experimentally and has enabled predictions of unprecedented precision. However, calculations of physical observables often require great computational complexity and can generally be performed only when the interaction strength is weak. A full understanding of the foundations and rich consequences of quantum field theory remains an outstanding challenge. We develop a quantum algorithm to compute relativistic scattering amplitudes in massive phi-fourth theory in spacetime of four and fewer dimensions. The algorithm runs in a time that is polynomial in the number of particles, their energy, and the desired precision, and applies at both weak and strong coupling. Thus, it offers exponential speedup over existing classical methods at high precision or strong coupling.

arXiv:1112.4833•Dec 20, 2011•7 citations

Quantum Computation of Scattering in Scalar Quantum Field Theories

Stephen P. Jordan, Keith S. M. Lee, John P. Preskill

Quantum field theory provides the framework for the most fundamental physical theories to be confirmed experimentally, and has enabled predictions of unprecedented precision. However, calculations of physical observables often require great computational complexity and can generally be performed only when the interaction strength is weak. A full understanding of the foundations and rich consequences of quantum field theory remains an outstanding challenge. We develop a quantum algorithm to compute relativistic scattering amplitudes in massive phi-fourth theory in spacetime of four and fewer dimensions. The algorithm runs in a time that is polynomial in the number of particles, their energy, and the desired precision, and applies at both weak and strong coupling. Thus, it offers exponential speedup over existing classical methods at high precision or strong coupling.

•Sep 1, 2014•85 citations

Quantum computation of scattering in scalar quantum field theories

Stephen P. Jordan, Keith S. M. Lee, John P. Preskill

Quantum field theory provides the framework for the most fundamental physical theories to be confirmed experimentally and has enabled predictions of unprecedented precision. However, calculations of physical observables often require great computational complexity and can generally be performed only when the interaction strength is weak. A full understanding of the foundations and rich consequences of quantum field theory remains an outstanding challenge. We develop a quantum algorithm to compute relativistic scattering amplitudes in massive $\phi^4$ theory in spacetime of four and fewer dimensions. The algorithm runs in a time that is polynomial in the number of particles, their energy, and the desired precision, and applies at both weak and strong coupling. Thus, it offers exponential speedup over existing classical methods at high precision or strong coupling.

Quantum Information and Computation•Sep 1, 2014•125 citations

Quantum Information and Quantum Computation with Continuous Variables

Christian Weedbrook

The idea to assimilate classical information theory with quantum mechanics resulted in the creation of a new field in physics known as quantum information. One of the first papers in this new field occurred in the early 1970's when Stephen Wiesner wrote the seminal manuscript titled: Conjugate Coding. However, its importance wasn't imme- diately recognized and wasn't published until 1983. The 1980's and 1990's saw a number of important papers published in quantum information leading to the subfields of quantum cryptography, quantum teleportation, quantum entanglement, distinguishability of quantum states, and quantum cloning. It was also during the 1980's, that a new model of computing, known as quantum computation, was beginning to emerge. It offered the possibility of solving certain problems faster than a classical computer by exploiting various properties of quantum mechanics. Research in this field was undoubtedly stimulated by a well known talk given by Richard Feynman in 1981 at MIT on quantum simulations. Both quantum information and quantum computation were initially developed with quantum discrete variables in mind. However, over the course of the last decade, there has been a significant increase in using quantum continuous variables. This thesis will focus on the topic of quantum information and quantum computation using continuous variables. Specifically, we will theoretically consider the cloning of continuous-variable entanglement, the distinguishability of Gaussian states, new continuous-variable quantum cryptography protocols and finally, the universality of quantum computation using continuous-variable cluster states.

•Jul 1, 2009•0 citations

Quantum Algorithm for High Energy Physics Simulations

Benjamin Philip Nachman, Davide Provasoli, Wibe Albert de Jong +1 more

Simulating quantum field theories is a flagship application of quantum computing. However, calculating experimentally relevant high energy scattering amplitudes entirely on a quantum computer is prohibitively difficult. It is well known that such high energy scattering processes can be factored into pieces that can be computed using well established perturbative techniques, and pieces which currently have to be simulated using classical Markov chain algorithms. These classical Markov chain simulation approaches work well to capture many of the salient features, but cannot capture all quantum effects. To exploit quantum resources in the most efficient way, we introduce a new paradigm for quantum algorithms in field theories. This approach uses quantum computers only for those parts of the problem which are not computable using existing techniques. In particular, we develop a polynomial time quantum final state shower that accurately models the effects of intermediate spin states similar to those present in high energy electroweak showers with a global evolution variable. The algorithm is explicitly demonstrated for a simplified quantum field theory on a quantum computer.

arXiv:1904.03196•Physical Review Letters•Feb 10, 2021•127 citations
The year 1982 is often credited as the year that theoretical quantum computing was started with a keynote speech by Richard Feynman, who proposed a universal quantum simulator, the idea being that if you had such a machine you could in principle ``imitate any quantum system, including the physical world.'' With that in mind, we present an algorithm for a continuous-variable quantum computing architecture 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 continuous-variable states that is feasible with today's technology.
Quantum field theory provides the framework for the most fundamental physical theories to be confirmed experimentally and has enabled predictions of unprecedented precision. However, calculations of physical observables often require great computational complexity and can generally be performed only when the interaction strength is weak. A full understanding of the foundations and rich consequences of quantum field theory remains an outstanding challenge. We develop a quantum algorithm to compute relativistic scattering amplitudes in massive phi-fourth theory in spacetime of four and fewer dimensions. The algorithm runs in a time that is polynomial in the number of particles, their energy, and the desired precision, and applies at both weak and strong coupling. Thus, it offers exponential speedup over existing classical methods at high precision or strong coupling.
Quantum field theory provides the framework for the most fundamental physical theories to be confirmed experimentally, and has enabled predictions of unprecedented precision. However, calculations of physical observables often require great computational complexity and can generally be performed only when the interaction strength is weak. A full understanding of the foundations and rich consequences of quantum field theory remains an outstanding challenge. We develop a quantum algorithm to compute relativistic scattering amplitudes in massive phi-fourth theory in spacetime of four and fewer dimensions. The algorithm runs in a time that is polynomial in the number of particles, their energy, and the desired precision, and applies at both weak and strong coupling. Thus, it offers exponential speedup over existing classical methods at high precision or strong coupling.
Quantum field theory provides the framework for the most fundamental physical theories to be confirmed experimentally and has enabled predictions of unprecedented precision. However, calculations of physical observables often require great computational complexity and can generally be performed only when the interaction strength is weak. A full understanding of the foundations and rich consequences of quantum field theory remains an outstanding challenge. We develop a quantum algorithm to compute relativistic scattering amplitudes in massive ϕ4\phi^4ϕ4 theory in spacetime of four and fewer dimensions. The algorithm runs in a time that is polynomial in the number of particles, their energy, and the desired precision, and applies at both weak and strong coupling. Thus, it offers exponential speedup over existing classical methods at high precision or strong coupling.
The idea to assimilate classical information theory with quantum mechanics resulted in the creation of a new field in physics known as quantum information. One of the first papers in this new field occurred in the early 1970's when Stephen Wiesner wrote the seminal manuscript titled: Conjugate Coding. However, its importance wasn't imme- diately recognized and wasn't published until 1983. The 1980's and 1990's saw a number of important papers published in quantum information leading to the subfields of quantum cryptography, quantum teleportation, quantum entanglement, distinguishability of quantum states, and quantum cloning. It was also during the 1980's, that a new model of computing, known as quantum computation, was beginning to emerge. It offered the possibility of solving certain problems faster than a classical computer by exploiting various properties of quantum mechanics. Research in this field was undoubtedly stimulated by a well known talk given by Richard Feynman in 1981 at MIT on quantum simulations. Both quantum information and quantum computation were initially developed with quantum discrete variables in mind. However, over the course of the last decade, there has been a significant increase in using quantum continuous variables. This thesis will focus on the topic of quantum information and quantum computation using continuous variables. Specifically, we will theoretically consider the cloning of continuous-variable entanglement, the distinguishability of Gaussian states, new continuous-variable quantum cryptography protocols and finally, the universality of quantum computation using continuous-variable cluster states.
Simulating quantum field theories is a flagship application of quantum computing. However, calculating experimentally relevant high energy scattering amplitudes entirely on a quantum computer is prohibitively difficult. It is well known that such high energy scattering processes can be factored into pieces that can be computed using well established perturbative techniques, and pieces which currently have to be simulated using classical Markov chain algorithms. These classical Markov chain simulation approaches work well to capture many of the salient features, but cannot capture all quantum effects. To exploit quantum resources in the most efficient way, we introduce a new paradigm for quantum algorithms in field theories. This approach uses quantum computers only for those parts of the problem which are not computable using existing techniques. In particular, we develop a polynomial time quantum final state shower that accurately models the effects of intermediate spin states similar to those present in high energy electroweak showers with a global evolution variable. The algorithm is explicitly demonstrated for a simplified quantum field theory on a quantum computer.