Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:2301.00042

Quantifying the Expressive Capacity of Quantum Systems: Fundamental Limits and Eigentasks

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

Published Dec 30, 2022• 0 citations
arXivHTMLPDF

Abstract

The expressive capacity of quantum systems for machine learning is limited by quantum sampling noise incurred during measurement. Although it is generally believed that noise limits the resolvable capacity of quantum systems, the precise impact of noise on learning is not yet fully understood. We present a mathematical framework for evaluating the available expressive capacity of general quantum systems from a finite number of measurements, and provide a methodology for extracting the extrema of this capacity, its eigentasks. Eigentasks are a native set of functions that a given quantum system can approximate with minimal error. We show that extracting low-noise eigentasks leads to improved performance for machine learning tasks such as classification, displaying robustness to overfitting. We obtain a tight bound on the expressive capacity, and present analyses suggesting that correlations in the measured quantum system enhance learning capacity by reducing noise in eigentasks. These results are supported by experiments on superconducting quantum processors. Our findings have broad implications for quantum machine learning and sensing applications.

DOI
10.48550/arxiv.2301.00042

Related papers

Tackling Sampling Noise in Physical Systems for Machine Learning Applications: Fundamental Limits and Eigentasks

Fangjun Hu, Gerasimos Angelatos, Saeed A. Khan +6 more

The expressive capacity of physical systems employed for learning is limited by the unavoidable presence of noise in their extracted outputs.Though present in physical systems across both the classical and quantum regimes, the precise impact of noise on learning remains poorly understood.Focusing on supervised learning, we present a mathematical framework for evaluating the resolvable expressive capacity (REC) of general physical systems under finite sampling noise and provide a methodology for extracting its extrema, the eigentasks.Eigentasks are a native set of functions that a given physical system can approximate with minimal error.We show that the REC of a quantum system is limited by the fundamental theory of quantum measurement and obtain a tight upper bound for the REC of any finitely sampled physical system.We then provide empirical evidence that extracting low-noise eigentasks can lead to improved performance for machine learning tasks such as classification, displaying robustness to overfitting.We present analyses suggesting that correlations in the measured quantum system enhance learning capacity by reducing noise in eigentasks.The applicability of these results in practice is demonstrated with experiments on superconducting quantum processors.Our findings have broad implications for quantum machine learning and sensing applications.

arXiv:2307.16083•Physical Review X•Oct 30, 2023•22 citations

Breaking concentration barriers for quantum extreme learning on digital quantum processors

Timothée Dao, Ege Yilmaz, Ibrahim Shehzad +8 more

Reservoir computing leverages rich, non-linear dynamics to process temporal data. Quantum variants promise enhanced expressivity from high-dimensional Hilbert spaces, yet their practical applicability is hindered by hardware noise and concentration effects that can erase input-output distinguishability at large system sizes. In this work, we present and experimentally demonstrate a Quantum Extreme Learning Machine (QELM) tailored to state-of-the-art superconducting platforms, employing up to 124 qubits and circuits with more than 5,000 two-qubit gates on IBM Quantum computers. We introduce a practical multi-objective hyperparameter tuning strategy that jointly monitors observable variability, capacity, and task performance to identify noise-robust operating points. In addition, we develop a local eigentask analysis that enables computationally efficient feature selection and effective information retrieval. We report evidence of a regime of optimality that is identifiable at small scales and transferable across tasks and larger systems, and we achieve performances competitive with leading classical baselines on representative benchmarks for time-series forecasting and satellite image classification. Together, our results establish a viable and robust framework for large-scale, pre-fault-tolerant quantum machine learning and provide a foundation for extending reservoir-based methods to more expressive architectures and real-world scenarios.

quant-pharXiv:2603.13005•Mar 16, 2026•0 citations

Generalization Error in Quantum Machine Learning in the Presence of Sampling Noise

Fangjun Hu, Xun Gao

Tackling output sampling noise due to finite shots of quantum measurement is an unavoidable challenge when extracting information in machine learning with physical systems. A technique called Eigentask Learning was developed recently as a framework for learning with infinite input training data in the presence of output sampling noise. In the work of Eigentask Learning, numerical evidence was presented that extracting low-noise contributions of features can practically improve performance for machine learning tasks, displaying robustness to overfitting and increasing generalization accuracy. However, it remains unsolved to quantitatively characterize generalization errors in situations where the training dataset is finite, while output sampling noise still exists. In this study, we use methodologies from statistical mechanics to calculate the training and generalization errors of a generic quantum machine learning system when the input training dataset and output measurement sampling shots are both finite. Our analytical findings, supported by numerical validation, offer solid justification that Eigentask Learning provides optimal learning in the sense of minimizing generalization errors.

arXiv:2410.14654•Oct 18, 2024•0 citations

Power and Limitations of Single-Qubit Native Quantum Neural Networks

Zhan Yu, Hongshun Yao, Mujin Li +1 more

