Extending the reach of quantum computing for materials science with
machine learning potentials
- URL: http://arxiv.org/abs/2203.07219v1
- Date: Mon, 14 Mar 2022 15:59:30 GMT
- Title: Extending the reach of quantum computing for materials science with
machine learning potentials
- Authors: Julian Schuhmacher, Guglielmo Mazzola, Francesco Tacchino, Olga
Dmitriyeva, Tai Bui, Shanshan Huang, Ivano Tavernelli
- Abstract summary: 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.
- Score: 0.3352108528371308
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: Solving electronic structure problems represents a promising field of
application for quantum computers. Currently, much effort has been spent in
devising and optimizing quantum algorithms for quantum chemistry problems
featuring up to hundreds of electrons. While quantum algorithms can in
principle outperform their classical equivalents, the polynomially scaling
runtime, with the number of constituents, can still prevent quantum simulations
of large scale systems. We propose a strategy to extend the scope of quantum
computational methods to large scale simulations using a machine learning
potential, trained on quantum simulation data. The challenge of applying
machine learning potentials in today's quantum setting arises from the several
sources of noise affecting the quantum computations of electronic energies and
forces. We investigate the trainability of a machine learning potential
selecting various sources of noise: statistical, optimization and hardware
noise.Finally, we construct the first machine learning potential from data
computed on actual IBM Quantum processors for a hydrogen molecule. This already
would allow us to perform arbitrarily long and stable molecular dynamics
simulations, outperforming all current quantum approaches to molecular dynamics
and structure optimization.
Related papers
- Application of Large Language Models to Quantum State Simulation [0.11666234644810894]
Currently, various quantum simulators provide powerful tools for researchers, but simulating quantum evolution with these simulators often incurs high time costs.
This paper details the process of constructing 1-qubit and 2-qubit quantum simulator models, extending to multiple qubits, and ultimately implementing a 3-qubit example.
Our study demonstrates that LLMs can effectively learn and predict the evolution patterns among quantum bits, with minimal error compared to the theoretical output states.
arXiv Detail & Related papers (2024-10-09T07:23:13Z) - 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) - The curse of random quantum data [62.24825255497622]
We quantify the performances of quantum machine learning in the landscape of quantum data.
We find that the training efficiency and generalization capabilities in quantum machine learning will be exponentially suppressed with the increase in qubits.
Our findings apply to both the quantum kernel method and the large-width limit of quantum neural networks.
arXiv Detail & Related papers (2024-08-19T12:18:07Z) - Quantum Digital Simulation of Cavity Quantum Electrodynamics: Insights from Superconducting and Trapped Ion Quantum Testbeds [0.016994625126740815]
We present an early exploration of the potential for quantum computers to efficiently investigate open CQED physics.
Our simulations make use of a recent quantum algorithm that maps the dynamics of a singly excited open Tavis-Cummings model containing $N$ atoms.
By applying technology-specific transpilation and error mitigation techniques, we minimize the impact of gate errors, noise, and decoherence in each hardware platform.
arXiv Detail & Related papers (2024-04-05T02:25:49Z) - Quantum data learning for quantum simulations in high-energy physics [55.41644538483948]
We explore the applicability of quantum-data learning to practical problems in high-energy physics.
We make use of ansatz based on quantum convolutional neural networks and numerically show that it is capable of recognizing quantum phases of ground states.
The observation of non-trivial learning properties demonstrated in these benchmarks will motivate further exploration of the quantum-data learning architecture in high-energy physics.
arXiv Detail & Related papers (2023-06-29T18:00:01Z) - Quantum Machine Learning: from physics to software engineering [58.720142291102135]
We show how classical machine learning approach can help improve the facilities of quantum computers.
We discuss how quantum algorithms and quantum computers may be useful for solving classical machine learning tasks.
arXiv Detail & Related papers (2023-01-04T23:37:45Z) - A Scalable Approach to Quantum Simulation via Projection-based Embedding [0.0]
We describe a new and chemically intuitive approach that permits a subdomain of the electronic structure of a molecule to be calculated accurately on a quantum device.
We demonstrate that our method produces improved results for molecules that cannot be simulated fully on quantum computers but which can be resolved classically at a lower level of approximation.
arXiv Detail & Related papers (2022-03-02T14:27:44Z) - 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) - 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) - Quantum computation of silicon electronic band structure [0.0]
We show that unprecedented methods used in quantum chemistry, designed to simulate molecules on quantum processors, can be extended to calculate properties of periodic solids.
In particular, we present minimal depth circuits implementing the variational quantum eigensolver algorithm and successfully use it to compute the band structure of silicon on a quantum machine for the first time.
arXiv Detail & Related papers (2020-06-06T07:45:06Z) - 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.