Ab initio nuclear structure via quantum adiabatic algorithm
- URL: http://arxiv.org/abs/2105.08910v1
- Date: Wed, 19 May 2021 03:51:17 GMT
- Title: Ab initio nuclear structure via quantum adiabatic algorithm
- Authors: Weijie Du, James P. Vary, Xingbo Zhao, and Wei Zuo
- Abstract summary: We explore the application of the quantum algorithm of adiabatic state preparation with quantum phase estimation in ab initio nuclear structure theory.
We focus on solving the low-lying spectra (including both the ground and excited states) of simple nuclear systems.
- Score: 0.7449724123186384
- License: http://creativecommons.org/licenses/by/4.0/
- Abstract: Background: Solving nuclear many-body problems with an ab initio approach is
widely recognized as a computationally challenging problem. Quantum computers
offer a promising path to address this challenge. There are urgent needs to
develop quantum algorithms for this purpose.
Objective: In this work, we explore the application of the quantum algorithm
of adiabatic state preparation with quantum phase estimation in ab initio
nuclear structure theory. We focus on solving the low-lying spectra (including
both the ground and excited states) of simple nuclear systems.
Ideas: The efficiency of this algorithm is hindered by the emergence of small
energy gaps (level crossings) during the adiabatic evolution. In order to
improve the efficiency, we introduce techniques to avoid level crossings: 1) by
suitable design of the reference Hamiltonian; 2) by insertions of perturbation
terms to modify the adiabatic path.
Results: We illustrate this algorithm by solving the deuteron ground state
energy and the spectrum of the deuteron bounded in a harmonic oscillator trap
implementing the IBM Qiskit quantum simulator. The quantum results agree well
the classical results obtained by matrix diagonalization.
Outlook: With our improvements to the efficiency, this algorithm provides a
promising tool for investigating the low-lying spectra of complex nuclei on
future quantum computers.
Related papers
- Quantum Computation of Electronic Structure with Projector Augmented-Wave Method and Plane Wave Basis Set [3.087342164520494]
We present an implementation of the PAW with plane waves for quantum computation of the energy.
We provide the quantum resources for energy estimation of a nitrogen-vacancy defect centre in diamond.
arXiv Detail & Related papers (2024-08-06T12:56:10Z) - Quantum quench dynamics as a shortcut to adiabaticity [31.114245664719455]
We develop and test a quantum algorithm in which the incorporation of a quench step serves as a remedy to the diverging adiabatic timescale.
Our experiments show that this approach significantly outperforms the adiabatic algorithm.
arXiv Detail & Related papers (2024-05-31T17:07:43Z) - Quantum Subroutine for Variance Estimation: Algorithmic Design and Applications [80.04533958880862]
Quantum computing sets the foundation for new ways of designing algorithms.
New challenges arise concerning which field quantum speedup can be achieved.
Looking for the design of quantum subroutines that are more efficient than their classical counterpart poses solid pillars to new powerful quantum algorithms.
arXiv Detail & Related papers (2024-02-26T09:32:07Z) - Feedback-based Quantum Algorithm Inspired by Counterdiabatic Driving [0.32985979395737786]
We propose a protocol that uses ideas from quantum Lyapunov control and the counterdiabatic driving protocol.
We apply our algorithm to prepare ground states in one-dimensional quantum Ising spin chains.
arXiv Detail & Related papers (2024-01-27T05:41:32Z) - Hamiltonian Encoding for Quantum Approximate Time Evolution of Kinetic
Energy Operator [2.184775414778289]
The time evolution operator plays a crucial role in the precise computation of chemical experiments on quantum computers.
We have proposed a new encoding method, namely quantum approximate time evolution (QATE) for the quantum implementation of the kinetic energy operator.
arXiv Detail & Related papers (2023-10-05T05:25:38Z) - Quantum Annealing for Single Image Super-Resolution [86.69338893753886]
We propose a quantum computing-based algorithm to solve the single image super-resolution (SISR) problem.
The proposed AQC-based algorithm is demonstrated to achieve improved speed-up over a classical analog while maintaining comparable SISR accuracy.
arXiv Detail & Related papers (2023-04-18T11:57:15Z) - Feedback-based quantum algorithms for ground state preparation [0.0]
Ground state properties of quantum many-body systems are a subject of interest across chemistry, materials science, and physics.
Variational quantum algorithms are one class of ground state algorithms that has received significant attention in recent years.
We develop formulations of feedback-based quantum algorithms for ground state preparation.
arXiv Detail & Related papers (2023-03-06T06:27:59Z) - Reducing the cost of energy estimation in the variational quantum
eigensolver algorithm with robust amplitude estimation [50.591267188664666]
Quantum chemistry and materials is one of the most promising applications of quantum computing.
Much work is still to be done in matching industry-relevant problems in these areas with quantum algorithms that can solve them.
arXiv Detail & Related papers (2022-03-14T16:51:36Z) - 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) - Electronic structure with direct diagonalization on a D-Wave quantum
annealer [62.997667081978825]
This work implements the general Quantum Annealer Eigensolver (QAE) algorithm to solve the molecular electronic Hamiltonian eigenvalue-eigenvector problem on a D-Wave 2000Q quantum annealer.
We demonstrate the use of D-Wave hardware for obtaining ground and electronically excited states across a variety of small molecular systems.
arXiv Detail & Related papers (2020-09-02T22:46:47Z) - An Application of Quantum Annealing Computing to Seismic Inversion [55.41644538483948]
We apply a quantum algorithm to a D-Wave quantum annealer to solve a small scale seismic inversions problem.
The accuracy achieved by the quantum computer is at least as good as that of the classical computer.
arXiv Detail & Related papers (2020-05-06T14:18:44Z)
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.