Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

Optimality of partial adiabatic search and its circuit model

Optimality of partial adiabatic search and its circuit model In this paper, we first uncover a fact that a partial adiabatic quantum search with $$O(\sqrt{N/M})$$ O ( N / M ) time complexity is in fact optimal, in which $$N$$ N is the total number of elements in an unstructured database, and $$M$$ M ( $$M\ge 1$$ M ≥ 1 ) of them are the marked ones(one) $$(N\gg M)$$ ( N ≫ M ) . We then discuss how to implement a partial adiabatic search algorithm on the quantum circuit model. From the implementing procedure on the circuit model, we can find out that the approximating steps needed are always in the same order of the time complexity of the adiabatic algorithm. http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png Quantum Information Processing Springer Journals

Optimality of partial adiabatic search and its circuit model

Loading next page...
 
/lp/springer-journals/optimality-of-partial-adiabatic-search-and-its-circuit-model-RYfsxB6mV0

References (28)

Publisher
Springer Journals
Copyright
Copyright © 2014 by Springer Science+Business Media New York
Subject
Physics; Quantum Information Technology, Spintronics; Quantum Computing; Data Structures, Cryptology and Information Theory; Quantum Physics; Mathematical Physics
ISSN
1570-0755
eISSN
1573-1332
DOI
10.1007/s11128-014-0770-6
Publisher site
See Article on Publisher Site

Abstract

In this paper, we first uncover a fact that a partial adiabatic quantum search with $$O(\sqrt{N/M})$$ O ( N / M ) time complexity is in fact optimal, in which $$N$$ N is the total number of elements in an unstructured database, and $$M$$ M ( $$M\ge 1$$ M ≥ 1 ) of them are the marked ones(one) $$(N\gg M)$$ ( N ≫ M ) . We then discuss how to implement a partial adiabatic search algorithm on the quantum circuit model. From the implementing procedure on the circuit model, we can find out that the approximating steps needed are always in the same order of the time complexity of the adiabatic algorithm.

Journal

Quantum Information ProcessingSpringer Journals

Published: Jun 12, 2014

There are no references for this article.