Solving reaction dynamics with quantum computing algorithms
- URL: http://arxiv.org/abs/2404.00202v2
- Date: Tue, 18 Feb 2025 22:06:54 GMT
- Title: Solving reaction dynamics with quantum computing algorithms
- Authors: Ronen Weiss, Alessandro Baroni, Joseph Carlson, Ionel Stetcu,
- Abstract summary: We study quantum algorithms for response functions, relevant for describing different reactions governed by linear response.
We focus on nuclear-physics applications and consider a qubit-efficient mapping on the lattice, which can efficiently represent the large volumes required for realistic scattering simulations.
- Score: 42.408991654684876
- License:
- Abstract: The description of quantum many-body dynamics is extremely challenging on classical computers, as it can involve many degrees of freedom. On the other hand, the time evolution of quantum states is a natural application for quantum computers that are designed to efficiently perform unitary transformations. In this paper, we study quantum algorithms for response functions, relevant for describing different reactions governed by linear response. We focus on nuclear-physics applications and consider a qubit-efficient mapping on the lattice, which can efficiently represent the large volumes required for realistic scattering simulations. For the case of a contact interaction, we develop an algorithm for time evolution based on the Trotter approximation that scales logarithmically with the lattice size, and is combined with quantum phase estimation. We eventually focus on the nuclear two-body system and a typical response function relevant for electron scattering as an example. We also investigate ground-state preparation and examine the total circuit depth required for a realistic calculation and the hardware noise level required to interpret the signal.
Related papers
- Efficient Learning for Linear Properties of Bounded-Gate Quantum Circuits [63.733312560668274]
Given a quantum circuit containing d tunable RZ gates and G-d Clifford gates, can a learner perform purely classical inference to efficiently predict its linear properties?
We prove that the sample complexity scaling linearly in d is necessary and sufficient to achieve a small prediction error, while the corresponding computational complexity may scale exponentially in d.
We devise a kernel-based learning model capable of trading off prediction error and computational complexity, transitioning from exponential to scaling in many practical settings.
arXiv Detail & Related papers (2024-08-22T08:21:28Z) - Quantum computing of reacting flows via Hamiltonian simulation [13.377719901871027]
We develop the quantum spectral and finite difference methods for simulating reacting flows in periodic and general conditions.
The present quantum computing algorithms offer a one-shot'' solution for a given time without temporal discretization.
arXiv Detail & Related papers (2023-12-13T04:31:49Z) - Quantum benefit of the quantum equation of motion for the strongly
coupled many-body problem [0.0]
The quantum equation of motion (qEOM) is a hybrid quantum-classical algorithm for computing excitation properties of a fermionic many-body system.
We demonstrate explicitly that the qEOM exhibits a quantum benefit due to the independence of the number of required quantum measurements.
arXiv Detail & Related papers (2023-09-18T22:10:26Z) - Recompilation-enhanced simulation of electron-phonon dynamics on IBM
Quantum computers [62.997667081978825]
We consider the absolute resource cost for gate-based quantum simulation of small electron-phonon systems.
We perform experiments on IBM quantum hardware for both weak and strong electron-phonon coupling.
Despite significant device noise, through the use of approximate circuit recompilation we obtain electron-phonon dynamics on current quantum computers comparable to exact diagonalisation.
arXiv Detail & Related papers (2022-02-16T19:00:00Z) - Variational Quantum Computation of Molecular Linear Response Properties
on a Superconducting Quantum Processor [20.69554086981598]
We introduce a pragmatic variational quantum response (VQR) algorithm for response properties, which circumvents the need for deep quantum circuits.
We report the first simulation of linear response properties of molecules including dynamic polarizabilities and absorption spectra on a superconducting quantum processor.
arXiv Detail & Related papers (2022-01-07T12:24:03Z) - 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) - Quantum Markov Chain Monte Carlo with Digital Dissipative Dynamics on
Quantum Computers [52.77024349608834]
We develop a digital quantum algorithm that simulates interaction with an environment using a small number of ancilla qubits.
We evaluate the algorithm by simulating thermal states of the transverse Ising model.
arXiv Detail & Related papers (2021-03-04T18:21:00Z) - Information Scrambling in Computationally Complex Quantum Circuits [56.22772134614514]
We experimentally investigate the dynamics of quantum scrambling on a 53-qubit quantum processor.
We show that while operator spreading is captured by an efficient classical model, operator entanglement requires exponentially scaled computational resources to simulate.
arXiv Detail & Related papers (2021-01-21T22:18:49Z) - 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)
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.