2026-07-072026-07-07http://salesiana.dossiersoluciones.com/handle/123456789/94338This 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.The paper has been rewritten. It is to be presented at STOC '00 in May '00Quantum PhysicsRapid sampling through quantum computingtext