Implementation of efficient quantum search algorithms on NISQ computers
arXiv:2102.01783 · doi:10.1007/s11128-021-03165-2
Abstract
Despite the advent of Grover's algorithm for the unstructured search, its successful implementation on near-term quantum devices is still limited. We apply three strategies to reduce the errors associated with implementing quantum search algorithms. Our improved search algorithms have been implemented on the IBM quantum processors. Using them, we demonstrate three- and four-qubit search algorithm with higher average success probabilities compared to previous works. We present the successful execution of the five-qubit search on the IBM quantum processor for the first time. The results have been benchmarked using degraded ratio, which is the ratio between the experimental and the theoretical success probabilities. The fast decay of the degraded ratio supports our divide-and-conquer strategy. Our proposed strategies are also useful for implementation of quantum search algorithms in the post-NISQ era.
arXiv commentPublished version, 26 pages, 8 figures
References in corpus (36)
- Quantum Computing in the NISQ era and beyond
- Supplementary information for "Quantum supremacy using a programmable superconducting processor"
- Quantum Machine Learning
- Quantum Mechanics helps in searching for a needle in a haystack
- Elementary gates for quantum computation
- Quantum computational advantage using photons
- Noisy intermediate-scale quantum (NISQ) algorithms
- Logic gates at the surface code threshold: Superconducting qubits poised for fault-tolerant quantum computing
- Strengths and Weaknesses of Quantum Computing
- Quantum Amplitude Amplification and Estimation
- High-fidelity two-qubit quantum logic gates using trapped calcium-43 ions
- High-fidelity quantum logic gates using trapped-ion hyperfine qubits
- Tight bounds on quantum searching
- Hartree-Fock on a superconducting qubit quantum computer
- Validating quantum computers using randomized model circuits
- Grover's quantum searching algorithm is optimal
- Quantum computers can search rapidly by using almost any transformation
- 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
- Near-optimal quantum circuit for Grover's unstructured search using a transverse field
- Time-Space Complexity of Quantum Search Algorithms in Symmetric Cryptanalysis
- A Review on Quantum Search Algorithms
- Depth optimization of quantum search algorithms beyond Grover's algorithm
- Tradeoffs in the Quantum Search Algorithm
- Simple Algorithm for Partial Quantum Search
- Implementation of efficient quantum search algorithms on NISQ computers
- Generalized Quantum Search with Parallelism
- Prospect of using Grover's search in the noisy-intermediate-scale quantum-computer era
- Optimization of Partial Search
- Subdivided Phase Oracle for NISQ Search Algorithms
- Quest for Fast Partial Search Algorithm
- Group Theoretical Formulation of Quantum Partial Search Algorithm
- Introducing Structure to Expedite Quantum Search
- Faster quantum searching with almost arbitrary operators
- Grover like Operator Using Only Single-Qubit Gates
- Efficient unstructured search implementation on current ion-trap quantum processors
Cited by in corpus (18)
- Review of Distributed Quantum Computing. From single QPU to High Performance Quantum Computing
- Demonstration of algorithmic quantum speedup
- Implementation of efficient quantum search algorithms on NISQ computers
- A Comprehensive Review of Quantum Circuit Optimization: Current Trends and Future Directions
- Grover search revisited; application to image pattern matching
- Quantum algorithm for Feynman loop integrals
- Comprehensive characterization of three-qubit Grover search algorithm on IBM's 127-qubit superconducting quantum computers
- Quantum search on noisy intermediate-scale quantum devices
- Networked Quantum Services
- Implementation of quantum compression on IBM quantum computers
- Modeling low- and high-frequency noise in transmon qubits with resource-efficient measurement
- Two-Step Quantum Search Algorithm for Solving Traveling Salesman Problems
- A Quantum Approach to the Discretizable Molecular Distance Geometry Problem
- Performance of Uncoded Implementation of Grover's Algorithm on Today's Quantum Processors
- Quantum spatial search with electric potential : long-time dynamics and robustness to noise
- Phases and phase transition in Grover's algorithm with systematic noise
- Asymptotic bounds on quantum partial search algorithm and its applications to parallel search
- Asymptotic optimality of Grover-Radhakrishnan-Korepin algorithm