A quantum-classical co-processing protocol towards simulating nuclear reactions on contemporary quantum hardware

• URL: http://arxiv.org/abs/2302.06734v2
• Date: Wed, 27 Sep 2023 01:03:31 GMT
• Title: A quantum-classical co-processing protocol towards simulating nuclear reactions on contemporary quantum hardware
• Authors: Francesco Turro and Trevor Chistolini and Akel Hashim and Yosep Kim and William Livingston and Kyle. A. Wendt and Jonathan L Dubois and Francesco Pederiva and Sofia Quaglioni and David I. Santiago and Irfan Siddiqi
• Abstract summary: We propose a co-processing algorithm for the simulation of real-time dynamics in which the time evolution of the spatial coordinates is carried out on a classical processor. This hybrid algorithm is demonstrated by a quantum simulation of the scattering of two neutrons performed at the Lawrence Berkeley National Laboratory's Advanced Quantum Testbed.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Quantum computers hold great promise for arriving at exact simulations of nuclear dynamical processes (e.g., scattering and reactions) that are paramount to the study of nuclear matter at the limit of stability and to explaining the formation of chemical elements in stars. However, quantum simulations of the unitary (real) time dynamics of fermionic many-body systems require a currently prohibitive number of reliable and long-lived qubits. We propose a co-processing algorithm for the simulation of real-time dynamics in which the time evolution of the spatial coordinates is carried out on a classical processor, while the evolution of the spin degrees of freedom is carried out on a quantum processor. This hybrid algorithm is demonstrated by a quantum simulation of the scattering of two neutrons performed at the Lawrence Berkeley National Laboratory's Advanced Quantum Testbed. We show that, after implementation of error mitigation strategies to improve the accuracy of the algorithm in addition to the use of either circuit compression techniques or tomography as methods to elucidate the onset of decoherence, this initial demonstration validates the principle of the proposed co-processing scheme. We anticipate that a generalization of this present scheme will open the way for (real-time) path integral simulations of nuclear scattering.

Related papers

• Toward end-to-end quantum simulation for protein dynamics [5.65693337062667]
  We systematically investigate end-to-end quantum algorithms for various protein dynamics with effects, such as mechanical forces or noises. For the read-in setting, we design (i) efficient quantum algorithms for initial state preparation, utilizing counter-based random number generator and rejection sampling. For the read-out setting, our algorithms estimate various classical observables, such as energy, low vibration modes, density of states, correlation of displacement, and optimal control of molecular dynamics.
  arXiv  Detail & Related papers  (2024-11-06T15:10:15Z)
• Deep Quantum Circuit Simulations of Low-Energy Nuclear States [51.823503818486394]
  We present advances in high-performance numerical simulations of deep quantum circuits. circuits up to 21 qubits and more than 115,000,000 gates can be efficiently simulated.
  arXiv  Detail & Related papers  (2023-10-26T19:10:58Z)
• Sequential quantum simulation of spin chains with a single circuit QED device [5.841833052422423]
  Quantum simulation of many-body systems in materials science and chemistry are promising application areas for quantum computers. We show how a single-circuit quantum electrodynamics device can be used to simulate the ground state of a highly-entangled quantum many-body spin chain. We demonstrate that the large state space of the cavity can be used to replace multiple qubits in a qubit-only architecture, and could therefore simplify the design of quantum processors for materials simulation.
  arXiv  Detail & Related papers  (2023-08-30T18:00:03Z)
• Probing finite-temperature observables in quantum simulators of spin systems with short-time dynamics [62.997667081978825]
  We show how finite-temperature observables can be obtained with an algorithm motivated from the Jarzynski equality. We show that a finite temperature phase transition in the long-range transverse field Ising model can be characterized in trapped ion quantum simulators.
  arXiv  Detail & Related papers  (2022-06-03T18:00:02Z)
• Variational quantum simulation of the imaginary-time Lyapunov control for accelerating the ground-state preparation [17.802280143175235]
  We first propose a Lyapunov control-inspired strategy to accelerate the well-established imaginary-time method for ground-state preparation. To make the method accessible in the noisy intermediate-scale quantum era, we propose a variational form of the algorithm that could work with shallow quantum circuits.
  arXiv  Detail & Related papers  (2021-12-22T10:40:33Z)
• Spectral density reconstruction with Chebyshev polynomials [77.34726150561087]
  We show how to perform controllable reconstructions of a finite energy resolution with rigorous error estimates. This paves the way for future applications in nuclear and condensed matter physics.
  arXiv  Detail & Related papers  (2021-10-05T15:16:13Z)
• Sampling, rates, and reaction currents through reverse stochastic quantization on quantum computers [0.0]
  We show how to tackle the problem using a suitably quantum computer. We propose a hybrid quantum-classical sampling scheme to escape local minima.
  arXiv  Detail & Related papers  (2021-08-25T18:04:52Z)
• 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)
• Imaginary Time Propagation on a Quantum Chip [50.591267188664666]
  Evolution in imaginary time is a prominent technique for finding the ground state of quantum many-body systems. We propose an algorithm to implement imaginary time propagation on a quantum computer.
  arXiv  Detail & Related papers  (2021-02-24T12:48: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)
• Non-adiabatic molecular quantum dynamics with quantum computers [0.0]
  We propose a quantum algorithm for the simulation of fast non-adiabatic chemical processes. In particular, we introduce a first-quantization method for the potential time evolution of a wavepacket on two harmonic energy surfaces.
  arXiv  Detail & Related papers  (2020-06-16T18:00:22Z)

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.