Quantum computers can search rapidly by using almost any transformation
| dc.creator | Grover, Lov K. | |
| dc.date | 1997-12-03 | |
| dc.date.accessioned | 2026-07-07T12:33:24Z | |
| dc.date.available | 2026-07-07T12:33:24Z | |
| dc.description | A quantum computer has a clear advantage over a classical computer for exhaustive search. The quantum mechanical algorithm for exhaustive search was originally derived by using subtle properties of a particular quantum mechanical operation called the Walsh-Hadamard (W-H) transform. This paper shows that this algorithm can be implemented by replacing the W-H transform by almost any quantum mechanical operation. This leads to several new applications where it improves the number of steps by a square-root. It also broadens the scope for implementation since it demonstrates quantum mechanical algorithms that can readily adapt to available technology. | |
| dc.description | This paper is an adapted version of quant-ph/9711043. It has been modified to make it more readable for physicists. 9 pages, postscript | |
| dc.identifier | https://arxiv.org/abs/quant-ph/9712011 | |
| dc.identifier | http://arxiv.org/abs/quant-ph/9712011 | |
| dc.identifier | Phys.Rev.Lett.80:4329-4332,1998 | |
| dc.identifier | doi:10.1103/PhysRevLett.80.4329 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/217111 | |
| dc.subject | Quantum Physics | |
| dc.title | Quantum computers can search rapidly by using almost any transformation | |
| dc.type | text |