Fundamental Limits to Expressive Capacity of Finitely Sampled Qubit-Based Systems

Authors: Fangjun Hu, Gerasimos Angelatos, Saeed A. Khan, Marti Vives, Esin Türeci, Leon Bello, Graham E. Rowlands, Guilhem J. Ribeill, Hakan E. Türeci

arXiv: 2301.00042v1 - DOI (quant-ph)
7 + 21 pages, 4 + 11 figures, 1 table
License: CC BY 4.0

Abstract: The expressive capacity for learning with quantum systems is fundamentally limited by the quantum sampling noise incurred during measurement. While studies suggest that noise limits the resolvable capacity of quantum systems, its precise impact on learning remains an open question. We develop a framework for quantifying the expressive capacity of qubit-based systems from finite numbers of projective measurements, and calculate a tight bound on the expressive capacity and the corresponding accuracy limit that we compare to experiments on superconducting quantum processors. We uncover the native function set a finitely-sampled quantum system can approximate, called eigentasks. We then demonstrate how low-noise eigentasks improve performance for tasks such as classification in a way that is robust to noise and overfitting. We also present experimental and numerical analyses suggesting that entanglement enhances learning capacity by reducing noise in eigentasks. Our results are broadly relevant to quantum machine learning and sensing applications.

Submitted to arXiv on 30 Dec. 2022

Explore the paper tree

Click on the tree nodes to be redirected to a given paper and access their summaries and virtual assistant

Also access our AI generated Summaries, or ask questions about this paper to our AI assistant.

Look for similar papers (in beta version)

By clicking on the button above, our algorithm will scan all papers in our database to find the closest based on the contents of the full papers and not just on metadata. Please note that it only works for papers that we have generated summaries for and you can rerun it from time to time to get a more accurate result while our database grows.