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

Quantum Computing for Pattern Classification

Maria Schuld, Ilya Sinayskiy, Francesco Petruccione

Published Jan 1, 2014• 85 citations
Publisher
DOI
10.1007/978-3-319-13560-1_17

Related papers

Quantum computing for pattern classification

Maria Schuld, Ilya Sinayskiy, Francesco Petruccione

It is well known that for certain tasks, quantum computing outperforms classical computing. A growing number of contributions try to use this advantage in order to improve or extend classical machine learning algorithms by methods of quantum information theory. This paper gives a brief introduction into quantum machine learning using the example of pattern classification. We introduce a quantum pattern classification algorithm that draws on Trugenberger's proposal for measuring the Hamming distance on a quantum computer (CA Trugenberger, Phys Rev Let 87, 2001) and discuss its advantages using handwritten digit recognition as from the MNIST database.

arXiv:1412.3646•Dec 11, 2014•4 citations

Quantum Pattern Recognition

Davide Pastorello

Machine learning•Dec 16, 2022•0 citations

Self-Organizing Quantum Neural Network

Ri‐Gui Zhou, Hongyuan Zheng, Nan Jiang +1 more

This paper combines quantum computation with conventional artificial neural network theory to present a novel network - self-organizing quantum neural network (SOQNN) that can perform pattern classification self-organizationally and automatically through quantum competitive process. It does not need to prestore some given patterns but can classify input patterns with higher classification rapidity than that of classical neural networks(CNN).Further, SOQNN make the analogical pattern win easily in the next quantum competitive process by modifying the value of the quantum register(QR) corresponding to the pattern classified.

International Joint Conference on Neural Networks (IJCNN)•Jan 1, 2006•8 citations

Quantum Pattern Recognition

Péter Wittek

Elsevier eBooks•Jan 1, 2014•3 citations

Negational symmetry of quantum neural networks for binary pattern classification

Nanqing Dong, Michael Kampffmeyer, Irina D. Voiculescu +1 more

Although quantum neural networks (QNNs) have shown promising results in solving simple machine learning tasks recently, the behavior of QNNs in binary pattern classification is still underexplored. In this work, we find that QNNs have an Achilles’ heel in binary pattern classification. To illustrate this point, we provide a theoretical insight into the properties of QNNs by presenting and analyzing a new form of symmetry embedded in a family of QNNs with full entanglement , which we term negational symmetry . Due to negational symmetry, QNNs can not differentiate between a quantum binary signal and its negational counterpart. We empirically evaluate the negational symmetry of QNNs in binary pattern classification tasks using Google’s quantum computing framework. Both theoretical and experimental results suggest that negational symmetry is a fundamental property of QNNs, which is not shared by classical models. Our findings also imply that negational symmetry is a double-edged sword in practical quantum applications.

arXiv:2105.09580•Pattern Recognition•Apr 27, 2022•6 citations

PATTERN CLASSIFICATION BASED ON QUANTUM NEURAL NETWORKS: A CASE STUDY

N.B. Karayiannis, R. Kretzschmar, Hans Richner

WORLD SCIENTIFIC eBooks•Nov 1, 2001•5 citations
It is well known that for certain tasks, quantum computing outperforms classical computing. A growing number of contributions try to use this advantage in order to improve or extend classical machine learning algorithms by methods of quantum information theory. This paper gives a brief introduction into quantum machine learning using the example of pattern classification. We introduce a quantum pattern classification algorithm that draws on Trugenberger's proposal for measuring the Hamming distance on a quantum computer (CA Trugenberger, Phys Rev Let 87, 2001) and discuss its advantages using handwritten digit recognition as from the MNIST database.
This paper combines quantum computation with conventional artificial neural network theory to present a novel network - self-organizing quantum neural network (SOQNN) that can perform pattern classification self-organizationally and automatically through quantum competitive process. It does not need to prestore some given patterns but can classify input patterns with higher classification rapidity than that of classical neural networks(CNN).Further, SOQNN make the analogical pattern win easily in the next quantum competitive process by modifying the value of the quantum register(QR) corresponding to the pattern classified.
Although quantum neural networks (QNNs) have shown promising results in solving simple machine learning tasks recently, the behavior of QNNs in binary pattern classification is still underexplored. In this work, we find that QNNs have an Achilles’ heel in binary pattern classification. To illustrate this point, we provide a theoretical insight into the properties of QNNs by presenting and analyzing a new form of symmetry embedded in a family of QNNs with full entanglement , which we term negational symmetry . Due to negational symmetry, QNNs can not differentiate between a quantum binary signal and its negational counterpart. We empirically evaluate the negational symmetry of QNNs in binary pattern classification tasks using Google’s quantum computing framework. Both theoretical and experimental results suggest that negational symmetry is a fundamental property of QNNs, which is not shared by classical models. Our findings also imply that negational symmetry is a double-edged sword in practical quantum applications.