Quantum learning without quantum memory
G. Sent\'is, J. Calsamiglia, R. Munoz-Tapia, and E. Bagan

TL;DR
This paper introduces a quantum learning machine for binary classification of qubit states that operates without quantum memory, matching the optimal error rate and allowing unlimited reuse with minimal classical memory.
Contribution
It presents a quantum learning machine that achieves optimal classification error without quantum memory, outperforming estimate-and-discriminate methods in efficiency.
Findings
Performs with the same error rate as the optimal discrimination machine
Can be used repeatedly without retraining
Classical memory grows logarithmically with training size
Abstract
A quantum learning machine for binary classification of qubit states that does not require quantum memory is introduced and shown to perform with the very same error rate as the optimal (programmable) discrimination machine for any size of the training set. At variance with the latter, this machine can be used an arbitrary number of times without retraining. Its required (classical) memory grows only logarithmically with the number of training qubits, while (asymptotically) its excess risk decreases as the inverse of this number, and twice as fast as the excess risk of an "estimate-and-discriminate" machine, which estimates the states of the training qubits and classifies the data qubit with a discrimination protocol tailored to the obtained estimates.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsQuantum Computing Algorithms and Architecture · Neural Networks and Applications · Quantum Information and Cryptography
