Characterizing Grover search algorithm on large-scale superconducting quantum computers

Abstract

AbstractQuantum computing is on the cusp of transforming the way we tackle complex problems, and the Grover search algorithm exemplifying its potential to revolutionize the search for unstructured large datasets, offering remarkable speedups over classical methods. Here, we report results for the implementation and characterization of a three-qubit Grover search algorithm using the state-of-the-art scalable quantum computing technology of superconducting quantum architectures. To delve into the algorithm’s scalability and performance metrics, our investigation spans the execution of the algorithm across all eight conceivable single-result oracles, alongside nine two-result oracles, employing IBM Quantum’s 127-qubit quantum computers. Moreover, we conduct five quantum state tomography experiments to precisely gauge the behavior and efficiency of our implemented algorithm under diverse conditions – ranging from noisy, noise-free environments to the complexities of real-world quantum hardware. By connecting theoretical concepts with real-world experiments, this study not only shed light on the potential of Noisy Intermediate-Scale Quantum Computers in facilitating large-scale database searches but also offer valuable insights into the practical application of the Grover search algorithm in real-world quantum computing applications.