Near-deterministic quantum search algorithm without phase design
arXiv:2407.10748 · doi:10.1002/qute.202400557
Abstract
Grover's algorithm solves the unstructured search problem. Grover's algorithm can find the target state with certainty only if searching one out of four. Designing the deterministic search algorithm can avoid any repetition of the algorithm, especially when Grover's algorithm is a subroutine in other algorithms. Grover's algorithm can be deterministic if the phase of the oracle or the diffusion operator is delicately designed. The precision of the phases could be a problem. A near-deterministic quantum search algorithm without the phase design is proposed. The algorithm has the same oracle and diffusion operators as Grover's algorithm. One additional component is the rescaled diffusion operator. It acts partially on the database. The success probability of Grover's algorithm is improved by the partial diffusion operator in two different ways. The possible cost is one or two more queries to the oracle. The deterministic search algorithm is also designed when searching one out of eight, sixteen, and thirty-two.
Published version, 9 pages, 3 figures, 2 tables
References in corpus (15)
- Quantum Computing in the NISQ era and beyond
- Grover Algorithm with zero theoretical failure rate
- Fixed-point quantum search with an optimal number of queries
- SLOCC classification of n qubits invoking the proportional relationships for spectrums and for standard Jordan normal forms
- Near-optimal quantum circuit for Grover's unstructured search using a transverse field
- A scheme for direct detection of qubit-environment entanglement generated during qubit pure dephasing
- Deterministic Grover search with a restricted oracle
- Depth optimization of quantum search algorithms beyond Grover's algorithm
- Variationally Learning Grover's Quantum Search Algorithm
- Tradeoffs in the Quantum Search Algorithm
- Simple Algorithm for Partial Quantum Search
- Exactness of the Original Grover Search Algorithm
- Optimization of Partial Search
- Group Theoretical Formulation of Quantum Partial Search Algorithm
- Introducing Structure to Expedite Quantum Search