Quantum secure learning with classical samples

Abstract

Studies addressing the question "Can a learner complete the learning securely?" have recently been spurred from the standpoints of fundamental theory and potential applications. In the relevant context of this question, we present a classical-quantum hybrid sampling protocol and define a security condition that allows only legitimate learners to prepare a finite set of samples that guarantees the success of the learning; the security condition excludes intruders. We do this by combining our security concept with the bound of the so-called probably approximately correct (PAC) learning. We show that while the lower bound on the learning samples guarantees PAC learning, an upper bound can be derived to rule out adversarial learners. Such a secure learning condition is appealing, because it is defined only by the size of samples required for the successful learning and is independent of the algorithm employed. Notably, the security stems from the fundamental quantum no-broadcasting principle. No such condition can thus occur in any classical regime, where learning samples can be copied. Owing to the hybrid architecture, our scheme also offers a practical advantage for implementation in noisy intermediate-scale quantum devices.

arXiv comment8 pages, 5 figures

References in corpus (21)

• Quantum Computing in the NISQ era and beyond
• Quantum Machine Learning
• The Security of Practical Quantum Key Distribution
• Quantum algorithm for solving linear systems of equations
• Quantum support vector machine for big data classification
• Quantum principal component analysis
• An introduction to quantum machine learning
• Quantum random access memory
• On the Complexity of Best Arm Identification in Multi-Armed Bandit Models
• Noncommuting mixed states cannot be broadcast
• Quantum machine learning: a classical perspective
• Architectures for a quantum random access memory
• A generalized no-broadcasting theorem
• Prediction by linear regression on a quantum computer
• Quantum machine learning for quantum anomaly detection
• Quantum State Separation, Unambiguous Discrimination and Exact Cloning
• Quantum Recommendation Systems
• Protocol for secure quantum machine learning at a distant place
• Experimental demonstration of quantum learning speed-up with classical input data
• Optimal Broadcasting of Mixed States
• Mixed Qubit Cannot Be Universally Broadcast

Cited by in corpus (4)

• Biology and medicine in the landscape of quantum advantages
• Photonic kernel machine learning for ultrafast spectral analysis
• Secure Quantum Pattern Communication
• Ensuring superior learning outcomes and data security for authorized learner