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/0512057 · Physical Review A

Quantum algorithm for optical-template recognition with noise filtering

Gernot Schaller, Ralf Schützhold

Published Jul 7, 2006• 21 citations
arXivHTMLPDF

Abstract

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.

DOI
10.1103/physreva.74.012303

Related papers

Quantum-Enhanced Barcode Decoding and Pattern Recognition

Leonardo Banchi, Quntao Zhuang, Stefano Pirandola

Quantum hypothesis testing is one of the most fundamental problems in quantum information theory, with crucial implications in areas like quantum sensing, where it has been used to prove quantum advantage in a series of binary photonic protocols, e.g., for target detection or memory cell readout. In this work, we generalize this theoretical model to the multipartite setting of barcode decoding and pattern recognition. We start by defining a digital image as an array or grid of pixels, each pixel corresponding to an ensemble of quantum channels. Specializing each pixel to a black and white alphabet, we naturally define an optical model of a barcode. In this scenario, we show that the use of quantum entangled sources, combined with suitable measurements and data processing, greatly outperforms classical coherent-state strategies for the tasks of barcode data decoding and classification of black and white patterns. Moreover, introducing relevant bounds, we show that the problem of pattern recognition is significantly simpler than barcode decoding, as long as the minimum Hamming distance between images from different classes is large enough. Finally, we theoretically demonstrate the advantage of using quantum sensors for pattern recognition with the nearest-neighbor classifier, a supervised learning algorithm, and numerically verify this prediction for handwritten digit classification.

arXiv:2010.03594•Physical Review Applied•Dec 8, 2020•31 citations

A Hybrid Quantum Image-Matching Algorithm

Guo-Qiang Shu, Zheng Shan, Shiqin Di +2 more

Image matching is an important research topic in computer vision and image processing. However, existing quantum algorithms mainly focus on accurate matching between template pixels, and are not robust to changes in image location and scale. In addition, the similarity calculation of the matching process is a fundamentally important issue. Therefore, this paper proposes a hybrid quantum algorithm, which uses the robustness of SIFT (scale-invariant feature transform) to extract image features, and combines the advantages of quantum exponential storage and parallel computing to represent data and calculate feature similarity. Finally, the quantum amplitude estimation is used to extract the measurement results and realize the quadratic acceleration of calculation. The experimental results show that the matching effect of this algorithm is better than the existing classical architecture. Our hybrid algorithm broadens the application scope and field of quantum computing in image processing.

Entropy•Dec 13, 2022•3 citations

Towards quantum template matching

Daniel Curtis, David Meyer

We consider the problem of locating a template as a subimage of a larger image. Computing the maxima of the correlation function solves this problem classically. Since the correlation can be calculated with the Fourier transform this problem is a good candidate for a superior quantum algorithmic solution. We outline how such an algorithm would work.

Proceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIE•Feb 3, 2004•43 citations

Pattern recognition on a quantum computer

Ralf Schützhold

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.

arXiv:quant-ph/0208063•Physical Review A•Jun 26, 2003•97 citations

Quantum face recognition protocol with ghost imaging

Vahid Salari, Dilip Paneru, Erhan Sağlamyürek +6 more

Face recognition is one of the most ubiquitous examples of pattern recognition in machine learning, with numerous applications in security, access control, and law enforcement, among many others. Pattern recognition with classical algorithms requires significant computational resources, especially when dealing with high-resolution images in an extensive database. Quantum algorithms have been shown to improve the efficiency and speed of many computational tasks, and as such, they could also potentially improve the complexity of the face recognition process. Here, we propose a quantum machine learning algorithm for pattern recognition based on quantum principal component analysis, and quantum independent component analysis. A novel quantum algorithm for finding dissimilarity in the faces based on the computation of trace and determinant of a matrix (image) is also proposed. The overall complexity of our pattern recognition algorithm is [Formula: see text]-N is the image dimension. As an input to these pattern recognition algorithms, we consider experimental images obtained from quantum imaging techniques with correlated photons, e.g. "interaction-free" imaging or "ghost" imaging. Interfacing these imaging techniques with our quantum pattern recognition processor provides input images that possess a better signal-to-noise ratio, lower exposures, and higher resolution, thus speeding up the machine learning process further. Our fully quantum pattern recognition system with quantum algorithm and quantum inputs promises a much-improved image acquisition and identification system with potential applications extending beyond face recognition, e.g., in medical imaging for diagnosing sensitive tissues or biology for protein identification.

