Rapid sampling through quantum computing
| dc.creator | Grover, Lov K. | |
| dc.date | 1999-12-01 | |
| dc.date | 2000-02-18 | |
| dc.date.accessioned | 2026-07-07T06:17:16Z | |
| dc.date.available | 2026-07-07T06:17:16Z | |
| dc.description | This paper extends the quantum search class of algorithms to the multiple solution case. It is shown that, like the basic search algorithm, these too can be represented as a rotation in an appropriately defined two dimensional vector space. This yields new applications - an algorithm is presented that can create an arbitrarily specified quantum superposition on a space of size N in O(sqrt(N)) steps. By making a measurement on this superposition, it is possible to obtain a sample according to an arbitrarily specified classical probability distribution in O(sqrt(N)) steps. A classical algorithm would need O(N) steps. | |
| dc.description | The paper has been rewritten. It is to be presented at STOC '00 in May '00 | |
| dc.identifier | https://arxiv.org/abs/quant-ph/9912001 | |
| dc.identifier | http://arxiv.org/abs/quant-ph/9912001 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/94338 | |
| dc.subject | Quantum Physics | |
| dc.title | Rapid sampling through quantum computing | |
| dc.type | text |