Quantum Simulation of Bound State Scattering
- URL: http://arxiv.org/abs/2305.07692v3
- Date: Wed, 17 Apr 2024 16:56:37 GMT
- Title: Quantum Simulation of Bound State Scattering
- Authors: Matteo Turco, Gonçalo M. Quinta, João Seixas, Yasser Omar,
- Abstract summary: 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.
- Score: 0.0
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: The last few years have seen rapid development of applications of quantum computation to quantum field theory. The first algorithms for quantum simulation of scattering have been proposed in the context of scalar and fermionic theories, requiring thousands of logical qubits. These algorithms are not suitable to simulate scattering of incoming bound states, as the initial-state preparation relies typically on adiabatically transforming wavepackets of the free theory into wavepackets of the interacting theory. In this paper we present a strategy to excite wavepackets of the interacting theory directly from the vacuum of the interacting theory, allowing the preparation of states of composite particles. This is the first step towards digital quantum simulation of scattering of bound states. The approach is based on the Haag-Ruelle scattering theory, which provides a way to construct creation and annihilation operators of a theory in a full, nonperturbative framework. We provide a quantum algorithm requiring a number of ancillary qubits that is logarithmic in the size of the wavepackets, and with a success probability vanishing at most like a polynomial in the lattice parameters and the energy of the wavepacket. The gate complexity for a single iteration of the circuit is equivalent to that of a time evolution for a fixed time. Furthermore, we propose a complete protocol for scattering simulation using this algorithm. We study its efficiency and find improvements with respect to previous algorithms in the literature.
Related papers
- Scattering wave packets of hadrons in gauge theories: Preparation on a
quantum computer [0.0]
In this work, we construct a wave-packet creation operator directly in the interacting theory to circumvent adiabatic evolution.
We show that interacting mesonic wave packets can be created efficiently and accurately using digital quantum algorithms.
The fidelities agree well with classical benchmark calculations after employing a simple symmetry-based noise-mitigation technique.
arXiv Detail & Related papers (2024-02-01T18:30:10Z) - A Gell-Mann & Low Theorem Perspective on Quantum Computing: New Paradigm
for Designing Quantum Algorithm [7.680510419135912]
This work offers a new conceptual perspective for variational quantum computing based upon the Gell-Mann & Low theorem.
We employ an innovative mathematical technique to explicitly unfold the normalized S-matrix, thereby enabling the systematic reconstruction of the Dyson series on a quantum computer, order by order.
Our simulations indicate that this method not only successfully recovers the Dyson series but also exhibits robust and stable convergence.
arXiv Detail & Related papers (2023-11-30T06:18:24Z) - Quantum Parallelized Variational Quantum Eigensolvers for Excited States [0.0]
Calculating excited-state properties of molecules and solids is one of the main computational challenges of modern electronic structure theory.
By combining and advancing recent ideas from the field of quantum computing we propose a more effective variational quantum eigensolver.
arXiv Detail & Related papers (2023-06-20T18:53:09Z) - A hybrid quantum-classical algorithm for multichannel quantum scattering
of atoms and molecules [62.997667081978825]
We propose a hybrid quantum-classical algorithm for solving the Schr"odinger equation for atomic and molecular collisions.
The algorithm is based on the $S$-matrix version of the Kohn variational principle, which computes the fundamental scattering $S$-matrix.
We show how the algorithm could be scaled up to simulate collisions of large polyatomic molecules.
arXiv Detail & Related papers (2023-04-12T18:10:47Z) - Simulating the Mott transition on a noisy digital quantum computer via
Cartan-based fast-forwarding circuits [62.73367618671969]
Dynamical mean-field theory (DMFT) maps the local Green's function of the Hubbard model to that of the Anderson impurity model.
Quantum and hybrid quantum-classical algorithms have been proposed to efficiently solve impurity models.
This work presents the first computation of the Mott phase transition using noisy digital quantum hardware.
arXiv Detail & Related papers (2021-12-10T17:32:15Z) - Nearly optimal quantum algorithm for generating the ground state of a
free quantum field theory [0.0]
We devise a quasilinear quantum algorithm for generating an approximation for the ground state of a quantum field theory.
Our algorithm delivers a super-quadratic speedup over the state-of-the-art quantum algorithm for ground-state generation.
arXiv Detail & Related papers (2021-10-12T02:48:46Z) - Quantum Simulation of Conformal Field Theory [77.34726150561087]
We describe a quantum algorithm to simulate the dynamics of conformal field theories.
A full analysis of the approximation errors suggests near-term applicability.
arXiv Detail & Related papers (2021-09-29T06:44:33Z) - Towards a variational Jordan-Lee-Preskill quantum algorithm [9.548089725859297]
We formulate the theory of (time-dependent) variational quantum simulation, explicitly designed for quantum simulation of quantum field theory.
We develop hybrid quantum-classical algorithms for crucial ingredients in particle scattering experiments, including encoding, state preparation, and time evolution.
arXiv Detail & Related papers (2021-09-12T16:04:44Z) - Quantum algorithms for quantum dynamics: A performance study on the
spin-boson model [68.8204255655161]
Quantum algorithms for quantum dynamics simulations are traditionally based on implementing a Trotter-approximation of the time-evolution operator.
variational quantum algorithms have become an indispensable alternative, enabling small-scale simulations on present-day hardware.
We show that, despite providing a clear reduction of quantum gate cost, the variational method in its current implementation is unlikely to lead to a quantum advantage.
arXiv Detail & Related papers (2021-08-09T18:00:05Z) - Fixed Depth Hamiltonian Simulation via Cartan Decomposition [59.20417091220753]
We present a constructive algorithm for generating quantum circuits with time-independent depth.
We highlight our algorithm for special classes of models, including Anderson localization in one dimensional transverse field XY model.
In addition to providing exact circuits for a broad set of spin and fermionic models, our algorithm provides broad analytic and numerical insight into optimal Hamiltonian simulations.
arXiv Detail & Related papers (2021-04-01T19:06:00Z) - Quantum simulation of gauge theory via orbifold lattice [47.28069960496992]
We propose a new framework for simulating $textU(k)$ Yang-Mills theory on a universal quantum computer.
We discuss the application of our constructions to computing static properties and real-time dynamics of Yang-Mills theories.
arXiv Detail & Related papers (2020-11-12T18:49:11Z)
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.