arXiv:2110.10088•Scientific Reports•Feb 10, 2023•25 citations

Quantum pattern recognition

Pepijn W. H. Pinkse, S.A. Goorden, Marcel Horstmann +2 more

Summary form only given. In quantum cryptography, non-cloning properties of quantum states are exploited to achieve quantum security. At the same time, typically one optical mode is used, for instance that of a single-mode optical fiber, effectively reducing the problem to a one-dimensional system. Only recently have researchers begun to exploit higher dimensions for quantum cryptography [1]. High dimensional spaces appear naturally in imaging applications.We here experimentally investigate the question if it is possible to recognize an arbitrary pattern in a physical object using much fewer photons than the complexity of the pattern. Theoretically it has already been proposed to use a quantum computer for pattern recognition and that this can be achieved with very few photons [2]. To avoid using a quantum computer, we exploit a spatial light modulator, which can map a single incoming optical mode on thousands outgoing optical modes in a programmable way. In this way, a weak light pulse containing only a few or even a single photon can be distributed over the high number of pixels of a complex 2-dimensional image. The inverse is just as feasible: a known complex pattern can be mapped onto a single mode. We use this principle to analyze the light from a physical object when illuminated with, e.g., a plane wave. After reflection of or transmission through the object under investigation, the response can be projected onto a single mode. The signal in that mode can be analyzed with the standard repertoire of quantum optical measurements, determining, e.g., the field amplitude, the intensity or the number of photons.We use coherent pulses of light which have mean photon numbers much smaller than the thousands of modes of the complex image. We introduce the parameter S=K/n as the ratio of the number of modes, K, of the response field pattern and the number of photons, n, that is used for the illumination. This measurement is in the quantum domain if S>>1. We read out objects with S=4, well in the quantum regime. The method can be extended by preshaping the illumination light, with applications in authentication of physical objects [3,4].

