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:2206.08273 · neural information processing systems

Concentration of Data Encoding in Parameterized Quantum Circuits

Guangxi Li, Ruilin Ye, Xuanqiang Zhao, Xin Wang

Published Jan 1, 2022• 25 citations
arXivHTMLPDF

Abstract

Variational quantum algorithms have been acknowledged as a leading strategy to realize near-term quantum advantages in meaningful tasks, including machine learning and combinatorial optimization. When applied to tasks involving classical data, such algorithms generally begin with quantum circuits for data encoding and then train quantum neural networks (QNNs) to minimize target functions. Although QNNs have been widely studied to improve these algorithms' performance on practical tasks, there is a gap in systematically understanding the influence of data encoding on the eventual performance. In this paper, we make progress in filling this gap by considering the common data encoding strategies based on parameterized quantum circuits. We prove that, under reasonable assumptions, the distance between the average encoded state and the maximally mixed state could be explicitly upper-bounded with respect to the width and depth of the encoding circuit. This result in particular implies that the average encoded state will concentrate on the maximally mixed state at an exponential speed on depth. Such concentration seriously limits the capabilities of quantum classifiers, and strictly restricts the distinguishability of encoded states from a quantum information perspective. We further support our findings by numerically verifying these results on both synthetic and public data sets. Our results highlight the significance of quantum data encoding in machine learning tasks and may shed light on future encoding strategies.

DOI
10.52202/068431-1414

Related papers

Unleashing Quantum Neural Networks: Solving Parameterized Quantum Circuit Challenges

Kolla Bhanu Prakash

A possible approach to tackling computationally demanding issues beyond the capabilities of conventional algorithms is the use of quantum circuits, which provide a fundamental foundation for utilizing the power of quantum computation. This abstract examines how quantum circuits are implemented, emphasizing important topics such as circuit optimization, gate operations, and qubit manipulation. We explore different methods of encoding quantum information into topological qubits, trapped ions, and superconducting circuits, among other physical qubit formats. Furthermore, we go over the function of gate operations in quantum circuits, emphasizing crucial gates like phase, Hadamard, and CNOT gates, which serve as the foundation for quantum algorithms. Additionally, we look at methods for maximizing the efficiency and dependability of quantum processing by designing quantum circuits to minimize gate counts, depth, and error rates. To enhance the capabilities of quantum computing, this abstract presents a novel synthesis of quantum neural networks (QNNs) and quantum parameterized circuits. Through the use of parameterized quantum circuits' inherent flexibility, our approach makes it easier to design and optimize quantum circuits with flexible parameters, providing a flexible foundation for a variety of quantum algorithms. Using this amalgamation, we unleash the capacity of quantum computers to address intricate optimization and machine learning assignments with unparalleled effectiveness and expandability. Our solution bridges the gap between traditional machine learning approaches and quantum computing paradigms by enabling the smooth integration of classical data processing techniques with quantum computation. We use quantum states as data representations in our implementation of quantum neural networks, and we optimize trainable parameters to meet predetermined goals. This new paradigm opens up the investigation of the inherent features of quantum states and provides new perspectives on their processing power compared to their classical counterparts. We show, by thorough testing and analysis, how effective quantum parameterized circuits and QNNs are at solving practical problems in a variety of fields. Our work sets the ground for revolutionary breakthroughs in quantum information processing by pushing the boundaries of quantum computation and machine learning integration, offering hitherto unseen insights and solutions to challenging challenges in science, engineering, and beyond.

International Conference on Advances in Modern Age Technologies for Health and Engineering Science (AMATHE)•May 16, 2024•1 citation

Encoding-dependent generalization bounds for parametrized quantum circuits

Matthias C. Caro, Elies Gil-Fuster, Johannes Jakob Meyer +2 more

A large body of recent work has begun to explore the potential of parametrized quantum circuits (PQCs) as machine learning models, within the framework of hybrid quantum-classical optimization. In particular, theoretical guarantees on the out-of-sample performance of such models, in terms of generalization bounds, have emerged. However, none of these generalization bounds depend explicitly on how the classical input data is encoded into the PQC. We derive generalization bounds for PQC-based models that depend explicitly on the strategy used for data-encoding. These imply bounds on the performance of trained PQC-based models on unseen data. Moreover, our results facilitate the selection of optimal data-encoding strategies via structural risk minimization, a mathematically rigorous framework for model selection. We obtain our generalization bounds by bounding the complexity of PQC-based models as measured by the Rademacher complexity and the metric entropy, two complexity measures from statistical learning theory. To achieve this, we rely on a representation of PQC-based models via trigonometric functions. Our generalization bounds emphasize the importance of well-considered data-encoding strategies for PQC-based models.

