Exponential quantum advantages in learning quantum observables from classical data

• URL: http://arxiv.org/abs/2405.02027v1
• Date: Fri, 3 May 2024 11:58:43 GMT
• Title: Exponential quantum advantages in learning quantum observables from classical data
• Authors: Riccardo Molteni, Casper Gyurik, Vedran Dunjko,
• Abstract summary: We prove quantum advantages for the physically relevant task of learning quantum observables from classical data. Our results shed light on the utility of quantum computers for machine learning problems in the domain of quantum many body physics.
• Score: 1.9662978733004604
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Quantum computers are believed to bring computational advantages in simulating quantum many body systems. However, recent works have shown that classical machine learning algorithms are able to predict numerous properties of quantum systems with classical data. Despite various examples of learning tasks with provable quantum advantages being proposed, they all involve cryptographic functions and do not represent any physical scenarios encountered in laboratory settings. In this paper we prove quantum advantages for the physically relevant task of learning quantum observables from classical (measured out) data. We consider two types of observables: first we prove a learning advantage for linear combinations of Pauli strings, then we extend the result for the broader case of unitarily parametrized observables. For each type of observable we delineate the boundaries that separate physically relevant tasks which classical computers can solve using data from quantum measurements, from those where a quantum computer is still necessary for data analysis. Our results shed light on the utility of quantum computers for machine learning problems in the domain of quantum many body physics, thereby suggesting new directions where quantum learning improvements may emerge.

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)
• 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)
• A Quick Introduction to Quantum Machine Learning for Non-Practitioners [0.0]
  The paper covers basic quantum mechanics principles, including superposition, phase space, and entanglement. It also reviews classical deep learning concepts, such as artificial neural networks, gradient descent, and backpropagation. An example problem demonstrates the potential advantages of quantum neural networks.
  arXiv  Detail & Related papers  (2024-02-22T16:48:17Z)
• 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)
• Classical Verification of Quantum Learning [42.362388367152256]
  We develop a framework for classical verification of quantum learning. We propose a new quantum data access model that we call "mixture-of-superpositions" quantum examples. Our results demonstrate that the potential power of quantum data for learning tasks, while not unlimited, can be utilized by classical agents.
  arXiv  Detail & Related papers  (2023-06-08T00:31:27Z)
• 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 advantage in learning from experiments [14.539369998376843]
  An experimental setup that transduces data from a physical system to a stable quantum memory could have significant advantages. We prove that, in various tasks, quantum machines can learn from exponentially fewer experiments than those required in conventional experiments.
  arXiv  Detail & Related papers  (2021-12-01T19:04:44Z)
• Information Scrambling in Computationally Complex Quantum Circuits [56.22772134614514]
  We experimentally investigate the dynamics of quantum scrambling on a 53-qubit quantum processor. We show that while operator spreading is captured by an efficient classical model, operator entanglement requires exponentially scaled computational resources to simulate.
  arXiv  Detail & Related papers  (2021-01-21T22:18:49Z)
• Power of data in quantum machine learning [2.1012068875084964]
  We show that some problems that are classically hard to compute can be easily predicted by classical machines learning from data. We propose a projected quantum model that provides a simple and rigorous quantum speed-up for a learning problem in the fault-tolerant regime.
  arXiv  Detail & Related papers  (2020-11-03T19:00:01Z)
• Universal Approximation Property of Quantum Machine Learning Models in Quantum-Enhanced Feature Spaces [0.0]
  We study the capability of quantum feature maps in the classification of disjoint regions. Our work enables an important theoretical analysis to ensure that machine learning algorithms based on quantum feature maps can handle a broad class of machine learning tasks.
  arXiv  Detail & Related papers  (2020-09-01T09:09:29Z)
• Machine learning transfer efficiencies for noisy quantum walks [62.997667081978825]
  We show that the process of finding requirements on both a graph type and a quantum system coherence can be automated. The automation is done by using a convolutional neural network of a particular type that learns to understand with which network and under which coherence requirements quantum advantage is possible. Our results are of importance for demonstration of advantage in quantum experiments and pave the way towards automating scientific research and discoveries.
  arXiv  Detail & Related papers  (2020-01-15T18:36:53Z)

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.