Quantum Guessing via Deutsch-Jozsa
| dc.creator | Nathanson, Michael | |
| dc.date | 2003-01-07 | |
| dc.date | 2003-02-07 | |
| dc.date.accessioned | 2026-07-07T06:05:50Z | |
| dc.date.available | 2026-07-07T06:05:50Z | |
| dc.description | We examine the "Guessing Secrets" problem arising in internet routing, in which the goal is to discover two or more objects from a known finite set. We propose a quantum algorithm using O(1) calls to an O(logN) oracle. This improves upon the best known classical result, which uses O(logN) questions and requires an additional O(logN^3) steps to produce the answer. In showing the possibilities of this algorithm, we extend the types of questions and function oracles that the Deutsch-Jozsa algorithm can be used to solve. | |
| dc.description | 14 pages | |
| dc.identifier | https://arxiv.org/abs/quant-ph/0301025 | |
| dc.identifier | http://arxiv.org/abs/quant-ph/0301025 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/90773 | |
| dc.subject | Quantum Physics | |
| dc.title | Quantum Guessing via Deutsch-Jozsa | |
| dc.type | text |