Ultra-relativistic quark-nucleus scattering on quantum computers
- URL: http://arxiv.org/abs/2404.00819v2
- Date: Mon, 15 Apr 2024 18:56:02 GMT
- Title: Ultra-relativistic quark-nucleus scattering on quantum computers
- Authors: Sihao Wu, Weijie Du, Xingbo Zhao, James P. Vary,
- Abstract summary: We start with an initial problem of the ultra-relativistic quark-nucleus scattering and present an efficient and precise approach to simulate the dynamics on the light front.
We demonstrate our approach with a simple scattering problem and benchmark the results with those from the Trotter algorithm and the classical calculations.
- Score: 0.35998666903987897
- License: http://creativecommons.org/licenses/by/4.0/
- Abstract: Quantum computing provides a promising approach for solving the real-time dynamics of systems consist of quarks and gluons from first-principle calculations that are intractable with classical computers. In this work, we start with an initial problem of the ultra-relativistic quark-nucleus scattering and present an efficient and precise approach to quantum simulate the dynamics on the light front. This approach employs the eigenbasis of the asymptotic scattering system and implements the compact scheme for basis encoding. It exploits the operator structure of the light-front Hamiltonian of the scattering system, which enables the Hamiltonian input scheme that utilizes the quantum Fourier transform for efficiency. It utilizes the truncated Taylor series for the dynamics simulations. The qubit cost of our approach scales logarithmically with the Hilbert space dimension of the scattering system. The gate cost has optimal scaling with the simulation error and near optimal scaling with the simulation time. These scalings make our approach advantageous for large-scale dynamics simulations on future fault-tolerant quantum computers. We demonstrate our approach with a simple scattering problem and benchmark the results with those from the Trotter algorithm and the classical calculations, where good agreement between the results is found.
Related papers
- 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) - Scalable Quantum Computation of Highly Excited Eigenstates with Spectral
Transforms [0.76146285961466]
We use the HHL algorithm to prepare excited interior eigenstates of physical Hamiltonians in a variational and targeted manner.
This is enabled by the efficient computation of the expectation values of inverse Hamiltonians on quantum computers.
We detail implementations of this scheme for both fault-tolerant and near-term quantum computers.
arXiv Detail & Related papers (2023-02-13T19:01:02Z) - Simulating Markovian open quantum systems using higher-order series
expansion [1.713291434132985]
We present an efficient quantum algorithm for simulating the dynamics of Markovian open quantum systems.
Our algorithm is conceptually cleaner, and it only uses simple quantum primitives without compressed encoding.
arXiv Detail & Related papers (2022-12-05T06:02:50Z) - 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) - 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) - Continuous-time dynamics and error scaling of noisy highly-entangling
quantum circuits [58.720142291102135]
We simulate a noisy quantum Fourier transform processor with up to 21 qubits.
We take into account microscopic dissipative processes rather than relying on digital error models.
We show that depending on the dissipative mechanisms at play, the choice of input state has a strong impact on the performance of the quantum algorithm.
arXiv Detail & Related papers (2021-02-08T14:55:44Z) - Fast and differentiable simulation of driven quantum systems [58.720142291102135]
We introduce a semi-analytic method based on the Dyson expansion that allows us to time-evolve driven quantum systems much faster than standard numerical methods.
We show results of the optimization of a two-qubit gate using transmon qubits in the circuit QED architecture.
arXiv Detail & Related papers (2020-12-16T21:43:38Z) - Autoregressive Transformer Neural Network for Simulating Open Quantum Systems via a Probabilistic Formulation [5.668795025564699]
We present an approach for tackling open quantum system dynamics.
We compactly represent quantum states with autoregressive transformer neural networks.
Efficient algorithms have been developed to simulate the dynamics of the Liouvillian superoperator.
arXiv Detail & Related papers (2020-09-11T18:00:00Z) - Incoherent quantum algorithm dynamics of an open system with near-term
devices [0.0]
Hybrid quantum-classical algorithms are among the most promising systems to implement quantum computing.
We investigate a quantum dynamics algorithm for the density matrix obeying the von Neumann equation.
We consider the dynamics of the ensemble-averaged of disordered quantum systems.
arXiv Detail & Related papers (2020-08-12T14:22:42Z)
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.