The learnability of quantum states
From MaRDI portal
Abstract: Traditional quantum state tomography requires a number of measurements that grows exponentially with the number of qubits n. But using ideas from computational learning theory, we show that "for most practical purposes" one can learn a state using a number of measurements that grows only linearly with n. Besides possible implications for experimental physics, our learning theorem has two applications to quantum computing: first, a new simulation of quantum one-way communication protocols, and second, the use of trusted classical advice to verify untrusted quantum advice.
Recommendations
Cites work
- A theory of the learnable
- Constant depth circuits, Fourier transform, and learnability
- Dense quantum coding and quantum finite automata
- Exponential separations for one-way quantum communication complexity, with applications to cryptography
- Fat-shattering and the learnability of real-valued functions
- Function Learning from Interpolation
- scientific article; zbMATH DE number 3960854 (Why is no real title available?)
- Learnability and the Vapnik-Chervonenkis dimension
- Prediction, learning, uniform convergence, and scale-sensitive dimensions
- Quantum computing, postselection, and probabilistic polynomial-time
- Quantum state reconstruction from incomplete data
- Quantum versus classical proofs and advice
- Scale-sensitive dimensions, uniform convergence, and learnability
Cited in
(45)- New bounds on classical and quantum one-way communication complexity
- Self-guided quantum state learning for mixed states
- Recovery of simultaneous low rank and two-way sparse coefficient matrices, a nonconvex approach
- Quantum de Finetti theorems under local measurements with applications
- Demonstration of a measurement-based adaptation protocol with quantum reinforcement learning on the IBM Q experience platform
- Learning bounds for quantum circuits in the agnostic setting
- Input-oblivious proof systems and a uniform complexity perspective on P/poly
- Quantum Learning of Classical Stochastic Processes: The Completely-Positive Realization Problem
- On the Power of Lower Bound Methods for One-Way Quantum Communication Complexity
- scientific article; zbMATH DE number 6096711 (Why is no real title available?)
- A full characterization of quantum advice
- Quantum bootstrapping via compressed quantum Hamiltonian learning
- Optimal, reliable estimation of quantum states
- Optimal quantum sample complexity of learning algorithms
- scientific article; zbMATH DE number 2154301 (Why is no real title available?)
- Efficient quantum tomography. II
- Correlation between concurrence and mutual information
- A compressed classical description of quantum states
- Quantum SDP solvers: large speed-ups, optimality, and applications to quantum learning
- Shadow tomography of quantum states
- Quantum learning: asymptotically optimal classification of qubit states
- Robust online Hamiltonian learning
- Optimal Universal Learning Machines for Quantum State Discrimination
- Nonconvex Robust Low-Rank Matrix Recovery
- Shadow tomography of quantum states
- Finding low-rank solutions via nonconvex matrix factorization, efficiently and provably
- Sparse Approximate Solutions to Semidefinite Programs
- Online learning of quantum states
- Learning and testing quantum states via probabilistic combinatorics and representation theory
- Inapproximability of positive semidefinite permanents and quantum state tomography
- Learning quantum finite automata with queries
- Quantum continual learning of quantum data realizing knowledge backward transfer
- scientific article; zbMATH DE number 7701523 (Why is no real title available?)
- Error regions in quantum state tomography: computational complexity caused by geometry of quantum states
- Quantum process tomography on cloud-accessible quantum computing platforms
- Classical shadows meet quantum optimal mass transport
- Fat shattering, joint measurability, and PAC learnability of POVM hypothesis classes
- Even quantum advice is unlikely to solve \(\mathsf{PP}\)
- Classical vs quantum advice and proofs under classically-accessible oracle
- Classical verification of quantum learning
- Quantum learning algorithms for quantum measurements
- The complexity of learning (pseudo)random dynamics of black holes and other chaotic systems
- Sample efficient identity testing and independence testing of quantum states
- Oblivious complexity classes revisited: lower bounds and hierarchies
- Quantum data sketches
This page was built for publication: The learnability of quantum states
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3508097)