Conference on Lasers and Electro-Optics Europe & European Quantum Electronics Conference (CLEO/Europe-EQEC)•May 1, 2013•12 citations
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 2n\ifmmode×\else\texttimes\fi2m{2}^{n}\ifmmode\times\else\texttimes\fi{}{2}^{m}2n\ifmmode×\else\texttimes\fi2m 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×\else\texttimes\fi512512\ifmmode\times\else\texttimes\fi{}512512\ifmmode×\else\texttimes\fi512 pixels, we have numerically simulated the unitary operations in order to demonstrate the applicability of the algorithm and to analyze its fault tolerance.
Quantum hypothesis testing is one of the most fundamental problems in quantum information theory, with crucial implications in areas like quantum sensing, where it has been used to prove quantum advantage in a series of binary photonic protocols, e.g., for target detection or memory cell readout. In this work, we generalize this theoretical model to the multipartite setting of barcode decoding and pattern recognition. We start by defining a digital image as an array or grid of pixels, each pixel corresponding to an ensemble of quantum channels. Specializing each pixel to a black and white alphabet, we naturally define an optical model of a barcode. In this scenario, we show that the use of quantum entangled sources, combined with suitable measurements and data processing, greatly outperforms classical coherent-state strategies for the tasks of barcode data decoding and classification of black and white patterns. Moreover, introducing relevant bounds, we show that the problem of pattern recognition is significantly simpler than barcode decoding, as long as the minimum Hamming distance between images from different classes is large enough. Finally, we theoretically demonstrate the advantage of using quantum sensors for pattern recognition with the nearest-neighbor classifier, a supervised learning algorithm, and numerically verify this prediction for handwritten digit classification.
Image matching is an important research topic in computer vision and image processing. However, existing quantum algorithms mainly focus on accurate matching between template pixels, and are not robust to changes in image location and scale. In addition, the similarity calculation of the matching process is a fundamentally important issue. Therefore, this paper proposes a hybrid quantum algorithm, which uses the robustness of SIFT (scale-invariant feature transform) to extract image features, and combines the advantages of quantum exponential storage and parallel computing to represent data and calculate feature similarity. Finally, the quantum amplitude estimation is used to extract the measurement results and realize the quadratic acceleration of calculation. The experimental results show that the matching effect of this algorithm is better than the existing classical architecture. Our hybrid algorithm broadens the application scope and field of quantum computing in image processing.
Face recognition is one of the most ubiquitous examples of pattern recognition in machine learning, with numerous applications in security, access control, and law enforcement, among many others. Pattern recognition with classical algorithms requires significant computational resources, especially when dealing with high-resolution images in an extensive database. Quantum algorithms have been shown to improve the efficiency and speed of many computational tasks, and as such, they could also potentially improve the complexity of the face recognition process. Here, we propose a quantum machine learning algorithm for pattern recognition based on quantum principal component analysis, and quantum independent component analysis. A novel quantum algorithm for finding dissimilarity in the faces based on the computation of trace and determinant of a matrix (image) is also proposed. The overall complexity of our pattern recognition algorithm is [Formula: see text]-N is the image dimension. As an input to these pattern recognition algorithms, we consider experimental images obtained from quantum imaging techniques with correlated photons, e.g. "interaction-free" imaging or "ghost" imaging. Interfacing these imaging techniques with our quantum pattern recognition processor provides input images that possess a better signal-to-noise ratio, lower exposures, and higher resolution, thus speeding up the machine learning process further. Our fully quantum pattern recognition system with quantum algorithm and quantum inputs promises a much-improved image acquisition and identification system with potential applications extending beyond face recognition, e.g., in medical imaging for diagnosing sensitive tissues or biology for protein identification.
Summary form only given. In quantum cryptography, non-cloning properties of quantum states are exploited to achieve quantum security. At the same time, typically one optical mode is used, for instance that of a single-mode optical fiber, effectively reducing the problem to a one-dimensional system. Only recently have researchers begun to exploit higher dimensions for quantum cryptography [1]. High dimensional spaces appear naturally in imaging applications.We here experimentally investigate the question if it is possible to recognize an arbitrary pattern in a physical object using much fewer photons than the complexity of the pattern. Theoretically it has already been proposed to use a quantum computer for pattern recognition and that this can be achieved with very few photons [2]. To avoid using a quantum computer, we exploit a spatial light modulator, which can map a single incoming optical mode on thousands outgoing optical modes in a programmable way. In this way, a weak light pulse containing only a few or even a single photon can be distributed over the high number of pixels of a complex 2-dimensional image. The inverse is just as feasible: a known complex pattern can be mapped onto a single mode. We use this principle to analyze the light from a physical object when illuminated with, e.g., a plane wave. After reflection of or transmission through the object under investigation, the response can be projected onto a single mode. The signal in that mode can be analyzed with the standard repertoire of quantum optical measurements, determining, e.g., the field amplitude, the intensity or the number of photons.We use coherent pulses of light which have mean photon numbers much smaller than the thousands of modes of the complex image. We introduce the parameter S=K/n as the ratio of the number of modes, K, of the response field pattern and the number of photons, n, that is used for the illumination. This measurement is in the quantum domain if S>>1. We read out objects with S=4, well in the quantum regime. The method can be extended by preshaping the illumination light, with applications in authentication of physical objects [3,4].