Tangible reduction in learning sample complexity with large classical samples and small quantum system

DOI10.1007/s11128-021-03217-7OpenAlexW3197648792MaRDI QIDQ2679052

Nana Liu, Marcin Pawłowski, Marcin Wieśniak, Jinhyoung Lee, Jaewan Kim, Wooyeong Song, Jeongho Bang

Publication date: 18 January 2023

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

Full work available at URL: https://arxiv.org/abs/1905.05751

zbMATH Keywords

sample complexityprobably approximately correct (PAC) learningquantum machine learningclassical-quantum hybrid query

Mathematics Subject Classification ID

Quantum computation (81P68)

Related Items

Target-generating quantum error correction coding scheme based on generative confrontation network

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Randomly fallible teachers: Learning monotone DNF with an incomplete membership oracle
• Queries and concept learning
• Robust polynomials and quantum algorithms
• Quantum Random Access Memory
• A quantum speedup in machine learning: finding anN-bit Boolean function for a classification
• A theory of the learnable
• 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 machine learning: a classical perspective
• On the Robustness of Bucket Brigade Quantum RAM
• STACS 2004
• The theory of variational hybrid quantum-classical algorithms