Classical verification of quantum learning
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 1579275 (Why is no real title available?)
- scientific article; zbMATH DE number 2090015 (Why is no real title available?)
- scientific article; zbMATH DE number 5485565 (Why is no real title available?)
- scientific article; zbMATH DE number 5485576 (Why is no real title available?)
- scientific article; zbMATH DE number 7701523 (Why is no real title available?)
- A distribution testing oracle separating QMA and QCMA
- An improved lower bound on query complexity for quantum PAC learning
- Asymptotic Minimax Character of the Sample Distribution Function and of the Classical Multinomial Estimator
- Classical verification of quantum computations
- Comparative learning: a sample complexity theory for two hypothesis classes
- Constant depth circuits, Fourier transform, and learnability
- Covert learning: how to learn with an untrusted intermediary
- Cryptographic distinguishability measures for quantum-mechanical states
- Decision theoretic generalizations of the PAC model for neural net and other learning applications
- Efficient noise-tolerant learning from statistical queries
- Equivalences and Separations Between Quantum and Classical Learnability
- Exponential separations between learning with and without quantum memory
- Improved bounds on quantum learning algorithms
- Introduction to empirical processes and semiparametric inference
- Learnability and the Vapnik-Chervonenkis dimension
- Learning DNF over the Uniform Distribution Using a Quantum Example Oracle
- Learning Decision Trees Using the Fourier Spectrum
- Learning low-degree functions from a logarithmic number of random queries
- On agnostic learning of parities, monomials, and halfspaces
- On the Uniform Convergence of Relative Frequencies of Events to Their Probabilities
- On the learnability of discrete distributions
- On the power of membership queries in agnostic learning
- On the power of nonstandard quantum oracles
- Optimal quantum sample complexity of learning algorithms
- Quantum Complexity Theory
- Quantum advantage in learning from experiments
- Quantum algorithms for learning and testing juntas
- Quantum learning Boolean linear functions w.r.t. product distributions
- Quantum vs. classical proofs and subset verification
- Shadow tomography of quantum states
- Sharper bounds for Gaussian and empirical processes
- Testing Fourier dimensionality and sparsity
- The learnability of quantum states
- The quantum query complexity of learning multilinear polynomials
- The tight constant in the Dvoretzky-Kiefer-Wolfowitz inequality
- Toward efficient agnostic learning
- Unitarity estimation for quantum channels
- Universal Blind Quantum Computation
- Verification of quantum computation: an overview of existing approaches
This page was built for publication: Classical verification of quantum learning
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6906415)
