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

arXiv:quant-ph/0208063 · Physical Review A

Pattern recognition on a quantum computer

Ralf Schützhold

Published Jun 26, 2003• 97 citations
arXivHTMLPDF

Abstract

By means of a simple example, it is demonstrated that the task of finding and identifying certain patterns in an otherwise (macroscopically) unstructured picture (dataset) can be accomplished efficiently by a quantum computer. Employing the powerful tool of the quantum Fourier transform, the proposed quantum algorithm exhibits an exponential speedup in comparison with its classical counterpart.

DOI
10.1103/physreva.67.062311

Related papers

Feature Selection based on QFT

Ri‐Gui Zhou, Nan Jiang, Shuqun Yang +1 more

Employing the powerful tool of the Quantum Fourier Transform, This paper presents an algorithm of pattern feature selection.Moreover.the proposed algorithm can perform feature selection tasks exponentially faster than its classical counterpart due to quantum parallelism. The features extracted by this algorithm are helpful to the pattern recognition or image recognition.And this paper proved the feasibility of the algorithm through theory deduction and validate serviceability by a simple pattern figure.

International Conference on Natural Computation (ICNC)•Jan 1, 2007•1 citation

Quantum Pattern Recognition for Local Sequence Alignment

Konstantinos P. Prousalis, Nikos Konofaos

Over the last two decades, there have been some challenging proposals on the field of pattern recognition by means of quantum technology. The application of them is considered for a popular branch of bioinformatics which analyzes massive amounts of sequence data for genes and proteins. More specific, the Smith-Waterman algorithm is studied under the more general term of local sequence alignment. The steps of this algorithm are totally reformed and powered by the quantum mechanics computing theory. The proposed method is based on R. Schützhold's pattern recognition quantum algorithm. A binary and unstructured data set is formed after the comparison of the sequences under alignment which is used by R. Schützhold's algorithm to identify and locate potential patterns. It is achieved with the aid of a spatial light modulator. The adopted quantum algorithm exhibits an exponential speed-up in comparison with its classical counterparts.

IEEE Globecom Workshops (GC Wkshps)•Dec 1, 2017•2 citations

Quantum-Enhanced Pattern Recognition in Complex Data

Jincheng Zhang

Quantum-enhanced pattern recognition aims to accelerate and improve the identification of subtle patterns and correlations in complex datasets, offering a potential paradigm shift compared to classical methods. This paper explores the application of quantum machine learning techniques to address challenges posed by high-dimensional data. We propose a novel quantum algorithm designed to efficiently explore the data space and uncover hidden correlations, ultimately surpassing classical approaches in specific tasks. The core mechanism centers around leveraging quantum superposition and entanglement to enhance data representation and pattern recognition capabilities. The paper will detail the proposed quantum algorithm, its potential advantages, and the challenges associated with its implementation.

•Aug 31, 2026•0 citations

Quantum algorithm for optical-template recognition with noise filtering

Gernot Schaller, Ralf Schützhold

We propose a probabilistic quantum algorithm that decides whether a monochrome picture matches a given template (or one out of a set of templates). As a major advantage to classical pattern recognition, the algorithm requires just a few incident photons and is thus suitable for very sensitive pictures (similar to the Elitzur-Vaidman problem). Furthermore, for a ${2}^{n}\ifmmode\times\else\texttimes\fi{}{2}^{m}$ image, $O(n+m)$ qubits are sufficient. Using the quantum Fourier transform, it is possible to improve the fault tolerance of the quantum algorithm by filtering out small-scale noise in the picture. For example images with $512\ifmmode\times\else\texttimes\fi{}512$ pixels, we have numerically simulated the unitary operations in order to demonstrate the applicability of the algorithm and to analyze its fault tolerance.

arXiv:quant-ph/0512057•Physical Review A•Jul 7, 2006•21 citations

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•8 citations

COMPARATIVE ANALYSIS OF MACHINE LEARNING ALGORITHMS IN CLASSICAL AND QUANTUM VERSIONS

HECTOR MARTINS MENEZES, MARIA DAS GRAÇAS JUNQUEIRA MACHADO TOMAZELA

