A summary on two new algorithms for Grover's unsorted database search problem
| dc.creator | Shang, Bin | |
| dc.date | 2006-03-23 | |
| dc.date | 2006-04-08 | |
| dc.date.accessioned | 2026-07-07T07:08:06Z | |
| dc.date.available | 2026-07-07T07:08:06Z | |
| dc.description | In this summary we discuss two new algorithms for Grover's unsorted database search problem that claimed to have reached exponential speedup over Grover's original algorithm. One is in the quantum setting with "power queries" that allow for exponential reduction in the number of queries over Grover's original algorithm with "bit queries". The other is to use "dubit queries" on a duality computer - a new computing model uses a quantum system's wave-particle duality, which is able to achieve even greater computing power and better capability than existent quantum computers we have been discussing. We discuss the shortages and difficulties of both schemes as well. | |
| dc.description | 2 pages. LaTex revtex4. APS twocolumn | |
| dc.identifier | https://arxiv.org/abs/quant-ph/0603210 | |
| dc.identifier | http://arxiv.org/abs/quant-ph/0603210 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/110634 | |
| dc.subject | Quantum Physics | |
| dc.title | A summary on two new algorithms for Grover's unsorted database search problem | |
| dc.type | text |