| | |
| | |
Stat |
Members: 3667 Articles: 2'599'751 Articles rated: 2609
07 February 2025 |
|
| | | |
|
Article overview
| |
|
Recursive quantum spatial search does not need ancilla qubit | Avatar Tulsi
; | Date: |
2 Aug 2015 | Abstract: | Spatial search is a widely studied application of quantum algorithms. For a
long time, it was believed that quantum spatial search algorithms need ancilla
qubits for efficient implementation. Waiving requirement of ancilla qubits will
make quantum spatial search algorithms much more easier to implement
physically. Several algorithms have been proposed for spatial search without
using ancilla qubits. All these algorithms are based on widely studied quantum
walk approach. Here we consider another approach to efficient quantum spatial
search by Aaronson and Ambainis which is based on the recursive application of
Grover’s algorithm rather than widely studied quantum walks. Their algorithm
needs one ancilla qubit for successful implementation. We show that this need
of ancilla qubit is not necessary. We present a recursive algorithm which does
not need any ancilla qubit and hence it offers physical implementation
advantages. | Source: | arXiv, 1508.0207 | Services: | Forum | Review | PDF | Favorites |
|
|
No review found.
Did you like this article?
Note: answers to reviews or questions about the article must be posted in the forum section.
Authors are not allowed to review their own article. They can use the forum section.
|
| |
|
|
|