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

Optimisation of Variational Quantum Classifier by Controlling Feature map and Ansatz Repetitions

Shakeel ur Rahman, Saqib Yousaf

Published Nov 14, 2025• 0 citations
Publisher

Abstract

Abstract Variational Quantum Classifiers are hybrid algorithms with parameterized circuits, that replicate the neural network structure using both quantum and classical resources. Feature map and Ansatz (parameterized circuit) are the major parts of the algorithm for embedding classical data into quantum states and creating a suitable state that minimizes the cost function with the update of parameters, respectively. The number of times the feature map and the Ansatz are applied in the circuit, greatly affects the accuracy. We propose the optimal number of repetitions of the feature map and Ansatz that will help drive the maximum advantage out of VQCs. With the right combination of repetitions, one can fine-tune the model better.

DOI
10.21203/rs.3.rs-8053203/v1

Related papers

Quantum Machine Learning: A Comparative Study of Variational Quantum Classifier with Classical Classifier Algorithms

Madona Alhalabi, Hafiz M. Asif, Hesham Alhalabi

With the advancement of quantum computing in the Noisy Intermediate-Scale Quantum (NISQ) era, hybrid quantum-classical algorithms have emerged as promising approaches for addressing certain machine learning tasks. This study investigates the Variational Quantum Classifier (VQC), a hybrid model that integrates parameterized quantum circuits with classical optimization routines, implemented via IBM’s Qiskit framework. We provide a detailed account of the VQC architecture, including feature encoding, ansatz construction, and optimization methodology. To assess its performance, we conduct a comparative analysis between VQC and classical Support Vector Classifiers (SVC) across synthetic and real-world datasets, including Iris and a binary-filtered version of MNIST. Experimental results reveal that classical models consistently achieve higher accuracy and faster training times. However, the VQC demonstrates functional viability, particularly under noise-free conditions and reduced-dimensionality settings. These findings underscore the current limitations of quantum models while highlighting the potential of VQC as a proof-of-concept for quantum-enhanced learning as quantum hardware matures.

International Symposium on Networks, Computers and Communications (ISNCC)•Oct 27, 2025•2 citations

Parameterized Quantum Circuits as Feature Maps: Representation Quality and Readout Effects in Multispectral Land-Cover Classification

Ralntion Komini, Aikaterini Mandilara, Georgios Maragkopoulos +1 more

We investigate variational quantum classifiers (VQCs) for land-cover classification from multispectral satellite imagery, adopting a feature-map perspective in which the quantum circuit defines a nonlinear data embedding while the readout determines how this representation is exploited. Using the EuroSAT-MS dataset, we perform a systematic one-vs-one evaluation across all class pairs under a controlled experimental protocol, comparing classical baselines (logistic regression, SVMs, neural networks) with VQCs employing both linear readout and quantum-kernel SVM strategies. Our results show that, while VQCs with linear readout do not outperform strong classical baselines such as RBF-SVM, the same trained quantum feature map can significantly improve performance when reused within a kernel-based decision framework. A qubit-count sweep further reveals saturation effects consistent with the mismatch between exponential Hilbert space dimension and linear parameter scaling. Overall, our findings highlight that the effectiveness of quantum models depends critically on the interplay between representation and readout, and that meaningful gains may arise from combining learned quantum feature maps with classical decision mechanisms rather than seeking direct replacement of classical models.

quant-pharXiv:2604.26675•IEEE Journal of Selected Topics in Applied Earth Observations and Remote Sensing•Apr 30, 2026•1 citation

Variational Quantum Neural Networks (VQNNS) in Image Classification

Meghashrita Das, Tirupati Bolisetti

Quantum machine learning has established as an interdisciplinary field to overcome limitations of classical machine learning and neural networks. This is a field of research which can prove that quantum computers are able to solve problems with complex correlations between inputs that can be hard for classical computers. This suggests that learning models made on quantum computers may be more powerful for applications, potentially faster computation and better generalization on less data. The objective of this paper is to investigate how training of quantum neural network (QNNs) can be done using quantum optimization algorithms for improving the performance and time complexity of QNNs. A classical neural network can be partially quantized to create a hybrid quantum-classical neural network which is used mainly in classification and image recognition. In this paper, a QNN structure is made where a variational parameterized circuit is incorporated as an input layer named as Variational Quantum Neural Network (VQNNs). We encode the cost function of QNNs onto relative phases of a superposition state in the Hilbert space of the network parameters. The parameters are tuned with an iterative quantum approximate optimisation (QAOA) mixer and problem hamiltonians. VQNNs is experimented with MNIST digit recognition (less complex) and crack image classification datasets (more complex) which converges the computation in lesser time than QNN with decent training accuracy.

arXiv:2303.05860•Mar 10, 2023•19 citations

Analog Quantum Variational Embedding Classifier

