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

Learn More →

A Primer on Quantum ComputingGrover’s Algorithm for Unstructured Search

A Primer on Quantum Computing: Grover’s Algorithm for Unstructured Search [Grover’s algorithm is used to search for an element on an unsorted list with quadratic speed-up when compared to the best possible classical algorithm. This quantum algorithm has an enormous historical importance, and is also a fundamental building block in quantum computing.] http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png

A Primer on Quantum ComputingGrover’s Algorithm for Unstructured Search

Loading next page...
 
/lp/springer-journals/a-primer-on-quantum-computing-grover-s-algorithm-for-unstructured-Hdl03WplE5
Publisher
Springer International Publishing
Copyright
© The Author(s), under exclusive license to Springer Nature Switzerland AG 2019
ISBN
978-3-030-19065-1
Pages
35 –55
DOI
10.1007/978-3-030-19066-8_3
Publisher site
See Chapter on Publisher Site

Abstract

[Grover’s algorithm is used to search for an element on an unsorted list with quadratic speed-up when compared to the best possible classical algorithm. This quantum algorithm has an enormous historical importance, and is also a fundamental building block in quantum computing.]

Published: Jun 26, 2019

There are no references for this article.