Pattern recognition on a quantum computer
- 26 June 2003
- journal article
- research article
- Published by American Physical Society (APS) in Physical Review A
- Vol. 67 (6), 062311
- https://doi.org/10.1103/physreva.67.062311
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.Keywords
Other Versions
This publication has 12 references indexed in Scilit:
- Phase Transitions in Quantum Pattern RecognitionPhysical Review Letters, 2002
- Quantum learning and universal quantum matching machinePhysical Review A, 2002
- Probabilistic Quantum MemoriesPhysical Review Letters, 2001
- Quantum template matchingPhysical Review A, 2001
- Quantum Complexity TheorySIAM Journal on Computing, 1997
- On the Power of Quantum ComputationSIAM Journal on Computing, 1997
- Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum ComputerSIAM Journal on Computing, 1997
- Quantum Mechanics Helps in Searching for a Needle in a HaystackPhysical Review Letters, 1997
- Rapid solution of problems by quantum computationProceedings of the Royal Society of London. Series A: Mathematical and Physical Sciences, 1992
- Quantum theory, the Church–Turing principle and the universal quantum computerProceedings of the Royal Society of London. Series A - Mathematical and Physical Sciences, 1985