Quantum neural networks (QNNs) have emerged as a leading strategy to establish applications in machine learning, chemistry, and optimization. While the applications of QNN have been widely investigated, its theoretical foundation remains less understood. In this paper, we formulate a theoretical framework for the expressive ability of data re-uploading quantum neural networks that consist of interleaved encoding circuit blocks and trainable circuit blocks. First, we prove that single-qubit quantum neural networks can approximate any univariate function by mapping the model to a partial Fourier series. We in particular establish the exact correlations between the parameters of the trainable gates and the Fourier coefficients, resolving an open problem on the universal approximation property of QNN. Second, we discuss the limitations of single-qubit native QNNs on approximating multivariate functions by analyzing the frequency spectrum and the flexibility of Fourier coefficients. We further demonstrate the expressivity and limitations of single-qubit native QNNs via numerical experiments. We believe these results would improve our understanding of QNNs and provide a helpful guideline for designing powerful QNNs for machine learning tasks.

arXiv:2205.07848•neural information processing systems•Jan 1, 2022•20 citations

Provable bounds for noise-free expectation values computed from noisy samples

Samantha V. Barron, Daniel J. Egger, Elijah Pelofske +4 more

Quantum computing has emerged as a powerful computational paradigm capable of solving problems beyond the reach of classical computers. However, today’s quantum computers are noisy, posing challenges to obtaining accurate results. Here, we explore the impact of noise on quantum computing, focusing on the challenges in sampling bit strings from noisy quantum computers and the implications for optimization and machine learning. We formally quantify the sampling overhead to extract good samples from noisy quantum computers and relate it to the layer fidelity, a metric to determine the performance of noisy quantum processors. Further, we show how this allows us to use the conditional value at risk of noisy samples to determine provable bounds on noise-free expectation values. We discuss how to leverage these bounds for different algorithms and demonstrate our findings through experiments on real quantum computers involving up to 127 qubits. The results show strong alignment with theoretical predictions. In this study, the authors investigate the impact of noise on quantum computing with a focus on the challenges in sampling bit strings from noisy quantum computers, which has implications for optimization and machine learning.

arXiv:2312.00733•Nature Computational Science•Nov 1, 2024•25 citations

Noisy quantum kernel machines

Valentin Heyraud, Zejian Li, Zakari Denis +2 more

In the noisy intermediate-scale quantum era, an important goal is the conception of implementable algorithms that exploit the rich dynamics of quantum systems and the high dimensionality of the underlying Hilbert spaces to perform tasks while prescinding from noise-proof physical systems. An emerging class of quantum learning machines is that based on the paradigm of quantum kernels. Here, we study how dissipation and decoherence affect their performance. We address this issue by investigating the expressivity and the generalization capacity of these models within the framework of kernel theory. We introduce and study the effective kernel rank, a figure of merit that quantifies the number of independent features a noisy quantum kernel is able to extract from input data. Moreover, we derive an upper bound on the generalization error of the model that involves the average purity of the encoded states. Thereby we show that decoherence and dissipation can be seen as an implicit regularization for quantum kernel machines. As an illustrative example, we report exact finite-size simulations of machines based on chains of driven-dissipative quantum spins to perform a classification task, where the input data are encoded into the driving fields and the quantum physical system is fixed. We determine how the performance of noisy kernel machines scales with the number of nodes (chain sites) as a function of decoherence and examine the effect of imperfect measurements.

