The geometry of quantum learning
From MaRDI portal
Publication:989901
DOI10.1007/s11128-009-0129-6zbMath1194.81045arXivquant-ph/0309059OpenAlexW2122964527MaRDI QIDQ989901
David A. Meyer, Markus Hunziker, Jihun Park, Mitchell J. Rothstein, James E. Pommersheim
Publication date: 23 August 2010
Published in: Quantum Information Processing (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/quant-ph/0309059
Learning and adaptive systems in artificial intelligence (68T05) Quantum computation (81P68) Quantum algorithms and complexity in the theory of computing (68Q12)
Related Items (6)
Improved algorithms for quantum identification of Boolean oracles ⋮ Unnamed Item ⋮ On the uselessness of quantum queries ⋮ Improved bounds on quantum learning algorithms ⋮ Unnamed Item ⋮ Two-sided bounds on minimum-error quantum measurement, on the reversibility of quantum dynamics, and on maximum overlap using directional iterates
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Quantum detection and estimation theory
- Poly-locality in quantum computing
- Statistical decision theory for quantum systems
- Improved bounds on quantum learning algorithms
- On the mathematical foundations of learning
- Matrix Analysis
- A theory of the learnable
- Optimal multiple quantum statistical hypothesis testing
- Quantum algorithms revisited
- Learning DNF over the Uniform Distribution Using a Quantum Example Oracle
- Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
- Quantum Complexity Theory
- Strengths and Weaknesses of Quantum Computing
- On quantum detection and the square-root measurement
- Reversing quantum dynamics with near-optimal quantum and classical fidelity
- Quantum complexity theory
- STACS 2004
This page was built for publication: The geometry of quantum learning
