Provably efficient machine learning for quantum many-body problems
- URL: http://arxiv.org/abs/2106.12627v1
- Date: Wed, 23 Jun 2021 18:52:44 GMT
- Title: Provably efficient machine learning for quantum many-body problems
- Authors: Hsin-Yuan Huang, Richard Kueng, Giacomo Torlai, Victor V. Albert, John
Preskill
- Abstract summary: We prove that classical machine learning algorithms can efficiently predict ground state properties of gapped Hamiltonians in finite spatial dimensions.
We also prove that classical ML algorithms can efficiently classify a wide range of quantum phases of matter.
- Score: 6.684752451476642
- License: http://creativecommons.org/licenses/by/4.0/
- Abstract: Classical machine learning (ML) provides a potentially powerful approach to
solving challenging quantum many-body problems in physics and chemistry.
However, the advantages of ML over more traditional methods have not been
firmly established. In this work, we prove that classical ML algorithms can
efficiently predict ground state properties of gapped Hamiltonians in finite
spatial dimensions, after learning from data obtained by measuring other
Hamiltonians in the same quantum phase of matter. In contrast, under widely
accepted complexity theory assumptions, classical algorithms that do not learn
from data cannot achieve the same guarantee. We also prove that classical ML
algorithms can efficiently classify a wide range of quantum phases of matter.
Our arguments are based on the concept of a classical shadow, a succinct
classical description of a many-body quantum state that can be constructed in
feasible quantum experiments and be used to predict many properties of the
state. Extensive numerical experiments corroborate our theoretical results in a
variety of scenarios, including Rydberg atom systems, 2D random Heisenberg
models, symmetry-protected topological phases, and topologically ordered
phases.
Related papers
- Separable Power of Classical and Quantum Learning Protocols Through the Lens of No-Free-Lunch Theorem [70.42372213666553]
The No-Free-Lunch (NFL) theorem quantifies problem- and data-independent generalization errors regardless of the optimization process.
We categorize a diverse array of quantum learning algorithms into three learning protocols designed for learning quantum dynamics under a specified observable.
Our derived NFL theorems demonstrate quadratic reductions in sample complexity across CLC-LPs, ReQu-LPs, and Qu-LPs.
We attribute this performance discrepancy to the unique capacity of quantum-related learning protocols to indirectly utilize information concerning the global phases of non-orthogonal quantum states.
arXiv Detail & Related papers (2024-05-12T09:05:13Z) - Machine learning on quantum experimental data toward solving quantum
many-body problems [0.0]
We demonstrate the successful implementation of classical machine learning algorithms for systems with up to 44 qubits.
We extend the applicability of the hybrid approach to problems of interest in many-body physics.
arXiv Detail & Related papers (2023-10-30T10:25:59Z) - 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) - Quantum variational learning for entanglement witnessing [0.0]
This work focuses on the potential implementation of quantum algorithms allowing to properly classify quantum states defined over a single register of $n$ qubits.
We exploit the notion of "entanglement witness", i.e., an operator whose expectation values allow to identify certain specific states as entangled.
We made use of Quantum Neural Networks (QNNs) in order to successfully learn how to reproduce the action of an entanglement witness.
arXiv Detail & Related papers (2022-05-20T20:14:28Z) - Theory of Quantum Generative Learning Models with Maximum Mean
Discrepancy [67.02951777522547]
We study learnability of quantum circuit Born machines (QCBMs) and quantum generative adversarial networks (QGANs)
We first analyze the generalization ability of QCBMs and identify their superiorities when the quantum devices can directly access the target distribution.
Next, we prove how the generalization error bound of QGANs depends on the employed Ansatz, the number of qudits, and input states.
arXiv Detail & Related papers (2022-05-10T08:05:59Z) - Entanglement Forging with generative neural network models [0.0]
We show that a hybrid quantum-classical variational ans"atze can forge entanglement to lower quantum resource overhead.
The method is efficient in terms of the number of measurements required to achieve fixed precision on expected values of observables.
arXiv Detail & Related papers (2022-05-02T14:29:17Z) - Experimental quantum state measurement with classical shadows [5.455606108893398]
A crucial subroutine for various quantum computing and communication algorithms is to efficiently extract different classical properties of quantum states.
We show how to project the quantum state into classical shadows and simultaneously predict $M$ different functions of a state with only $mathcalO(log M)$ measurements.
Our experiment verifies the efficacy of exploiting (derandomized) classical shadows and sheds light on efficient quantum computing with noisy intermediate-scale quantum hardware.
arXiv Detail & Related papers (2021-06-18T15:42:03Z) - From a quantum theory to a classical one [117.44028458220427]
We present and discuss a formal approach for describing the quantum to classical crossover.
The method was originally introduced by L. Yaffe in 1982 for tackling large-$N$ quantum field theories.
arXiv Detail & Related papers (2020-04-01T09:16:38Z) - Probing the Universality of Topological Defect Formation in a Quantum
Annealer: Kibble-Zurek Mechanism and Beyond [46.39654665163597]
We report on experimental tests of topological defect formation via the one-dimensional transverse-field Ising model.
We find that the quantum simulator results can indeed be explained by the KZM for open-system quantum dynamics with phase-flip errors.
This implies that the theoretical predictions of the generalized KZM theory, which assumes isolation from the environment, applies beyond its original scope to an open system.
arXiv Detail & Related papers (2020-01-31T02:55:35Z)
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.