pith. sign in

arxiv: quant-ph/9706052 · v1 · submitted 1997-06-23 · 🪐 quant-ph

On the Complexity of Quantum Searching Using Complex Queries

classification 🪐 quant-ph
keywords algorithmcomplexcomplexitydiscussquantumqueriesaddingbeen
0
0 comments X
read the original abstract

We discuss the quantum search algorithm using complex queries that has recently been published by Grover (quant-ph/9706005). We recall the algorithm adding some details showing which complex query has to be evaluated. Based on this version of the algorithm we discuss its complexity.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.