arXiv:2204.12192•Physical Review A•Nov 18, 2022•24 citations
The expressive capacity of quantum systems for machine learning is limited by quantum sampling noise incurred during measurement. Although it is generally believed that noise limits the resolvable capacity of quantum systems, the precise impact of noise on learning is not yet fully understood. We present a mathematical framework for evaluating the available expressive capacity of general quantum systems from a finite number of measurements, and provide a methodology for extracting the extrema of this capacity, its eigentasks. Eigentasks are a native set of functions that a given quantum system can approximate with minimal error. We show that extracting low-noise eigentasks leads to improved performance for machine learning tasks such as classification, displaying robustness to overfitting. We obtain a tight bound on the expressive capacity, and present analyses suggesting that correlations in the measured quantum system enhance learning capacity by reducing noise in eigentasks. These results are supported by experiments on superconducting quantum processors. Our findings have broad implications for quantum machine learning and sensing applications.
The expressive capacity of physical systems employed for learning is limited by the unavoidable presence of noise in their extracted outputs.Though present in physical systems across both the classical and quantum regimes, the precise impact of noise on learning remains poorly understood.Focusing on supervised learning, we present a mathematical framework for evaluating the resolvable expressive capacity (REC) of general physical systems under finite sampling noise and provide a methodology for extracting its extrema, the eigentasks.Eigentasks are a native set of functions that a given physical system can approximate with minimal error.We show that the REC of a quantum system is limited by the fundamental theory of quantum measurement and obtain a tight upper bound for the REC of any finitely sampled physical system.We then provide empirical evidence that extracting low-noise eigentasks can lead to improved performance for machine learning tasks such as classification, displaying robustness to overfitting.We present analyses suggesting that correlations in the measured quantum system enhance learning capacity by reducing noise in eigentasks.The applicability of these results in practice is demonstrated with experiments on superconducting quantum processors.Our findings have broad implications for quantum machine learning and sensing applications.
Reservoir computing leverages rich, non-linear dynamics to process temporal data. Quantum variants promise enhanced expressivity from high-dimensional Hilbert spaces, yet their practical applicability is hindered by hardware noise and concentration effects that can erase input-output distinguishability at large system sizes. In this work, we present and experimentally demonstrate a Quantum Extreme Learning Machine (QELM) tailored to state-of-the-art superconducting platforms, employing up to 124 qubits and circuits with more than 5,000 two-qubit gates on IBM Quantum computers. We introduce a practical multi-objective hyperparameter tuning strategy that jointly monitors observable variability, capacity, and task performance to identify noise-robust operating points. In addition, we develop a local eigentask analysis that enables computationally efficient feature selection and effective information retrieval. We report evidence of a regime of optimality that is identifiable at small scales and transferable across tasks and larger systems, and we achieve performances competitive with leading classical baselines on representative benchmarks for time-series forecasting and satellite image classification. Together, our results establish a viable and robust framework for large-scale, pre-fault-tolerant quantum machine learning and provide a foundation for extending reservoir-based methods to more expressive architectures and real-world scenarios.
Tackling output sampling noise due to finite shots of quantum measurement is an unavoidable challenge when extracting information in machine learning with physical systems. A technique called Eigentask Learning was developed recently as a framework for learning with infinite input training data in the presence of output sampling noise. In the work of Eigentask Learning, numerical evidence was presented that extracting low-noise contributions of features can practically improve performance for machine learning tasks, displaying robustness to overfitting and increasing generalization accuracy. However, it remains unsolved to quantitatively characterize generalization errors in situations where the training dataset is finite, while output sampling noise still exists. In this study, we use methodologies from statistical mechanics to calculate the training and generalization errors of a generic quantum machine learning system when the input training dataset and output measurement sampling shots are both finite. Our analytical findings, supported by numerical validation, offer solid justification that Eigentask Learning provides optimal learning in the sense of minimizing generalization errors.
Quantum neural networks (QNNs) have emerged as a leading strategy to establish applications in machine learning, chemistry, and optimization. While the applications of QNN have been widely investigated, its theoretical foundation remains less understood. In this paper, we formulate a theoretical framework for the expressive ability of data re-uploading quantum neural networks that consist of interleaved encoding circuit blocks and trainable circuit blocks. First, we prove that single-qubit quantum neural networks can approximate any univariate function by mapping the model to a partial Fourier series. We in particular establish the exact correlations between the parameters of the trainable gates and the Fourier coefficients, resolving an open problem on the universal approximation property of QNN. Second, we discuss the limitations of single-qubit native QNNs on approximating multivariate functions by analyzing the frequency spectrum and the flexibility of Fourier coefficients. We further demonstrate the expressivity and limitations of single-qubit native QNNs via numerical experiments. We believe these results would improve our understanding of QNNs and provide a helpful guideline for designing powerful QNNs for machine learning tasks.
Quantum computing has emerged as a powerful computational paradigm capable of solving problems beyond the reach of classical computers. However, today’s quantum computers are noisy, posing challenges to obtaining accurate results. Here, we explore the impact of noise on quantum computing, focusing on the challenges in sampling bit strings from noisy quantum computers and the implications for optimization and machine learning. We formally quantify the sampling overhead to extract good samples from noisy quantum computers and relate it to the layer fidelity, a metric to determine the performance of noisy quantum processors. Further, we show how this allows us to use the conditional value at risk of noisy samples to determine provable bounds on noise-free expectation values. We discuss how to leverage these bounds for different algorithms and demonstrate our findings through experiments on real quantum computers involving up to 127 qubits. The results show strong alignment with theoretical predictions. In this study, the authors investigate the impact of noise on quantum computing with a focus on the challenges in sampling bit strings from noisy quantum computers, which has implications for optimization and machine learning.
In the noisy intermediate-scale quantum era, an important goal is the conception of implementable algorithms that exploit the rich dynamics of quantum systems and the high dimensionality of the underlying Hilbert spaces to perform tasks while prescinding from noise-proof physical systems. An emerging class of quantum learning machines is that based on the paradigm of quantum kernels. Here, we study how dissipation and decoherence affect their performance. We address this issue by investigating the expressivity and the generalization capacity of these models within the framework of kernel theory. We introduce and study the effective kernel rank, a figure of merit that quantifies the number of independent features a noisy quantum kernel is able to extract from input data. Moreover, we derive an upper bound on the generalization error of the model that involves the average purity of the encoded states. Thereby we show that decoherence and dissipation can be seen as an implicit regularization for quantum kernel machines. As an illustrative example, we report exact finite-size simulations of machines based on chains of driven-dissipative quantum spins to perform a classification task, where the input data are encoded into the driving fields and the quantum physical system is fixed. We determine how the performance of noisy kernel machines scales with the number of nodes (chain sites) as a function of decoherence and examine the effect of imperfect measurements.