On the Complexity of Quantum Searching Using Complex Queries
| dc.creator | Grassl, Markus | |
| dc.creator | Beth, Thomas | |
| dc.date | 1997-06-23 | |
| dc.date.accessioned | 2026-07-07T06:14:19Z | |
| dc.date.available | 2026-07-07T06:14:19Z | |
| dc.description | We discuss the quantum search algorithm using complex queries that has recently been published by Grover (quant-ph/9706005). We recall the algorithm adding some details showing which complex query has to be evaluated. Based on this version of the algorithm we discuss its complexity. | |
| dc.description | 4 pages, RevTeX, no figures | |
| dc.identifier | https://arxiv.org/abs/quant-ph/9706052 | |
| dc.identifier | http://arxiv.org/abs/quant-ph/9706052 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/93416 | |
| dc.subject | Quantum Physics | |
| dc.title | On the Complexity of Quantum Searching Using Complex Queries | |
| dc.type | text |