Rui Liang Yang, Samuel Bosch, Bobak T. Kiani +2 more

Quantum machine learning has the potential to provide powerful algorithms for artificial intelligence. The pursuit of quantum advantage in quantum machine learning is an active area of research. For current noisy intermediate-scale quantum computers, various quantum-classical hybrid algorithms have been proposed. One such previously proposed hybrid algorithm is a gate-based variational embedding classifier, which is composed of a classical neural network and a parameterized gate-based quantum circuit. We propose a quantum variational embedding classifier based on an analog quantum computer, where control signals vary continuously in time: our particular focus is an implementation using quantum annealers. In our algorithm, the classical data are transformed into the parameters of the time-varying Hamiltonian of the analog quantum computer by a linear transformation. The nonlinearity needed for a nonlinear classification problem is purely provided by the analog quantum computer through the nonlinear dependence of the final quantum state on the control parameters of the Hamiltonian. We perform numerical simulations that demonstrate the effectiveness of our algorithm for performing binary and multiclass classification on linearly inseparable datasets such as concentric circles and MNIST digits. Our classifier can reach accuracy comparable with that of the best classical classifiers. We find that the performance of our classifier can be increased by increasing the number of qubits, until the performance saturates and fluctuates. Moreover, the number of optimization parameters of our classifier scales linearly with the number of qubits. The increase of the number of training parameters when the size of our model increases is therefore not as fast as that of a neural network. Our algorithm presents the possibility of using current quantum annealers for solving practical machine-learning problems, and it could also be useful to explore quantum advantage in quantum machine learning.

arXiv:2211.02748•Physical Review Applied•May 5, 2023•13 citations

New quantum neural network designs

Felix Petitzon

Quantum computers promise improving machine learning. We investigated the performance of new quantum neural network designs. Quantum neural networks currently employed rely on a feature map to encode the input into a quantum state. This state is then evolved via a parameterized variational circuit. Finally, a measurement is performed and post-processed on a classical computer to extract the prediction of the quantum model. We develop a new technique, where we merge feature map and variational circuit into a single parameterized circuit and post-process the results using a classical neural network. On a variety of real and generated datasets, we show that the new, combined approach outperforms the separated feature map & variational circuit method. We achieve lower loss, better accuracy, and faster convergence.

arXiv:2203.07872•Mar 12, 2022•4 citations

Generating quantum feature maps for SVM classifier

Bang-Shien Chen, Jann–Long Chern

We present and compare two methods of generating quantum feature maps for quantum-enhanced support vector machine, a classifier based on kernel method, by which we can access high dimensional Hilbert space efficiently. The first method is a genetic algorithm with multi-objective fitness function using penalty method, which incorporates maximizing the accuracy of classification and minimizing the gate cost of quantum feature map circuit. The second method uses variational quantum circuit, focusing on how to contruct the ansatz based on unitary matrix decomposition. Numerical results and comparisons are presented to demonstrate how the fitness fuction reduces gate cost while remaining high accuracy and conducting circuit through unitary matrix obtains even better performance. In particular, we propose some thoughts on reducing and optimizing the gate cost of a circuit while remaining perfect accuracy.