arXiv:2106.03880•Quantum•Nov 17, 2021•133 citations

Limitations of Amplitude Encoding on Quantum Classification

Xin Wang, Yabo Wang, Qi, Bo +1 more

It remains unclear whether quantum machine learning (QML) has real advantages when dealing with practical and meaningful tasks. Encoding classical data into quantum states is one of the key steps in QML. Amplitude encoding has been widely used owing to its remarkable efficiency in encoding a number of $2^{n}$ classical data into $n$ qubits simultaneously. However, the theoretical impact of amplitude encoding on QML has not been thoroughly investigated. In this work we prove that under some broad and typical data assumptions, the average of encoded quantum states via amplitude encoding tends to concentrate towards a specific state. This concentration phenomenon severely constrains the capability of quantum classifiers as it leads to a loss barrier phenomenon, namely, the loss function has a lower bound that cannot be improved by any optimization algorithm. In addition, via numerical simulations, we reveal a counterintuitive phenomenon of amplitude encoding: as the amount of training data increases, the training error may increase rather than decrease, leading to reduced decrease in prediction accuracy on new data. Our results highlight the limitations of amplitude encoding in QML and indicate that more efforts should be devoted to finding more efficient encoding strategies to unlock the full potential of QML.

arXiv:2503.01545•Mar 3, 2025•13 citations

Discovering Data Encoding Strategies for Quantum-Classical Neural Networks Using Monte Carlo Tree Search

Lena Tokuhiro, Amine Bentellis, Jeanette Miriam Lorenz

Quantum machine learning (QML) has attracted considerable research interest, yet whether it offers practical benefits over classical approaches remains an open question. The choice of data encoding significantly influences QML performance, but why certain encodings outperform others remains poorly understood. We employ Monte Carlo Tree Search (MCTS) to discover optimal data encoding circuits for a quantum-classical convolutional neural network (QCCNN) combining a non-variational quantum block for feature extraction with a classical classifier. Evaluating on two medical imaging datasets, the discovered circuits outperform commonly used encoding strategies while showing competitive results compared to purely classical counterparts. We further analyze metrics to identify predictors of encoding performance. Entanglement capability and Fourier decomposition provide minimal insight, whereas the effective rank of the feature maps exhibits meaningful correlation and can serve as a threshold criterion to accelerate the search for high-performing encodings. Our findings provide both a practical method for encoding discovery and new insights into what makes data encodings effective in QML.

quant-pharXiv:2605.18540•May 19, 2026•2 citations

Non-asymptotic Approximation Error Bounds of Parameterized Quantum Circuits

Zhan Yu, Qiuhao Chen, Yuling Jiao +4 more

Parameterized quantum circuits (PQCs) have emerged as a promising approach for quantum neural networks. However, understanding their expressive power in accomplishing machine learning tasks remains a crucial question. This paper investigates the expressivity of PQCs for approximating general multivariate function classes. Unlike previous Universal Approximation Theorems for PQCs, which are either nonconstructive or rely on parameterized classical data processing, we explicitly construct data re-uploading PQCs for approximating multivariate polynomials and smooth functions. We establish the first non-asymptotic approximation error bounds for these functions in terms of the number of qubits, quantum circuit depth, and number of trainable parameters. Notably, we demonstrate that for approximating functions that satisfy specific smoothness criteria, the quantum circuit size and number of trainable parameters of our proposed PQCs can be smaller than those of deep ReLU neural networks. We further validate the approximation capability of PQCs through numerical experiments. Our results provide a theoretical foundation for designing practical PQCs and quantum neural networks for machine learning tasks that can be implemented on near-term quantum devices, paving the way for the advancement of quantum machine learning.

arXiv:2310.07528•neural information processing systems•Jan 1, 2024•29 citations

Benchmarking Encoding Families in Quantum Neural Networks Under Fixed Circuit Area for Frequency Spectrum and Trainability

Martyna Czuba, Patrick Holzer, Hein Zay Yar Oo

