The quantum kernel method has attracted considerable attention in the field of quantum machine learning. However, exploring the applicability of quantum kernels in more realistic settings has been hindered by the number of physical qubits current noisy quantum computers have, thereby limiting the number of features encoded for quantum kernels. Hence, there is a need for an efficient, application-specific simulator for quantum computing by using classical technology. Here we focus on quantum kernels empirically designed for image classification and demonstrate a field programmable gate arrays (FPGA) implementation. We show that the quantum kernel estimation by our heterogeneous CPU-FPGA computing is 470 times faster than that by a conventional CPU implementation. The co-design of our application-specific quantum kernel and its efficient FPGA implementation enabled us to perform one of the largest numerical simulations of a gate-based quantum kernel in terms of features, up to 780-dimensional features. We apply our quantum kernel to classification tasks using the Fashion-MNIST dataset and show that our quantum kernel is comparable to Gaussian kernels with the optimized hyperparameter.
The quantum kernel method has attracted considerable attention in the field of quantum machine learning. However, exploring the applicability of quantum kernels in more realistic settings has been hindered by the number of physical qubits current noisy quantum computers have, thereby limiting the number of features encoded for quantum kernels. Hence, there is a need for an efficient, application-specific simulator for quantum computing by using classical technology. Here we focus on quantum kernels empirically designed for image classification and demonstrate a field programmable gate arrays (FPGA) implementation. We show that the quantum kernel estimation by our heterogeneous CPU-FPGA computing is 470 times faster than that by a conventional CPU implementation. The co-design of our application-specific quantum kernel and its efficient FPGA implementation enabled us to perform one of the largest numerical simulations of a gate-based quantum kernel in terms of features, up to 780-dimensional features. We apply our quantum kernel to classification tasks using the Fashion-MNIST dataset and show that our quantum kernel is comparable to Gaussian kernels with the optimized hyperparameter.
The quantum core method is one of the most important methods in quantum machine learning.However, the number of features used for quantum nuclei is limited to a few dozen features.The block product state structure is used as a quantum feature map and the implementation ofprogrammable gate matrices is demonstrated. The relevance of these studies lies in the mathematicaland software modeling and implementation of a quantum computing system as part of thedevelopment of the implementation of a quantum core on FPGA for solving classes of problems ofa classical nature. The scientific novelty of this research area is the development of a hybrid simulatorof the quantum cores of a central processing unit (CPU) and a programmable logic integratedcircuit (FPGA) several orders of magnitude faster than a conventional quantum computingsimulator. This joint development of the implemented quantum core and its efficient FPGA implementation allowed numerical simulation of the quantum core based on gates in terms of inputfeatures, up to 780-dimensional features using 4000 samples. We applied the quantum kernel toimage classification problems using the Fashion-MNIST dataset and showed that the quantumkernel is comparable to Gaussian kernels with optimized throughput. The analysis of the work inthis field has shown that a new qualitative level has now been reached, opening up promising opportunitiesfor the implementation of multi-qubit quantum computing. The prospects for implementationand development are connected not only with technological capabilities, but also with solvingthe issues of building effective quantum systems for solving actual mathematical problems,cryptography problems and control (optimization) problems.
This research explores quantum machine learning for image classification, comparing classical and quantum models. A classical convolutional neural network (CNN), based on the LeNet architecture, achieved 99.12% accuracy on MNIST, outperforming a quantum CNN, which attained 93.30%. Quantum encoders applied to Fashion-MNIST reached 85.60%, while quantum support vector machine (SVM), implemented for binary classification, obtained 71.34%. The study integrates hybrid quantum-classical models, leveraging quantum circuits for feature extraction. A quantum autoencoder-based classifier was introduced, demonstrating efficient data compression and classification without additional qubits. Feature encoding using RX gates mapped classical data into quantum states, and the impact of parameterized quantum circuit structures on classification accuracy was analyzed. Results indicate that specific ansatz structures yield superior accuracy, highlighting the significance of quantum circuit design. While classical models currently outperform quantum counterparts, quantum approaches reduce trainable parameters and computational complexity. Limitations in current quantum hardware, including noise and scalability, restrict performance. However, advancements in error mitigation, quantum gate efficiency, and scalable quantum architecture could bridge the gap with classical methods. These quantum techniques hold potential in aerospace applications, such as satellite image classification, anomaly detection in remote sensing, and real-time processing of high-dimensional image data. This study underscores the growing role of quantum circuits in machine learning, particularly in feature extraction and classification, suggesting that future quantum hardware could unlock new capabilities in end-to-end learning beyond hybrid approaches.
Quantum machine learning is a new field of study that aims to apply the advantages of quantum computing, such as superposition, which is one of the intriguing properties that could speed up computation, to machine learning. Like classical machine learning models, quantum machine learning models can learn from specific input data and perform specific prediction tasks. However, quantum machine learning models are currently in the form of quantum circuits with parameterizable gates. In this paper, the implementation of a quantum classification model is investigated using the two most well-known quantum machine learning development tools: Cirq with TensorFlow Quantum (TFQ) and Qiskit with PyTorch. The quantum classification circuit is trained to recognize images of handwritten digits using the MNIST dataset. However, because the quantum computer is still in development and is difficult to access and use, quantum simulators are the best alternative for the time being. The performance of the quantum classification model implemented by the two development tools is then compared in this paper experimentally using quantum simulators on two different hardware configurations. In addition, the experimental setups differ in the number of input qubits used to store the image’s classical pixel values. Finally, the wall time and CPU time used to run the training process, as well as classification accuracy, are examined. In terms of accuracy, Qiskit with PyTorch outperforms Cirq with TFQ only in the lower number of qubits but the results are similar in the higher number of qubits. The experiment results in terms of run-time are highly different. From the result, we find that Cirq is noticeably faster than Qiskit in every experiment by at least 90 times.
Quantum processors may enhance machine learning by mapping high-dimensional data onto quantum systems for processing. Conventional feature maps, for encoding data onto a quantum circuit are currently impractical, as the number of entangling gates scales quadratically with the dimension of the dataset and the number of qubits. In this work, we introduce a quantum feature map designed to handle high-dimensional data with a significantly reduced number of qubits and entangling operations. Our approach preserves essential data characteristics while promoting computational efficiency, as evidenced by extensive experiments on benchmark datasets that demonstrate a marked improvement in both accuracy and resource utilization when using our feature map as a kernel for characterization, as compared to state-of-the-art quantum feature maps. Our noisy simulation results, combined with lower resource requirements, highlight our map's ability to function within the constraints of noisy intermediate-scale quantum devices. Through numerical simulations and small-scale implementation on a superconducting circuit quantum computing platform, we demonstrate that our scheme performs on par or better than a set of classical algorithms for classification. While quantum kernels are typically stymied by exponential concentration, our approach is affected with a slower rate with respect to both the number of qubits and features, which allows practical applications to remain within reach. Our findings herald a promising avenue for the practical implementation of quantum machine learning algorithms on near future quantum computing platforms.
Classical convolutional neural networks (CNNs) have achieved notable success in image classification but face challenges in scalability, interpretability, and computational cost. With the growing availability of Noisy Intermediate-Scale Quantum (NISQ) devices, hybrid quantum-classical models offer a promising alternative by leveraging quantum parallelism and entanglement. In this work, we present a hybrid Quantum Convolutional Neural Network (QCNN) that integrates quantum convolutional layers into classical image classification pipeline for the MNIST dataset. Our architecture features a modular, low-depth Quantum Kernel Convolution (QKC) design suitable for near-term hardware. We implement the system using Qiskit and evaluate in terms of classification accuracy, circuit efficiency, and integration feasibility. Our results demonstrate that (i) the hybrid QCNN achieves similar accuracy to classical models while reducing the number of classical parameters, and (ii) quantum layers can successfully perform dimensionality reduction through entanglement-based pooling. This study highlights the potential of hybrid QCNN as a practical quantum-enhanced model for real-world image recognition tasks.
Quantum-enhanced machine learning is a rapidly evolving field that aims to leverage the unique properties of quantum mechanics to enhance classical machine learning. However, the practical applicability of these methods remains an open question, particularly beyond the context of specifically crafted toy problems, and given the current limitations of quantum hardware. This study focuses on quantum kernel methods in the context of classification tasks. In particular, it examines the performance of quantum kernel estimation and quantum kernel training (QKT) in connection with two quantum feature mappings, namely, ZZFeatureMap and CovariantFeatureMap. Remarkably, these feature maps have been proposed in the literature under the conjecture of possible near-term quantum advantage and have shown promising performance in ad hoc datasets. This study aims to evaluate their versatility and generalization capabilities in a more general benchmark, encompassing both artificial and established reference datasets. Classical machine learning methods, specifically support vector machines and logistic regression, are also incorporated as baseline comparisons. Experimental results indicate that quantum methods exhibit varying performance across different datasets. Despite outperforming classical methods in ad hoc datasets, mixed results are obtained for the general case among standard classical benchmarks. The experimental data call into question a general added value of applying QKT optimization, for which the additional computational cost does not necessarily translate into improved classification performance. Instead, it is suggested that a careful choice of the quantum feature map in connection with proper hyperparameterization may prove more effective.