Mitigating the errors of quantum search algorithms

by Kun Zhang (Stony Brook)

Monday 26 Apr 2021, 14:00 → 15:00 US/Eastern

Grover’s algorithm is strictly optimal in the number of query to the oracle. However, there is a gap between the oracular resources and physical computational resources, such as depth, of quantum search algorithms. This talk will present depth optimization strategies for quantum search algorithms. Grover’s algorithm is not optimal in depth for practical problems. Besides, it is also possible to apply the divide-and-conquer strategy on unstructured search problems. We demonstrate better performances of improved quantum search algorithms compared to Grover’s algorithm on IBM quantum computers. Based on arXiv:1908.04171 and arXiv:2102.01783.