Quantum Neural Networks (QNNs) offer a promising framework for integrating quantum computing principles into machine learning, yet their practical capabilities and limitations remain insufficiently studied. In this work, we systematically investigate the trainability and approximation properties of QNNs by benchmarking diverse circuit architectures and encoding strategies across synthetic and real-world datasets. We analyze several ansätze, including Hamming, binary, exponential, ternary, turnpike and Golomb, by evaluating their ability to learn synthetic data modeled as random finite Fourier series. To assess real-world applicability, we further evaluate QNNs on two time-series classification tasks: a Fischertechnik pneumatic leak detection dataset and the publicly available NASA bearing fault dataset. Our experiments show that while broader frequency spectra can theoretically enhance expressivity, practical trainability is strongly influenced by architectural factors such as qubit count and circuit depth. Notably, we find that QNNs perform best when the frequency spectrum is tailored to the target function's complexity but remains as compact as possible. Moreover, architectures with identical frequency spectra can differ in trainability, with configurations using more qubits and fewer layers generally performing better, except in the single-layer case. These findings provide guidelines for selecting QNN ansätze and offer new insights into the interplay between expressivity and trainability in quantum machine learning.

quant-pharXiv:2603.27671•Mar 31, 2026•1 citation
Variational quantum algorithms have been acknowledged as a leading strategy to realize near-term quantum advantages in meaningful tasks, including machine learning and combinatorial optimization. When applied to tasks involving classical data, such algorithms generally begin with quantum circuits for data encoding and then train quantum neural networks (QNNs) to minimize target functions. Although QNNs have been widely studied to improve these algorithms' performance on practical tasks, there is a gap in systematically understanding the influence of data encoding on the eventual performance. In this paper, we make progress in filling this gap by considering the common data encoding strategies based on parameterized quantum circuits. We prove that, under reasonable assumptions, the distance between the average encoded state and the maximally mixed state could be explicitly upper-bounded with respect to the width and depth of the encoding circuit. This result in particular implies that the average encoded state will concentrate on the maximally mixed state at an exponential speed on depth. Such concentration seriously limits the capabilities of quantum classifiers, and strictly restricts the distinguishability of encoded states from a quantum information perspective. We further support our findings by numerically verifying these results on both synthetic and public data sets. Our results highlight the significance of quantum data encoding in machine learning tasks and may shed light on future encoding strategies.
A possible approach to tackling computationally demanding issues beyond the capabilities of conventional algorithms is the use of quantum circuits, which provide a fundamental foundation for utilizing the power of quantum computation. This abstract examines how quantum circuits are implemented, emphasizing important topics such as circuit optimization, gate operations, and qubit manipulation. We explore different methods of encoding quantum information into topological qubits, trapped ions, and superconducting circuits, among other physical qubit formats. Furthermore, we go over the function of gate operations in quantum circuits, emphasizing crucial gates like phase, Hadamard, and CNOT gates, which serve as the foundation for quantum algorithms. Additionally, we look at methods for maximizing the efficiency and dependability of quantum processing by designing quantum circuits to minimize gate counts, depth, and error rates. To enhance the capabilities of quantum computing, this abstract presents a novel synthesis of quantum neural networks (QNNs) and quantum parameterized circuits. Through the use of parameterized quantum circuits' inherent flexibility, our approach makes it easier to design and optimize quantum circuits with flexible parameters, providing a flexible foundation for a variety of quantum algorithms. Using this amalgamation, we unleash the capacity of quantum computers to address intricate optimization and machine learning assignments with unparalleled effectiveness and expandability. Our solution bridges the gap between traditional machine learning approaches and quantum computing paradigms by enabling the smooth integration of classical data processing techniques with quantum computation. We use quantum states as data representations in our implementation of quantum neural networks, and we optimize trainable parameters to meet predetermined goals. This new paradigm opens up the investigation of the inherent features of quantum states and provides new perspectives on their processing power compared to their classical counterparts. We show, by thorough testing and analysis, how effective quantum parameterized circuits and QNNs are at solving practical problems in a variety of fields. Our work sets the ground for revolutionary breakthroughs in quantum information processing by pushing the boundaries of quantum computation and machine learning integration, offering hitherto unseen insights and solutions to challenging challenges in science, engineering, and beyond.
A large body of recent work has begun to explore the potential of parametrized quantum circuits (PQCs) as machine learning models, within the framework of hybrid quantum-classical optimization. In particular, theoretical guarantees on the out-of-sample performance of such models, in terms of generalization bounds, have emerged. However, none of these generalization bounds depend explicitly on how the classical input data is encoded into the PQC. We derive generalization bounds for PQC-based models that depend explicitly on the strategy used for data-encoding. These imply bounds on the performance of trained PQC-based models on unseen data. Moreover, our results facilitate the selection of optimal data-encoding strategies via structural risk minimization, a mathematically rigorous framework for model selection. We obtain our generalization bounds by bounding the complexity of PQC-based models as measured by the Rademacher complexity and the metric entropy, two complexity measures from statistical learning theory. To achieve this, we rely on a representation of PQC-based models via trigonometric functions. Our generalization bounds emphasize the importance of well-considered data-encoding strategies for PQC-based models.
It remains unclear whether quantum machine learning (QML) has real advantages when dealing with practical and meaningful tasks. Encoding classical data into quantum states is one of the key steps in QML. Amplitude encoding has been widely used owing to its remarkable efficiency in encoding a number of 2n2^{n}2n classical data into nnn qubits simultaneously. However, the theoretical impact of amplitude encoding on QML has not been thoroughly investigated. In this work we prove that under some broad and typical data assumptions, the average of encoded quantum states via amplitude encoding tends to concentrate towards a specific state. This concentration phenomenon severely constrains the capability of quantum classifiers as it leads to a loss barrier phenomenon, namely, the loss function has a lower bound that cannot be improved by any optimization algorithm. In addition, via numerical simulations, we reveal a counterintuitive phenomenon of amplitude encoding: as the amount of training data increases, the training error may increase rather than decrease, leading to reduced decrease in prediction accuracy on new data. Our results highlight the limitations of amplitude encoding in QML and indicate that more efforts should be devoted to finding more efficient encoding strategies to unlock the full potential of QML.
Quantum machine learning (QML) has attracted considerable research interest, yet whether it offers practical benefits over classical approaches remains an open question. The choice of data encoding significantly influences QML performance, but why certain encodings outperform others remains poorly understood. We employ Monte Carlo Tree Search (MCTS) to discover optimal data encoding circuits for a quantum-classical convolutional neural network (QCCNN) combining a non-variational quantum block for feature extraction with a classical classifier. Evaluating on two medical imaging datasets, the discovered circuits outperform commonly used encoding strategies while showing competitive results compared to purely classical counterparts. We further analyze metrics to identify predictors of encoding performance. Entanglement capability and Fourier decomposition provide minimal insight, whereas the effective rank of the feature maps exhibits meaningful correlation and can serve as a threshold criterion to accelerate the search for high-performing encodings. Our findings provide both a practical method for encoding discovery and new insights into what makes data encodings effective in QML.
Parameterized quantum circuits (PQCs) have emerged as a promising approach for quantum neural networks. However, understanding their expressive power in accomplishing machine learning tasks remains a crucial question. This paper investigates the expressivity of PQCs for approximating general multivariate function classes. Unlike previous Universal Approximation Theorems for PQCs, which are either nonconstructive or rely on parameterized classical data processing, we explicitly construct data re-uploading PQCs for approximating multivariate polynomials and smooth functions. We establish the first non-asymptotic approximation error bounds for these functions in terms of the number of qubits, quantum circuit depth, and number of trainable parameters. Notably, we demonstrate that for approximating functions that satisfy specific smoothness criteria, the quantum circuit size and number of trainable parameters of our proposed PQCs can be smaller than those of deep ReLU neural networks. We further validate the approximation capability of PQCs through numerical experiments. Our results provide a theoretical foundation for designing practical PQCs and quantum neural networks for machine learning tasks that can be implemented on near-term quantum devices, paving the way for the advancement of quantum machine learning.
Quantum Neural Networks (QNNs) offer a promising framework for integrating quantum computing principles into machine learning, yet their practical capabilities and limitations remain insufficiently studied. In this work, we systematically investigate the trainability and approximation properties of QNNs by benchmarking diverse circuit architectures and encoding strategies across synthetic and real-world datasets. We analyze several ansätze, including Hamming, binary, exponential, ternary, turnpike and Golomb, by evaluating their ability to learn synthetic data modeled as random finite Fourier series. To assess real-world applicability, we further evaluate QNNs on two time-series classification tasks: a Fischertechnik pneumatic leak detection dataset and the publicly available NASA bearing fault dataset. Our experiments show that while broader frequency spectra can theoretically enhance expressivity, practical trainability is strongly influenced by architectural factors such as qubit count and circuit depth. Notably, we find that QNNs perform best when the frequency spectrum is tailored to the target function's complexity but remains as compact as possible. Moreover, architectures with identical frequency spectra can differ in trainability, with configurations using more qubits and fewer layers generally performing better, except in the single-layer case. These findings provide guidelines for selecting QNN ansätze and offer new insights into the interplay between expressivity and trainability in quantum machine learning.