Quantum Solver of Contracted Eigenvalue Equations for Scalable Molecular
Simulations on Quantum Computing Devices
- URL: http://arxiv.org/abs/2004.11416v1
- Date: Thu, 23 Apr 2020 18:35:26 GMT
- Title: Quantum Solver of Contracted Eigenvalue Equations for Scalable Molecular
Simulations on Quantum Computing Devices
- Authors: S. E. Smart and D. A. Mazziotti
- Abstract summary: We introduce a quantum solver of contracted eigenvalue equations, the quantum analogue of classical methods for the energies.
We demonstrate the algorithm though computations on both a quantum simulator and two IBM quantum processing units.
- Score: 0.0
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: The accurate computation of ground and excited states of many-fermion quantum
systems is one of the most consequential, contemporary challenges in the
physical and computational sciences whose solution stands to benefit
significantly from the advent of quantum computing devices. Existing
methodologies using phase estimation or variational algorithms have potential
drawbacks such as deep circuits requiring substantial error correction or
non-trivial high-dimensional classical optimization. Here we introduce a
quantum solver of contracted eigenvalue equations, the quantum analogue of
classical methods for the energies and reduced density matrices of ground and
excited states. The solver does not require deep circuits or difficult
classical optimization and achieves an exponential speed-up of the exact
classical algorithms. We demonstrate the algorithm though computations on both
a quantum simulator and two IBM quantum processing units.
Related papers
- Compact quantum algorithms that can potentially maintain quantum advantage for solving time-dependent differential equations [0.0]
We present algorithms for solving time-dependent PDEs governing fluid flow problems.
We build on an idea based on linear combination of unitaries to simulate non-unitary, non-Hermitian quantum systems.
These algorithms lead to low-depth quantum circuits that protect quantum advantage.
arXiv Detail & Related papers (2024-05-16T02:14:58Z) - Scalable Quantum Algorithms for Noisy Quantum Computers [0.0]
This thesis develops two main techniques to reduce the quantum computational resource requirements.
The aim is to scale up application sizes on current quantum processors.
While the main focus of application for our algorithms is the simulation of quantum systems, the developed subroutines can further be utilized in the fields of optimization or machine learning.
arXiv Detail & Related papers (2024-03-01T19:36:35Z) - Towards Quantum Computational Mechanics [1.7201069233638664]
We show how quantum computing can be used to solve representative volume element (RVE) problems in computational homogenisation.
Our quantum RVE solver attains exponential acceleration with respect to classical solvers.
arXiv Detail & Related papers (2023-12-06T12:53:02Z) - 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) - Identification of topological phases using classically-optimized
variational quantum eigensolver [0.6181093777643575]
Variational quantum eigensolver (VQE) is regarded as a promising candidate of hybrid quantum-classical algorithm for quantum computers.
We propose classically-optimized VQE (co-VQE), where the whole process of the optimization is efficiently conducted on a classical computer.
In co-VQE, we only use quantum computers to measure nonlocal quantities after the parameters are optimized.
arXiv Detail & Related papers (2022-02-07T02:26:58Z) - 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) - An Algebraic Quantum Circuit Compression Algorithm for Hamiltonian
Simulation [55.41644538483948]
Current generation noisy intermediate-scale quantum (NISQ) computers are severely limited in chip size and error rates.
We derive localized circuit transformations to efficiently compress quantum circuits for simulation of certain spin Hamiltonians known as free fermions.
The proposed numerical circuit compression algorithm behaves backward stable and scales cubically in the number of spins enabling circuit synthesis beyond $mathcalO(103)$ spins.
arXiv Detail & Related papers (2021-08-06T19:38:03Z) - Variational Quantum Optimization with Multi-Basis Encodings [62.72309460291971]
We introduce a new variational quantum algorithm that benefits from two innovations: multi-basis graph complexity and nonlinear activation functions.
Our results in increased optimization performance, two increase in effective landscapes and a reduction in measurement progress.
arXiv Detail & Related papers (2021-06-24T20:16:02Z) - 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) - 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.