REVIEW 7 cited by
Exponential quantum advantages in learning quantum observables from classical data
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
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 a 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. Differently from previous works, we base our classical hardness results on the weaker assumption that $\mathsf{BQP}$ hard processes cannot be simulated by polynomial-size classical circuits and provide a non-trivial quantum learning algorithm. 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.
Forward citations
Cited by 7 Pith papers
-
Provable learning separation for predicting time-evolution of quantum many-body systems
A provable exponential quantum-classical learning separation is established for predicting expectation values of time-evolved quantum states under unknown low-intersection Hamiltonians, assuming BQP ⊄ P/poly.
-
The role of data-induced randomness in quantum machine learning classification tasks
Introduces a class-margin metric connecting data-encoding randomness to quantum classification accuracy, and argues that near-random encodings fundamentally limit performance.
-
Quantum reinforcement learning in dynamic environments
A quantum hybrid RL agent with a dissipation mechanism outlearns a classical agent in a Gridworld with a suddenly changing reward path, for suitable dissipation values.
-
Quantum computing and artificial intelligence: status and perspectives
A broad expert white paper sets a European research agenda for combining quantum computing and AI, spanning quantum machine learning, AI-driven quantum control, and foundational questions.
-
Supervised Quantum Machine Learning: A Future Outlook from Qubits to Enterprise Applications
A review of supervised quantum machine learning techniques and a speculative roadmap for 2025-2035, concluding that practical quantum advantage will be confined to niche domains until fault-tolerant hardware arrives.
-
Quantum Computing for Energy Management: A Semi Non-Technical Guide for Practitioners
A review-based guide concludes that quantum speedup for energy management is unproven and presents a practical framework for selecting quantum and quantum-inspired approaches.
-
Artificial intelligence for representing and characterizing quantum systems
A review organizes AI-based quantum system characterization into ML, deep learning, and language model paradigms, covering property prediction and implicit state reconstruction.
Discussion (0). Continue with ORCID to comment.