Fixed-point adiabatic quantum search

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...

Full description

Bibliographic Details
Main Authors: Dalzell, Alexander M. (Contributor), Yoder, Theodore James (Contributor), Chuang, Isaac (Contributor)
Other Authors: Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science (Contributor), Massachusetts Institute of Technology. Department of Physics (Contributor)
Format: Article
Language:English
Published: American Physical Society, 2017-03-31T20:39:27Z.
Subjects:
Article
Online Access:Get fulltext

Internet

Get fulltext

Similar Items