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

Abstract

Quantum computation requires large classical datasets to be embedded into quantum states in order to exploit quantum parallelism. However, this embedding requires considerable resources. It would therefore be desirable to avoid it, if possible, for noisy intermediate-scale quantum (NISQ) implementation. Accordingly, we consider a classical-quantum hybrid architecture, which allows large classical input data, with a relatively small-scale quantum system. This hybrid architecture is used to implement an oracle. It is shown that in the presence of noise in the hybrid oracle, the effects of internal noise can cancel each other out and thereby improve the query success rate. It is also shown that such an immunity of the hybrid oracle to noise directly and tangibly reduces the sample complexity in the probably-approximately-correct learning framework. This NISQ-compatible learning advantage is attributed to the oracle's ability to handle large input features.

10 pages, 5 figures (including Appendix)

References in corpus (10)

• Quantum Computing in the NISQ era and beyond
• Supplementary information for "Quantum supremacy using a programmable superconducting processor"
• Quantum algorithm for solving linear systems of equations
• Supervised learning with quantum enhanced feature spaces
• Quantum random access memory
• Architectures for a quantum random access memory
• Training of Quantum Circuits on a Hybrid Quantum Computer
• Quantum Variational Autoencoder
• Computational speedups using small quantum devices
• Optimal Usage of Quantum Random Access Memory in Quantum Machine Learning

Cited by in corpus (2)

• Bootstrap Embedding on a Quantum Computer
• Ensuring superior learning outcomes and data security for authorized learner