Related papers: Simulating Scattering of Composite Particles
I discuss a formalism for computing quantum scattering amplitudes using a semiclassical expansion of a functional integral representation for the S-matrix. The classical background for the expansion is determined by solving the equations of…
We study relativistic scattering when one only has access to a subset of the particles, using the language of quantum measurement theory. We give an exact, non-perturbative formula for the von Neumann entanglement entropy of an apparatus…
We introduce a framework for simulating quantum optics by decomposing the system into a finite rank (number of terms) superposition of coherent states. This allows us to define a resource theory, where linear optical operations are 'free'…
This paper describes an algorithmic system called SQT for the computer simulation of a wide class of quantum experiments on entangled particles. SQT maintains a hidden internal state for each particle and it provides an initialization…
In quantum mechanics textbooks, a single-particle scattering theory is introduced. In the present work, a generalized scattering theory is presented, which can be in principle applied to the scattering problems of arbitrary number of…
Quantum simulation can help us study poorly understood topics such as high-temperature superconductivity and drug design. However, existing quantum simulation algorithms for current quantum computers often have drawbacks that impede their…
A classical state-preparation device cannot generate states in relative superposition. We introduce classical models in which devices that are individually unable to generate states with relative superposition can be stochastically…
Quantum computers hold promise to improve the efficiency of quantum simulations of materials and to enable the investigation of systems and properties more complex than tractable at present on classical architectures. Here, we discuss…
Quantum computers may one day enable the efficient simulation of strongly coupled plasmas that lie beyond the reach of classical computation in regimes where quantum effects are important and the scale separation is large. In this article,…
We describe how quasiclassical relative positions of particles emerge in an initially delocalized quantum system as scattering of a probe beam is observed. We show that in the multiparticle case this localization in position space occurs…
Time evolution and scattering simulation in phenomenological models are of great interest for testing and validating the potential for near-term quantum computers to simulate quantum field theories. Here, we simulate one-particle…
We present a digital quantum computation of two-hadron scattering in a $Z_2$ lattice gauge theory in 1+1 dimensions. We prepare well-separated single-particle wave packets with desired momentum-space wavefunctions, and simulate their…
Whereas quantum complexity theory has traditionally been concerned with problems arising from classical complexity theory (such as computing boolean functions), it also makes sense to study the complexity of inherently quantum operations…
Classical simulation of quantum computers is an irreplaceable step in the design of quantum algorithms. Exponential simulation costs demand the use of high-performance computing techniques, and in particular distribution, whereby the…
Hybrid classical-quantum algorithms aim at variationally solving optimisation problems, using a feedback loop between a classical computer and a quantum co-processor, while benefitting from quantum resources. Here we present experiments…
We apply quantum integration to elementary particle-physics processes. In particular, we look at scattering processes such as ${\rm e}^+{\rm e}^- \to q \bar q$ and ${\rm e}^+{\rm e}^- \to q \bar q' {\rm W}$. The corresponding probability…
A classical computer simulating Schrodinger dynamics of a quantum system requires resources which scale exponentially with the size of the system, and is regarded as inefficient for such purposes. However, a quantum computer made up of a…
Randomisation is widely used in quantum algorithms to reduce the number of quantum gates and ancillary qubits required. A range of randomised algorithms, including eigenstate property estimation by spectral filters, Hamiltonian simulation,…
We present a detailed study of scattering by an amplitude-modulated potential barrier using three distinct physical frameworks: quantum, classical, and semiclassical. Classical physics gives bounds on the energy and momentum of the…
Future quantum computers may serve as a tool to access non-perturbative real-time correlation functions. In this talk, we discuss the prospects of using these to study Compton scattering for arbitrary kinematics. The restriction to a…