Paul Baird

Hypercube Quantum Search: Exact Computation of the Probability of Success in Polynomial Time

2022 · arXiv (Cornell University)

In the emerging domain of quantum algorithms, the Grover's quantum search is certainly one of the most significant. It is relatively simple, performs a useful task and more importantly, does it in an optimal way. …