An Algorithm for Quantum Computation of Particle Decays
- URL: http://arxiv.org/abs/2007.04447v2
- Date: Wed, 7 Oct 2020 18:53:02 GMT
- Title: An Algorithm for Quantum Computation of Particle Decays
- Authors: Anthony Ciavarella
- Abstract summary: A quantum algorithm is developed to calculate decay rates and cross sections using quantum resources that scalely in the system size.
A $0+1$ dimensional implementation of this method is demonstrated on IBM's superconducting quantum hardware.
- Score: 0.0
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: A quantum algorithm is developed to calculate decay rates and cross sections
using quantum resources that scale polynomially in the system size assuming
similar scaling for state preparation and time evolution. This is done by
computing finite-volume one- and two-particle Green's functions on the quantum
hardware. Particle decay rates and two particle scattering cross sections are
extracted from the imaginary parts of the Green's function. A $0+1$ dimensional
implementation of this method is demonstrated on IBM's superconducting quantum
hardware for the decay of a heavy scalar particle to a pair of light scalars.
Related papers
- The curse of random quantum data [62.24825255497622]
We quantify the performances of quantum machine learning in the landscape of quantum data.
We find that the training efficiency and generalization capabilities in quantum machine learning will be exponentially suppressed with the increase in qubits.
Our findings apply to both the quantum kernel method and the large-width limit of quantum neural networks.
arXiv Detail & Related papers (2024-08-19T12:18:07Z) - Elastic scattering on a quantum computer [0.0]
We calculate the two-particle elastic scattering phase shift for a short-ranged interaction on a quantum computer.
Schmidt decomposition is used to reduce quantum circuits nominally requiring tens of qubits to 2-qubit circuits.
arXiv Detail & Related papers (2024-06-13T15:31:38Z) - Parallel Quantum Computing Simulations via Quantum Accelerator Platform Virtualization [44.99833362998488]
We present a model for parallelizing simulation of quantum circuit executions.
The model can take advantage of its backend-agnostic features, enabling parallel quantum circuit execution over any target backend.
arXiv Detail & Related papers (2024-06-05T17:16:07Z) - Quantum Tensor Product Decomposition from Choi State Tomography [0.0]
We present an algorithm for unbalanced partitions into a small subsystem and a large one (the environment) to compute the tensor product decomposition of a unitary.
This quantum algorithm may be used to make predictions about operator non-locality, effective open quantum dynamics on a subsystem, as well as for finding low-rank approximations and low-depth compilations of quantum circuit unitaries.
arXiv Detail & Related papers (2024-02-07T16:36:47Z) - Variational-quantum-eigensolver-inspired optimization for spin-chain work extraction [39.58317527488534]
Energy extraction from quantum sources is a key task to develop new quantum devices such as quantum batteries.
One of the main issues to fully extract energy from the quantum source is the assumption that any unitary operation can be done on the system.
We propose an approach to optimize the extractable energy inspired by the variational quantum eigensolver (VQE) algorithm.
arXiv Detail & Related papers (2023-10-11T15:59:54Z) - Quantum algorithm for imaginary-time Green's functions [0.0]
We present a hybrid quantum-classical algorithm to calculate the imaginary-time one-particle Green's function.
The proposed algorithm combines variational quantum eigensolver and quantum subspace expansion to calculate Green's function.
arXiv Detail & Related papers (2023-09-18T16:28:11Z) - Calculating the many-body density of states on a digital quantum
computer [58.720142291102135]
We implement a quantum algorithm to perform an estimation of the density of states on a digital quantum computer.
We use our algorithm to estimate the density of states of a non-integrable Hamiltonian on the Quantinuum H1-1 trapped ion chip for a controlled register of 18bits.
arXiv Detail & Related papers (2023-03-23T17:46:28Z) - One-particle Green's functions from the quantum equation of motion
algorithm [0.0]
We introduce a novel near-term quantum algorithm for computing one-particle Green's functions via their Lehmann representation.
We demonstrate the validity of the present proposal by computing the Green's function of a two-site Fermi-Hubbard model on a IBM quantum processor.
arXiv Detail & Related papers (2022-01-05T21:13:19Z) - Efficient criteria of quantumness for a large system of qubits [58.720142291102135]
We discuss the dimensionless combinations of basic parameters of large, partially quantum coherent systems.
Based on analytical and numerical calculations, we suggest one such number for a system of qubits undergoing adiabatic evolution.
arXiv Detail & Related papers (2021-08-30T23:50:05Z) - 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) - Scattering in the Ising Model Using Quantum Lanczos Algorithm [0.32228025627337864]
We simulate one-particle propagation and two-particle scattering in the one-dimensional transverse Ising model for 3 and 4 spatial sites on a quantum computer.
Results enable us to compute one- and two-particle transition amplitudes, particle numbers for spatial sites, and the transverse magnetization as functions of time.
arXiv Detail & Related papers (2020-08-20T04:05:52Z)
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.