The classical-quantum interface for loading classical data into quantum systems is an indispensable component of quantum information processing, and the parameterized quantum circuit (PQC) represents significant methodology in this area. However, a challenge in designing parameterized quantum circuits that can fully utilize limited qubit resources while accurately representing classical data remains. To address this issue, we propose the enhanced natural parameterized quantum circuit (ENPQC), which achieves the maximum parameter capacity of quantum systems and preserves the local structure of the original dataset. To make the encoding circuits more experiment friendly, we further provide two near-optimal circuits that achieve near-maximum capacity and are comparable in complexity to the existing PQCs. We numerically show that the ENPQC overwhelms other encoding methods for multiple datasets, demonstrating its potential for machine learning tasks. Furthermore, we experimentally validate our scheme by demonstrating a three-class classification task on an NMR platform, which achieves over 97 % accuracy. This work provides a powerful tool for the classical-quantum interface, paving the way for quantum big data processing during the noisy intermediate-scale quantum era.
The classical-quantum interface for loading classical data into quantum systems is an indispensable component of quantum information processing, and the parameterized quantum circuit (PQC) represents significant methodology in this area. However, a challenge in designing parameterized quantum circuits that can fully utilize limited qubit resources while accurately representing classical data remains. To address this issue, we propose the enhanced natural parameterized quantum circuit (ENPQC), which achieves the maximum parameter capacity of quantum systems and preserves the local structure of the original dataset. To make the encoding circuits more experiment friendly, we further provide two near-optimal circuits that achieve near-maximum capacity and are comparable in complexity to the existing PQCs. We numerically show that the ENPQC overwhelms other encoding methods for multiple datasets, demonstrating its potential for machine learning tasks. Furthermore, we experimentally validate our scheme by demonstrating a three-class classification task on an NMR platform, which achieves over 97 % accuracy. This work provides a powerful tool for the classical-quantum interface, paving the way for quantum big data processing during the noisy intermediate-scale quantum era.
Quantum computing has emerged as one of the most influential paradigms capable of transforming computational processes that struggle under classical limitations. In recent years, hybrid quantum–classical algorithms have gained significant attention for their ability to leverage the strengths of both architectures, especially within the Noisy Intermediate-Scale Quantum (NISQ) era. This research paper explores a quantum-enhanced optimization framework designed to improve machine learning model performance through parameterized quantum circuits (PQCs). The goal of this study is to provide a practical, scalable approach that can be integrated into existing machine learning workflows without requiring fully developed fault-tolerant quantum hardware. The proposed framework uses classical preprocessing to encode data into quantum states, followed by quantum transformations that explore richer feature spaces due to quantum superposition and entanglement. A classical optimizer then updates the quantum circuit parameters based on measurement results, forming an end-to-end feedback loop. This hybrid model aims to demonstrate improved optimization efficiency, reduction in loss-function plateaus, and better generalization for specific ML tasks involving small to medium-sized datasets. This paper provides a comprehensive investigation of methodology, literature background, and experimental reasoning with statistical analysis, along with conceptual diagrams illustrating system architecture and circuit layouts. The outcomes further strengthen the viability of hybrid quantum–classical computation as a promising direction for advanced machine learning systems.
Quantum machine learning (QML) has demonstrated the potential to outperform classical machine learning algorithms in various fields. However, encoding classical data into quantum states, known as quantum data loading, remains a challenge. Existing methods achieve high accuracy in loading single data, but lack efficiency for large-scale data loading tasks. In this work, we propose Neural Circuit Parameter Prediction, a novel method that leverages classical deep neural networks to predict the parameters of parameterized quantum circuits directly from the input data. This approach benefits from the batch inference capability of neural networks and improves the accuracy of quantum data loading. We introduce real-valued parameterization of quantum circuits and a three-phase training strategy to further enhance training efficiency and accuracy. Experimental results on MNIST dataset show that our method achieves a 17.31 % improvement in infidelity score and 108 times faster runtime compared to existing methods. Our approach provides an efficient solution for quantum data loading, enabling the practical deployment of QML algorithms on large-scale datasets.
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.
Time-series forecasting is vital across sectors such as finance, energy, and environmental science, where accurate future predictions drive informed decision-making. Traditional statistical methods and deep learning models like LSTM and Transformers, while effective, often struggle with high-dimensional data and long-term dependencies. In this paper, we propose a hybrid quantum-classical model that utilizes Parameterized Quantum Circuits (PQCs) to capture complex temporal patterns in multivariate time-series data. Our architecture integrates a classical encoder, a quantum variational processor, and a classical decoder, trained end-to-end using gradient-based optimization. Experiments conducted on benchmark datasets—electricity load, stock prices, and weather forecasting—demonstrate that the hybrid model consistently outperforms classical baselines in terms of Mean Squared Error (MSE), Mean Absolute Error (MAE), and R² score. Robustness analysis confirms the model’s resilience to moderate quantum noise, while an ablation study highlights the performance gain from quantum components. This work showcases the potential of hybrid quantum-classical approaches on Noisy Intermediate-Scale Quantum (NISQ) devices and lays a foundation for scalable, real-world quantum machine learning applications.
As a generalized quantum machine learning model, parameterized quantum circuits (PQC) have been found to perform poorly in terms of classification accuracy and model scalability for multi-category classification tasks. To address this issue, we propose a scalable parameterized quantum circuits classifier (SPQCC), which performs per-channel PQC and combines the measurements as the output of the trainable parameters of the classifier. By minimizing the cross-entropy loss through optimizing the trainable parameters of PQC, SPQCC leads to a fast convergence of the classifier. The parallel execution of identical PQCs on different quantum machines with the same structure and scale reduces the complexity of classifier design. Classification simulations performed on the MNIST Dataset show that the accuracy of our proposed classifier far exceeds that of other quantum classification algorithms, achieving the state-of-the-art simulation result and surpassing/reaching classical classifiers with a considerable number of trainable parameters. Our classifier demonstrates excellent scalability and classification performance.
Machine learning models achieve strong predictive performance by uncovering hidden patterns and structures within data. Quantum Machine Learning (QML) extends this capability by leveraging principles of quantum mechanics to address complex classification tasks. However, designing effective feature extraction strategies remains challenging. The choice of ansatz plays a central role in determining the expressive power and learning capability of quantum models. In this work, we propose a parameterized quantum circuit model incorporating adaptive transformations between neighboring qubits to enhance feature extraction and classification performance. The proposed approach is evaluated on seven benchmark datasets from the UCI repository: Iris, Banknote Authentication (BNA), Raisin, Wireless Indoor Localization (WIL), Wine, Penguin, and HTRU2. Its performance is compared against existing quantum classification models, including the Amplitude Embedding Model (AEM), Variational Quantum Circuit (VQC), and Quantum Multi-Class Classifier (QMCC), using identical numbers of layers and training epochs. Additionally, comparisons are made with well-established standard classical classifiers. Experimental results implemented on the PennyLane platform demonstrate that the proposed model achieves high test accuracies within only 10–15 training epochs, reaching 100% (Iris), 98.3% (BNA), 91.1% (Raisin), 97.0% (WIL), 99.2% (Penguin), 94.0% (Wine), and 95.4% (HTRU2). These findings indicate that the proposed ansatz effectively extracts meaningful features and performs competitively in both binary and multi-class classification tasks, highlighting its potential for practical quantum machine learning applications.