Kavli Affiliate: Eliska Greplova | First 5 Authors: D. O. Oriekhov, Guliuxin Jin, Eliska Greplova, , | Summary: It is well-known that quantum algorithms such as Grover’s can provide a quadradic speed-up for unstructured search problems. By adding topological structure to a search problem, we show that it is possible to achieve a constant search-time […]
Continue.. Constant search time algorithm via topological quantum walks