Learning bounds for quantum circuits in the agnostic setting

DOI10.1007/S11128-021-03225-7MaRDI QIDQ2685576zbMATH OpenOpenAlexFDO

Authors C. Popescu

Publication date 22 February 2023

Published in Quantum Information Processing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s11128-021-03225-7

zbMATH Keywords

covering numberslearning boundsquantum circuit complexity

Mathematics Subject Classification ID

Networks and circuits as models of computation; circuit complexity (68Q06) Quantum computation (81P68)

Recommendations

• Optimal quantum sample complexity of learning algorithms
• Optimal quantum sample complexity of learning algorithms
• Improved bounds on quantum learning algorithms
• An improved lower bound on query complexity for quantum PAC learning
• Quantum machine learning: a classical perspective

Cites work

• 10.1162/153244303321897690
• An improved lower bound on query complexity for quantum PAC learning
• An optimal quantum algorithm for the oracle identification problem
• Any quantum network is structurally controllable by a single driving signal
• Bounding the Vapnik-Chervonenkis dimension of concept classes parameterized by real numbers
• Equivalences and Separations Between Quantum and Classical Learnability
• Foundations of machine learning
• Function Learning from Interpolation
• scientific article; zbMATH DE number 1552503 (Why is no real title available?)
• scientific article; zbMATH DE number 3366227 (Why is no real title available?)
• Improved algorithms for quantum identification of Boolean oracles
• Improved bounds on quantum learning algorithms
• Learning DNF over the Uniform Distribution Using a Quantum Example Oracle
• Lower Bounds for Approximation by Nonlinear Manifolds
• Materials by design and the exciting role of quantum computation/simulation
• Neural Network Learning
• Non commutative Khintchine and Paley inequalities
• Optimal quantum sample complexity of learning algorithms
• Prediction, learning, uniform convergence, and scale-sensitive dimensions
• Quantum algorithms for learning and testing juntas
• Quantum algorithms for learning symmetric juntas via the adversary bound
• Quantum computation and quantum information. 10th anniversary edition
• Quantum computations: algorithms and error correction
• Quantum query complexity of almost all functions with fixed on-set size
• Rademacher penalties and structural risk minimization
• Shadow tomography of quantum states
• The learnability of quantum states
• The Solovay--Kitaev algorithm
• Theory of Classification: a Survey of Some Recent Advances
• Understanding machine learning. From theory to algorithms
• Universal Donsker classes and metric entropy

Cited in

(2)

• scientific article; zbMATH DE number 6096711 (Why is no real title available?)
• Approximate supervised learning of quantum gates via ancillary qubits

Describes a project that uses

Uses Software

• Quantum Espresso

This page was built for publication: Learning bounds for quantum circuits in the agnostic setting

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2685576)