Divide-and-conquer variational quantum algorithms for large-scale
electronic structure simulations
- URL: http://arxiv.org/abs/2208.14789v1
- Date: Wed, 31 Aug 2022 12:07:53 GMT
- Title: Divide-and-conquer variational quantum algorithms for large-scale
electronic structure simulations
- Authors: Huan Ma, Yi Fan, Jie Liu, Honghui Shang, Zhenyu Li and Jinlong Yang
- Abstract summary: Two popular divide-and-conquer schemes are employed to divide complicated problems into many small parts that are easy to implement on near-term quantum computers.
Pilot applications of these methods to systems consisting of tens of atoms are performed with adaptive VQE algorithms.
- Score: 8.97527581134124
- License: http://creativecommons.org/licenses/by/4.0/
- Abstract: Exploring the potential application of quantum computers in material design
and drug discovery has attracted a lot of interest in the age of quantum
computing. However, the quantum resource requirement for solving practical
electronic structure problems are far beyond the capacity of near-term quantum
devices. In this work, we integrate the divide-and-conquer (DC) approaches into
the variational quantum eigensolver (VQE) for large-scale quantum computational
chemistry simulations. Two popular divide-and-conquer schemes, including
many-body expansion~(MBE) fragmentation theory and density matrix embedding
theory~(DMET), are employed to divide complicated problems into many small
parts that are easy to implement on near-term quantum computers. Pilot
applications of these methods to systems consisting of tens of atoms are
performed with adaptive VQE algorithms. This work should encourage further
studies of using the philosophy of DC to solve electronic structure problems on
quantum computers.
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 computation of conical intersections on a programmable superconducting quantum processor [10.064448021157139]
Conical intersections (CIs) are pivotal in many photochemical processes.
We present the first successful realization of a hybrid quantum-classical state-average complete active space self-consistent method.
arXiv Detail & Related papers (2024-02-20T04:12:40Z) - Quantum algorithms: A survey of applications and end-to-end complexities [90.05272647148196]
The anticipated applications of quantum computers span across science and industry.
We present a survey of several potential application areas of quantum algorithms.
We outline the challenges and opportunities in each area in an "end-to-end" fashion.
arXiv Detail & Related papers (2023-10-04T17:53:55Z) - Optimal Stochastic Resource Allocation for Distributed Quantum Computing [50.809738453571015]
We propose a resource allocation scheme for distributed quantum computing (DQC) based on programming to minimize the total deployment cost for quantum resources.
The evaluation demonstrates the effectiveness and ability of the proposed scheme to balance the utilization of quantum computers and on-demand quantum computers.
arXiv Detail & Related papers (2022-09-16T02:37:32Z) - Extending the reach of quantum computing for materials science with
machine learning potentials [0.3352108528371308]
We propose a strategy to extend the scope of quantum computational methods to large scale simulations using a machine learning potential.
We investigate the trainability of a machine learning potential selecting various sources of noise.
We construct the first machine learning potential from data computed on actual IBM Quantum processors for a hydrogen molecule.
arXiv Detail & Related papers (2022-03-14T15:59:30Z) - 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) - Emerging quantum computing algorithms for quantum chemistry [0.0]
Digital quantum computers provide a computational framework for solving the Schr"odinger equation.
Quantum computing algorithms for the quantum simulation of these systems have recently witnessed remarkable growth.
arXiv Detail & Related papers (2021-09-07T05:18:25Z) - On exploring the potential of quantum auto-encoder for learning quantum systems [60.909817434753315]
We devise three effective QAE-based learning protocols to address three classically computational hard learning problems.
Our work sheds new light on developing advanced quantum learning algorithms to accomplish hard quantum physics and quantum information processing tasks.
arXiv Detail & Related papers (2021-06-29T14:01:40Z) - 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) - Simulating quantum chemistry in the seniority-zero space on qubit-based
quantum computers [0.0]
We combine the so-called seniority-zero, or paired-electron, approximation of computational quantum chemistry with techniques for simulating molecular chemistry on gate-based quantum computers.
We show that using the freed-up quantum resources for increasing the basis set can lead to more accurate results and reductions in the necessary number of quantum computing runs.
arXiv Detail & Related papers (2020-01-31T19:44:37Z)
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.