Simulating Scattering of Composite Particles

• URL: http://arxiv.org/abs/2310.13742v2
• Date: Thu, 26 Oct 2023 18:00:02 GMT
• Title: Simulating Scattering of Composite Particles
• Authors: Michael Kreshchuk, James P. Vary, Peter J. Love
• Abstract summary: We develop a non-perturbative approach to simulating scattering on classical and quantum computers. The construction is designed to mimic a particle collision, wherein two composite particles are brought in contact. The approach is well-suited for studying strongly coupled systems in both relativistic and non-relativistic settings.
• Score: 0.09208007322096534
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: We develop a non-perturbative approach to simulating scattering on classical and quantum computers, in which the initial and final states contain a fixed number of composite particles. The construction is designed to mimic a particle collision, wherein two composite particles are brought in contact. The initial states are assembled via consecutive application of operators creating eigenstates of the interacting theory from vacuum. These operators are defined with the aid of the M{\o}ller wave operator, which can be constructed using such methods as adiabatic state preparation or double commutator flow equation. The approach is well-suited for studying strongly coupled systems in both relativistic and non-relativistic settings. For relativistic systems, we employ the language of light-front quantization, which has been previously used for studying the properties of individual bound states, as well as for simulating their scattering in external fields, and is now adopted to the studies of scattering of bound state systems. For simulations on classical computers, we describe an algorithm for calculating exact (in the sense of a given discretized theory) scattering probabilities, which has cost (memory and time) exponential in momentum grid size. Such calculations may be interesting in their own right and can be used for benchmarking results of a quantum simulation algorithm, which is the main application of the developed framework. We illustrate our ideas with an application to the $\phi^4$ theory in $1+1\rm D$.

Related papers

• Gauge-Fixing Quantum Density Operators At Scale [0.0]
  We provide theory, algorithms, and simulations of non-equilibrium quantum systems. We analytically and numerically examine the virtual freedoms associated with the representation of quantum density operators.
  arXiv  Detail & Related papers  (2024-11-05T22:56:13Z)
• Electrostatics-based particle sampling and approximate inference [0.0]
  A new particle-based sampling and approximate inference method, based on electrostatics and Newton mechanics principles, is introduced. A discrete-time, discrete-space algorithmic design is provided for usage in more general inference problems.
  arXiv  Detail & Related papers  (2024-06-28T16:53:06Z)
• Exponential improvements in the simulation of lattice gauge theories using near-optimal techniques [0.0]
  We conduct an in-depth analysis of the cost of simulating Abelian and non-Abelian lattice gauge theories. We provide explicit circuit constructions, as well as T-gate counts and qubit counts for the entire simulation.
  arXiv  Detail & Related papers  (2024-05-16T19:36:49Z)
• Real-time Dynamics of the Schwinger Model as an Open Quantum System with Neural Density Operators [1.0713888959520208]
  This work develops machine learning algorithms to overcome the difficulty of approximating exact quantum states with neural network parametrisations. As a proof of principle demonstration in a QCD-like theory, the approach is applied to solve the Lindblad master equation in the 1+1d lattice Schwinger Model as an open quantum system.
  arXiv  Detail & Related papers  (2024-02-09T18:36:17Z)
• Quantum Simulation of Bound State Scattering [0.0]
  We present a strategy to excite wavepackets of the interacting theory directly from the vacuum of the interacting theory. This is the first step towards digital quantum simulation of scattering of bound states.
  arXiv  Detail & Related papers  (2023-05-12T18:00:01Z)
• Importance sampling for stochastic quantum simulations [68.8204255655161]
  We introduce the qDrift protocol, which builds random product formulas by sampling from the Hamiltonian according to the coefficients. We show that the simulation cost can be reduced while achieving the same accuracy, by considering the individual simulation cost during the sampling stage. Results are confirmed by numerical simulations performed on a lattice nuclear effective field theory.
  arXiv  Detail & Related papers  (2022-12-12T15:06:32Z)
• The vacuum provides quantum advantage to otherwise simulatable architectures [49.1574468325115]
  We consider a computational model composed of ideal Gottesman-Kitaev-Preskill stabilizer states. We provide an algorithm to calculate the probability density function of the measurement outcomes.
  arXiv  Detail & Related papers  (2022-05-19T18:03:17Z)
• Efficient construction of tensor-network representations of many-body Gaussian states [59.94347858883343]
  We present a procedure to construct tensor-network representations of many-body Gaussian states efficiently and with a controllable error. These states include the ground and thermal states of bosonic and fermionic quadratic Hamiltonians, which are essential in the study of quantum many-body systems.
  arXiv  Detail & Related papers  (2020-08-12T11:30:23Z)
• State preparation and measurement in a quantum simulation of the O(3) sigma model [65.01359242860215]
  We show that fixed points of the non-linear O(3) sigma model can be reproduced near a quantum phase transition of a spin model with just two qubits per lattice site. We apply Trotter methods to obtain results for the complexity of adiabatic ground state preparation in both the weak-coupling and quantum-critical regimes. We present and analyze a quantum algorithm based on non-unitary randomized simulation methods.
  arXiv  Detail & Related papers  (2020-06-28T23:44:12Z)
• Simulation of Thermal Relaxation in Spin Chemistry Systems on a Quantum Computer Using Inherent Qubit Decoherence [53.20999552522241]
  We seek to take advantage of qubit decoherence as a resource in simulating the behavior of real world quantum systems. We present three methods for implementing the thermal relaxation. We find excellent agreement between our results, experimental data, and the theoretical prediction.
  arXiv  Detail & Related papers  (2020-01-03T11:48:11Z)
• Efficient classical simulation of random shallow 2D quantum circuits [104.50546079040298]
  Random quantum circuits are commonly viewed as hard to simulate classically. We show that approximate simulation of typical instances is almost as hard as exact simulation. We also conjecture that sufficiently shallow random circuits are efficiently simulable more generally.
  arXiv  Detail & Related papers  (2019-12-31T19:00:00Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.