Comprehensive characterization of three-qubit Grover search algorithm on IBM's 127-qubit superconducting quantum computers
arXiv:2406.16018 · doi:10.1038/s41598-024-80188-6
Abstract
The Grover search algorithm is a pivotal advancement in quantum computing, promising a remarkable speedup over classical algorithms in searching unstructured large databases. 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 NISQ (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.
15 pages, 7 figures, 8 tables
References in corpus (29)
- A variational eigenvalue solver on a quantum processor
- Quantum algorithm for solving linear systems of equations
- Variational Quantum Algorithms
- On the Measurement of Qubits
- Experimental One-Way Quantum Computing
- Demonstration of Two-Qubit Algorithms with a Superconducting Quantum Processor
- Quantum advantage in learning from experiments
- Experimental Demonstration of Blind Quantum Computing
- Quantum Optimization of Maximum Independent Set using Rydberg Atom Arrays
- Maximum Likelihood, Minimum Effort
- Complete 3-Qubit Grover Search on a Programmable Quantum Computer
- On the advantages of using relative phase Toffolis with an application to multiple control Toffoli optimization
- Implementation of Grover's Quantum Search Algorithm in a Scalable System
- Implementation of quantum search algorithm using classical Fourier optics
- Application-Oriented Performance Benchmarks for Quantum Computing
- Recursively Adaptive Quantum State Tomography: Theory and Two-qubit Experiment
- Implementation of a three-quantum-bit search algorithm
- Knowledge and ignorance in incomplete quantum state tomography
- Quantum query complexity of some graph problems
- Quantum Artificial Life in an IBM Quantum Computer
- NISQ Computers: A Path to Quantum Supremacy
- Efficient Grover search with Rydberg blockade
- Hybrid quantum-classical machine learning for generative chemistry and drug design
- A programmable three-qubit superconducting processor with all-to-all connectivity
- Implementation of efficient quantum search algorithms on NISQ computers
- Prospect of using Grover's search in the noisy-intermediate-scale quantum-computer era
- Information processing at the speed of light
- Quantum search on noisy intermediate-scale quantum devices
- Quantum communication protocols as a benchmark for quantum computers