REVIEW 1 cited by
A framework for fast quantum mechanical algorithms
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
read the original abstract
A framework is presented for the design and analysis of quantum mechanical algorithms, the sqrt(N) step quantum search algorithm is an immediate consequence of this framework. It leads to several other search-type applications - several examples are presented. Also, it leads to quantum mechanical algorithms for problems not immediately connected with search - two such algorithms are presented for estimating the mean and median of statistical distributions. Both algorithms require fewer steps than the fastest possible classical algorithms; also both are considerably simpler and faster than existing quantum mechanical algorithms for the respective problems.
Forward citations
Cited by 1 Pith paper
-
Quantum Approximate Counting, Simplified
Quantum approximate counting can match the optimal query complexity without the quantum Fourier transform, using only Grover iterations and classic coin-estimation analysis.
Discussion (0). Continue with ORCID to comment.