« Back
Implementation of Partial Quantum Search
Poster Title: Implementation of Partial Quantum Search
Submitted on 27 Sep 2019
Author(s): James Chen, Debayan Bandyopadhyay, Amy Searle, Victor Li, Sahil Patel, Henry Sun, Glenn LeBlanc, Ashwin Rastogi, Ryan Jia
Affiliations: ULAB, UC BERKELEY
This poster was presented at undergraduate research symposium
Poster Views: 226
View poster »

Poster Information
Abstract: Grover's Algorithm, one of the best-known algorithms of quantum computing, provides a square root speed up for unstructured database search. Eight years after publishing his paper on the algorithm, Grover worked with Radhakrishnan on a variation of the problem: partial search, where only the first few bits of the target element were desired. Grover and Radhakrishnan showed that it was possible to perform a partial search in a characteristic query. Summary: Implementing Grover's Algorithm in Rigetti's "pyquil" for unstructured database searches. References: [1]Lov K Grover arXiv:quant-ph/9605043
[2] Lov K Grover arXiv:quant-ph/0407122
Report abuse »
Creative Commons