Speed-up and entanglement in quantum searching
| dc.creator | Braunstein, Samuel L. | |
| dc.creator | Pati, Arun K. | |
| dc.date | 2000-08-03 | |
| dc.date | 2002-07-17 | |
| dc.date.accessioned | 2026-07-07T06:00:35Z | |
| dc.date.available | 2026-07-07T06:00:35Z | |
| dc.description | We investigate the issue of speed-up and the necessity of entanglement in Grover's quantum search algorithm. We find that in a pure state implementation of Grover's algorithm entanglement is present even though the initial and target states are product states. In pseudo-pure state implementations, the separability of the states involved defines an entanglement boundary in terms of a bound on the purity parameter. Using this bound we investigate the necessity of entanglement in quantum searching for these pseudo-pure state implementations. If every active molecule involved in the ensemble is `charged for' then in existing machines speed-up without entanglement is not possible. | |
| dc.description | Latex file, no figures, 11 pages, Extended version, To appear in Journal QIC | |
| dc.identifier | https://arxiv.org/abs/quant-ph/0008018 | |
| dc.identifier | http://arxiv.org/abs/quant-ph/0008018 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/89007 | |
| dc.subject | Quantum Physics | |
| dc.title | Speed-up and entanglement in quantum searching | |
| dc.type | text |