arXiv:2207.11449•Jul 23, 2022•11 citations
Abstract Variational Quantum Classifiers are hybrid algorithms with parameterized circuits, that replicate the neural network structure using both quantum and classical resources. Feature map and Ansatz (parameterized circuit) are the major parts of the algorithm for embedding classical data into quantum states and creating a suitable state that minimizes the cost function with the update of parameters, respectively. The number of times the feature map and the Ansatz are applied in the circuit, greatly affects the accuracy. We propose the optimal number of repetitions of the feature map and Ansatz that will help drive the maximum advantage out of VQCs. With the right combination of repetitions, one can fine-tune the model better.
With the advancement of quantum computing in the Noisy Intermediate-Scale Quantum (NISQ) era, hybrid quantum-classical algorithms have emerged as promising approaches for addressing certain machine learning tasks. This study investigates the Variational Quantum Classifier (VQC), a hybrid model that integrates parameterized quantum circuits with classical optimization routines, implemented via IBM’s Qiskit framework. We provide a detailed account of the VQC architecture, including feature encoding, ansatz construction, and optimization methodology. To assess its performance, we conduct a comparative analysis between VQC and classical Support Vector Classifiers (SVC) across synthetic and real-world datasets, including Iris and a binary-filtered version of MNIST. Experimental results reveal that classical models consistently achieve higher accuracy and faster training times. However, the VQC demonstrates functional viability, particularly under noise-free conditions and reduced-dimensionality settings. These findings underscore the current limitations of quantum models while highlighting the potential of VQC as a proof-of-concept for quantum-enhanced learning as quantum hardware matures.
We investigate variational quantum classifiers (VQCs) for land-cover classification from multispectral satellite imagery, adopting a feature-map perspective in which the quantum circuit defines a nonlinear data embedding while the readout determines how this representation is exploited. Using the EuroSAT-MS dataset, we perform a systematic one-vs-one evaluation across all class pairs under a controlled experimental protocol, comparing classical baselines (logistic regression, SVMs, neural networks) with VQCs employing both linear readout and quantum-kernel SVM strategies. Our results show that, while VQCs with linear readout do not outperform strong classical baselines such as RBF-SVM, the same trained quantum feature map can significantly improve performance when reused within a kernel-based decision framework. A qubit-count sweep further reveals saturation effects consistent with the mismatch between exponential Hilbert space dimension and linear parameter scaling. Overall, our findings highlight that the effectiveness of quantum models depends critically on the interplay between representation and readout, and that meaningful gains may arise from combining learned quantum feature maps with classical decision mechanisms rather than seeking direct replacement of classical models.
Quantum machine learning has established as an interdisciplinary field to overcome limitations of classical machine learning and neural networks. This is a field of research which can prove that quantum computers are able to solve problems with complex correlations between inputs that can be hard for classical computers. This suggests that learning models made on quantum computers may be more powerful for applications, potentially faster computation and better generalization on less data. The objective of this paper is to investigate how training of quantum neural network (QNNs) can be done using quantum optimization algorithms for improving the performance and time complexity of QNNs. A classical neural network can be partially quantized to create a hybrid quantum-classical neural network which is used mainly in classification and image recognition. In this paper, a QNN structure is made where a variational parameterized circuit is incorporated as an input layer named as Variational Quantum Neural Network (VQNNs). We encode the cost function of QNNs onto relative phases of a superposition state in the Hilbert space of the network parameters. The parameters are tuned with an iterative quantum approximate optimisation (QAOA) mixer and problem hamiltonians. VQNNs is experimented with MNIST digit recognition (less complex) and crack image classification datasets (more complex) which converges the computation in lesser time than QNN with decent training accuracy.
Quantum machine learning has the potential to provide powerful algorithms for artificial intelligence. The pursuit of quantum advantage in quantum machine learning is an active area of research. For current noisy intermediate-scale quantum computers, various quantum-classical hybrid algorithms have been proposed. One such previously proposed hybrid algorithm is a gate-based variational embedding classifier, which is composed of a classical neural network and a parameterized gate-based quantum circuit. We propose a quantum variational embedding classifier based on an analog quantum computer, where control signals vary continuously in time: our particular focus is an implementation using quantum annealers. In our algorithm, the classical data are transformed into the parameters of the time-varying Hamiltonian of the analog quantum computer by a linear transformation. The nonlinearity needed for a nonlinear classification problem is purely provided by the analog quantum computer through the nonlinear dependence of the final quantum state on the control parameters of the Hamiltonian. We perform numerical simulations that demonstrate the effectiveness of our algorithm for performing binary and multiclass classification on linearly inseparable datasets such as concentric circles and MNIST digits. Our classifier can reach accuracy comparable with that of the best classical classifiers. We find that the performance of our classifier can be increased by increasing the number of qubits, until the performance saturates and fluctuates. Moreover, the number of optimization parameters of our classifier scales linearly with the number of qubits. The increase of the number of training parameters when the size of our model increases is therefore not as fast as that of a neural network. Our algorithm presents the possibility of using current quantum annealers for solving practical machine-learning problems, and it could also be useful to explore quantum advantage in quantum machine learning.
Quantum computers promise improving machine learning. We investigated the performance of new quantum neural network designs. Quantum neural networks currently employed rely on a feature map to encode the input into a quantum state. This state is then evolved via a parameterized variational circuit. Finally, a measurement is performed and post-processed on a classical computer to extract the prediction of the quantum model. We develop a new technique, where we merge feature map and variational circuit into a single parameterized circuit and post-process the results using a classical neural network. On a variety of real and generated datasets, we show that the new, combined approach outperforms the separated feature map & variational circuit method. We achieve lower loss, better accuracy, and faster convergence.
We present and compare two methods of generating quantum feature maps for quantum-enhanced support vector machine, a classifier based on kernel method, by which we can access high dimensional Hilbert space efficiently. The first method is a genetic algorithm with multi-objective fitness function using penalty method, which incorporates maximizing the accuracy of classification and minimizing the gate cost of quantum feature map circuit. The second method uses variational quantum circuit, focusing on how to contruct the ansatz based on unitary matrix decomposition. Numerical results and comparisons are presented to demonstrate how the fitness fuction reduces gate cost while remaining high accuracy and conducting circuit through unitary matrix obtains even better performance. In particular, we propose some thoughts on reducing and optimizing the gate cost of a circuit while remaining perfect accuracy.