Currently, pattern recognition is an extremely important activity in several fields.Approaches using artificial intelligence are one of the means of detecting these patterns and, therefore, optimizations in these methods are essential for such recognition to be carried out efficiently, both in processing time and in the hit rate.The field of machine learning, one of the paradigms of artificial intelligence, dates back to the beginnings of modern computing and in recent decades has been used intensively in pattern recognition.Despite the technical challenges related to the hardware, quantum computing has also been studied for a better performance of multiple computational tasks that are often unfeasible to be performed by classical algorithms.In this context, one of the fields that gain focus is the use of quantum circuits in machine learning algorithms.Thus, this work aims to compare the performance and complexity of classical algorithms, used in machine learning, to their quantum and hybrid versions, in order to identify the most efficient implementations.Another aspect to highlight is the feasibility of applying such models at certain scales, taking into account the limitations of current hardware.This will be done through a review of current academic production, followed by the development, implementation, testing, and analysis of the performance and complexity of both approaches.It is expected with this experiment that it will be possible to verify the effective possibility of using machine learning algorithms in their hybrid versions, either in current cases or in the near future.

CONTECSI - International Conference on Information Systems and Technology Management•Aug 4, 2022•0 citations
By means of a simple example, it is demonstrated that the task of finding and identifying certain patterns in an otherwise (macroscopically) unstructured picture (dataset) can be accomplished efficiently by a quantum computer. Employing the powerful tool of the quantum Fourier transform, the proposed quantum algorithm exhibits an exponential speedup in comparison with its classical counterpart.
Employing the powerful tool of the Quantum Fourier Transform, This paper presents an algorithm of pattern feature selection.Moreover.the proposed algorithm can perform feature selection tasks exponentially faster than its classical counterpart due to quantum parallelism. The features extracted by this algorithm are helpful to the pattern recognition or image recognition.And this paper proved the feasibility of the algorithm through theory deduction and validate serviceability by a simple pattern figure.
Over the last two decades, there have been some challenging proposals on the field of pattern recognition by means of quantum technology. The application of them is considered for a popular branch of bioinformatics which analyzes massive amounts of sequence data for genes and proteins. More specific, the Smith-Waterman algorithm is studied under the more general term of local sequence alignment. The steps of this algorithm are totally reformed and powered by the quantum mechanics computing theory. The proposed method is based on R. Schützhold's pattern recognition quantum algorithm. A binary and unstructured data set is formed after the comparison of the sequences under alignment which is used by R. Schützhold's algorithm to identify and locate potential patterns. It is achieved with the aid of a spatial light modulator. The adopted quantum algorithm exhibits an exponential speed-up in comparison with its classical counterparts.
Quantum-enhanced pattern recognition aims to accelerate and improve the identification of subtle patterns and correlations in complex datasets, offering a potential paradigm shift compared to classical methods. This paper explores the application of quantum machine learning techniques to address challenges posed by high-dimensional data. We propose a novel quantum algorithm designed to efficiently explore the data space and uncover hidden correlations, ultimately surpassing classical approaches in specific tasks. The core mechanism centers around leveraging quantum superposition and entanglement to enhance data representation and pattern recognition capabilities. The paper will detail the proposed quantum algorithm, its potential advantages, and the challenges associated with its implementation.
We propose a probabilistic quantum algorithm that decides whether a monochrome picture matches a given template (or one out of a set of templates). As a major advantage to classical pattern recognition, the algorithm requires just a few incident photons and is thus suitable for very sensitive pictures (similar to the Elitzur-Vaidman problem). Furthermore, for a ${2}^{n}\ifmmode\times\else\texttimes\fi{}{2}^{m}$ image, O(n+m)O(n+m)O(n+m) qubits are sufficient. Using the quantum Fourier transform, it is possible to improve the fault tolerance of the quantum algorithm by filtering out small-scale noise in the picture. For example images with $512\ifmmode\times\else\texttimes\fi{}512$ pixels, we have numerically simulated the unitary operations in order to demonstrate the applicability of the algorithm and to analyze its fault tolerance.
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.
Currently, pattern recognition is an extremely important activity in several fields.Approaches using artificial intelligence are one of the means of detecting these patterns and, therefore, optimizations in these methods are essential for such recognition to be carried out efficiently, both in processing time and in the hit rate.The field of machine learning, one of the paradigms of artificial intelligence, dates back to the beginnings of modern computing and in recent decades has been used intensively in pattern recognition.Despite the technical challenges related to the hardware, quantum computing has also been studied for a better performance of multiple computational tasks that are often unfeasible to be performed by classical algorithms.In this context, one of the fields that gain focus is the use of quantum circuits in machine learning algorithms.Thus, this work aims to compare the performance and complexity of classical algorithms, used in machine learning, to their quantum and hybrid versions, in order to identify the most efficient implementations.Another aspect to highlight is the feasibility of applying such models at certain scales, taking into account the limitations of current hardware.This will be done through a review of current academic production, followed by the development, implementation, testing, and analysis of the performance and complexity of both approaches.It is expected with this experiment that it will be possible to verify the effective possibility of using machine learning algorithms in their hybrid versions, either in current cases or in the near future.