Pattern recognition by quantum computer
Pattern recognition looks like a problem suitable for quantum computers, according to a preprint just released.
Although humans are particularly good at identifying a pattern in their visual field, computers are unable to apply the same sorts of heuristic rules and judgement that humans seem to use to identify patterns. Computers essentially have to take a brute force approach to look for patterns. However, this state of affairs may change if a quantum computer can look for patterns efficiently.
The suggestion of using quantum computers for pattern recognition adds to the currently small stock of applications for quantum computers and may present a viable approach to the computationally intense problem of pattern recognition. Quantum computers are only good at solving problems that can be set up in a very specific way and, at this time, there are few problems amenable to quantum computation. Examples are factoring of large number and searching databases. Each of these problems can be solved with a quantum computer much more efficiently than any classical computer will ever be able.
Now it looks like the problem of pattern recognition can be cast in a form suitable for quantum computers, promising exponentially faster searches for patterns in a background. The quantum algorithm presented in the new research works by effectively comparing the pattern being searched for with every segment of the image being searched, all at the same time.
The research is presented by Ralf Schützhold in the arXiv preprint quant-ph/0208063.