Fixed-point adiabatic quantum search
Fixed-point quantum search algorithms succeed at finding one of M target items among N total items even when the run time of the algorithm is longer than necessary. While the famous Grover's algorithm can search quadratically faster than a classical computer, it lacks the fixed-point property—t...
| Main Authors: | , , |
|---|---|
| Other Authors: | |
| Format: | Article |
| Language: | English |
| Published: |
American Physical Society
2017
|
| Online Access: | http://hdl.handle.net/1721.1/107805 https://orcid.org/0000-0001-9614-2836 https://orcid.org/0000-0001-7296-523X |