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

Lecture notes in computer science

Simple Quantum Circuits for Data Classification

Joanna Wiśniewska, Marek Sawerwain

Published Jan 1, 2020• 1 citation
Publisher
DOI
10.1007/978-3-030-41964-6_34

Related papers

Incremental Data-Uploading for Full-Quantum Classification

Maniraman Periyasamy, Nico Meyer, Christian Ufrecht +3 more

The data representation in a machine-learning model strongly influences its performance. This becomes even more important for quantum machine learning models implemented on noisy intermediate scale quantum (NISQ) devices. Encoding high dimensional data into a quantum circuit for a NISQ device without any loss of information is not trivial and brings a lot of challenges. While simple encoding schemes (like single qubit rotational gates to encode high dimensional data) often lead to information loss within the circuit, complex encoding schemes with entanglement and data re-uploading lead to an increase in the encoding gate count. This is not well-suited for NISQ devices. This work proposes ‘incremental data-uploading’, a novel encoding pattern for high dimensional data that tackles these challenges. We spread the encoding gates for the feature vector of a given data point throughout the quantum circuit with parameterized gates in between them. This encoding pattern results in a better representation of data in the quantum circuit with a minimal pre-processing requirement. We show the efficiency of our encoding pattern on a classification task using the MNIST and Fashion-MNIST datasets, and compare different encoding methods via classification accuracy and the effective dimension of the model.

arXiv:2205.03057•IEEE International Conference on Quantum Computing and Engineering (QCE)•Sep 1, 2022•16 citations

Computing with Quantum Circuits

Daniele Cuomo

Springer theses•Jan 1, 2024•0 citations

Succinct quantum classification algorithm based on quantum circuit model

Xu Zhou, Daowen Qiu

Chinese Journal of Physics•Feb 17, 2023•5 citations

Simple quantum circuit for pattern recognition based on nearest mean classifier

Gharib Subhi Mahmoud Ahmed, Azeddine Messikh

Machine learning plays a key role in many applications such as data mining and image recognition.Classification is one subcategory under machine learning. In this paper we propose a simple quantum circuitbased on the nearest mean classifier to classified handwriting characters. Our circuit is a simplified circuit fromthe quantum support vector machine [Phys. Rev. Lett. 114, 140504 (2015)] which uses quantum matrix inversealgorithm to find optimal hyperplane that separated two different classes. In our case the hyperplane is foundusing projections and rotations on the Bloch sphere.

International Journal on Perceptive and Cognitive Computing•Nov 12, 2016•1 citation

Quantum Circuits and Computation

François Chapeau‐Blondeau

Springer eBooks•Jan 1, 2026•0 citations

Data classification by quantum radial-basis-function networks

Changpeng Shao

Radial-basis-function (RBF) networks are third-layered neural networks that are widely used in function approximation and data classification. Here we propose a quantum model for RBF networks. As in the classical case, we use radial basis functions as activation functions; quantum linear algebraic techniques and coherent states can be applied to implement these functions. We define the state of the weight as a tensor product of single-qubit states. This gives a simple approach to implement the quantum RBF network in quantum circuits. In this model we prove that training is almost quadratically faster than in the classical case. We demonstrate numerically that the quantum RBF network can solve binary classification problems as effectively as the classical RBF network, while the time and number of iterations used for training are much smaller.

arXiv:1910.08798•Physical Review A•Oct 30, 2020•16 citations
The data representation in a machine-learning model strongly influences its performance. This becomes even more important for quantum machine learning models implemented on noisy intermediate scale quantum (NISQ) devices. Encoding high dimensional data into a quantum circuit for a NISQ device without any loss of information is not trivial and brings a lot of challenges. While simple encoding schemes (like single qubit rotational gates to encode high dimensional data) often lead to information loss within the circuit, complex encoding schemes with entanglement and data re-uploading lead to an increase in the encoding gate count. This is not well-suited for NISQ devices. This work proposes ‘incremental data-uploading’, a novel encoding pattern for high dimensional data that tackles these challenges. We spread the encoding gates for the feature vector of a given data point throughout the quantum circuit with parameterized gates in between them. This encoding pattern results in a better representation of data in the quantum circuit with a minimal pre-processing requirement. We show the efficiency of our encoding pattern on a classification task using the MNIST and Fashion-MNIST datasets, and compare different encoding methods via classification accuracy and the effective dimension of the model.
Machine learning plays a key role in many applications such as data mining and image recognition.Classification is one subcategory under machine learning. In this paper we propose a simple quantum circuitbased on the nearest mean classifier to classified handwriting characters. Our circuit is a simplified circuit fromthe quantum support vector machine [Phys. Rev. Lett. 114, 140504 (2015)] which uses quantum matrix inversealgorithm to find optimal hyperplane that separated two different classes. In our case the hyperplane is foundusing projections and rotations on the Bloch sphere.
Radial-basis-function (RBF) networks are third-layered neural networks that are widely used in function approximation and data classification. Here we propose a quantum model for RBF networks. As in the classical case, we use radial basis functions as activation functions; quantum linear algebraic techniques and coherent states can be applied to implement these functions. We define the state of the weight as a tensor product of single-qubit states. This gives a simple approach to implement the quantum RBF network in quantum circuits. In this model we prove that training is almost quadratically faster than in the classical case. We demonstrate numerically that the quantum RBF network can solve binary classification problems as effectively as the classical RBF network, while the time and number of iterations used for training are much smaller.