Optimal quantum sample complexity of learning algorithms
From MaRDI portal
Recommendations
Cited in
(22)- Optimal quantum sample complexity of learning algorithms
- scientific article; zbMATH DE number 7701523 (Why is no real title available?)
- Variational learning the SDC quantum protocol with gradient-based optimization
- Quantum algorithm design: techniques and applications
- Quantum approximate optimization algorithm for Bayesian network structure learning
- Efficient and effective quantum compiling for entanglement-based machine learning on IBM Q devices
- scientific article; zbMATH DE number 7651037 (Why is no real title available?)
- Sample complexity of hidden subgroup problem
- Online learning of quantum states
- The geometry of quantum learning
- Quantum Chebyshev's Inequality and Applications
- How Many Query Superpositions Are Needed to Learn?
- Quantum Learning of Classical Stochastic Processes: The Completely-Positive Realization Problem
- Optimal Universal Learning Machines for Quantum State Discrimination
- An improved lower bound on query complexity for quantum PAC learning
- Quantum machine learning: a classical perspective
- Quantum predictive learning and communication complexity with single input
- Quantum algorithms for the Goldreich-Levin learning problem
- Learning bounds for quantum circuits in the agnostic setting
- Solving the learning parity with noise problem using quantum algorithms
- Improved bounds on quantum learning algorithms
- Quantum learning: asymptotically optimal classification of qubit states
This page was built for publication: Optimal quantum sample complexity of learning algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5111155)
