Quantum algorithms

My coworkers and I have discovered new algorithms to run on a quantum computer (once one is built!). The first is called the MultiGrover algorithm and allows you to perform parallel Grover searches of a single database stored in quantum memory (or a quantum accessible memory). Using the MultiGrover algorithm, we found improved algorithms for two important problems in (classical) cryptography - the element distinctness and collision problems.


  1. Efficient Distributed Quantum Computing
    R. Beals, S. Brierley, O. Gray, A. Harrow, S. Kutin, N. Linden, D. Shepherd and M. Stather
    Proc. R. Soc. A 2013 469, 20120686

This webpage was built with Bootstrap and Jekyll. Last updated: Mar 30, 2017