Grover Algorithm with zero theoretical failure rate

Abstract

In standard Grover's algorithm for quantum searching, the probability of finding the marked item is not exactly 1. In this Letter we present a modified version of Grover's algorithm that searches a marked state with full successful rate. The modification is done by replacing the phase inversion by two phase rotation through angle $\varphi$. The rotation angle is given analytically to be $\frac{\varphi =2\arcsin (\sin \frac{\pi }{(4J+6)}}{\sin \beta )}$, where $\sin \beta =\frac{1}{\sqrt{N}}$, $N$ the number of items in the database, and $J$ an integer equal to or greater than the integer part of $(\frac{\pi }{2}-\beta )/(2\beta )$. Upon measurement at $(J+1)$-th iteration, the marked state is obtained with certainty.

5 pages. Accepted for publication in Physical Review A

Cited by in corpus (117)

• Hybrid Quantum-Classical Convolutional Neural Networks
• The General Quantum Interference Principle and the Duality Computer
• The Evolution of Quantum Secure Direct Communication: On the Road to the Qinternet
• Sliding mode control of quantum systems
• Recent advances for quantum classifiers
• Parallel Quantum Computing in a Single Ensemble Quantum Computer
• Measuring a Dynamical Topological Order Parameter in Quantum Walks
• Perceval: A Software Platform for Discrete Variable Photonic Quantum Computing
• Blind quantum computation with noise environment
• A Review on Quantum Search Algorithms
• Duality and Recycling Computing in Quantum Computers
• Error-rejecting quantum computing with solid-state spins assisted by low-Q optical microcavities
• Deterministic Grover search with a restricted oracle
• Time-efficient implementation of quantum search with qudits
• Estimating coherence measures from limited experimental data available
• Performing SU($d$) operations and rudimentary algorithms in a superconducting transmon qudit for $d=3$ and $d=4$
• Heralded atomic nonadiabatic holonomic quantum computation with Rydberg blockade
• A quantum circuit design of AES
• Self-error-corrected hyperparallel photonic quantum computation working with both the polarization and the spatial-mode degrees of freedom
• State preparation by shallow circuits using feed forward
• A Variational Quantum Attack for AES-like Symmetric Cryptography
• Prospect of using Grover's search in the noisy-intermediate-scale quantum-computer era
• Universal quantum multi-qubit entangling gates with auxiliary spaces
• Quantum Searching via Entanglement and Partial Diffusion
• Quantum Enhanced Inference in Markov Logic Networks
• Exactness of the Original Grover Search Algorithm
• Multi-phase matching in the Grover algorithm
• Scalable quantum search using trapped ions
• Dynamic Grover Search: Applications in Recommendation systems and Optimization problems
• Fetching marked items from an unsorted database in NMR ensemble computing
• Generalized Grover's algorithm for multiple phase inversion states
• A Hybrid Quantum Encoding Algorithm of Vector Quantization for Image Compression
• An optimized quantum minimum searching algorithm with sure-success probability and its experiment simulation with Cirq
• Prime Factorization in the Duality Computer
• Quantum algorithm for optical template recognition with noise filtering
• Entanglement-based quantum deep learning
• Deterministic quantum search with adjustable parameters: implementations and applications
• Quantum algorithm to distinguish Boolean functions of different weights
• Simple implementation of a quantum search with trapped ions
• Implementation of quantum compression on IBM quantum computers
• Strength and Weakness in Grover's Quantum Search Algorithm
• Quantum Amplitude Amplification Operators
• Quantum Discrete Cosine Transform for Image Compression
• A General SU(2) Formulation for Quantum Searching with Certainty
• Device-Independent Quantum Secure Direct Communication Under Non-Markovian Quantum Channels
• Deterministic spatial search using alternating quantum walks
• Exact Quantum Search by Parallel Unitary Discrimination Schemes
• Quantum Algorithms for the Most Frequently String Search, Intersection of Two String Sequences and Sorting of Strings Problems
• Implementing two-photon three-degree-of-freedom hyper-parallel controlled phase flip gate through cavity-assisted interactions
• A Query-based Quantum Eigensolver
• Quantum-Based Feature Selection for Multi-classification Problem in Complex Systems with Edge Computing
• Implementations of more general solid-state (SWAP)${}^{1/m}$ and controlled-(swap)${}^{1/m}$ gates
• Exploring LLM-Driven Explanations for Quantum Algorithms
• Automatic Depth-Optimized Quantum Circuit Synthesis for Diagonal Unitary Matrices with Asymptotically Optimal Gate Count
• Universal distributed quantum computing on superconducting qutrits with dark photons
• Generalized Quantum PageRank Algorithm with Arbitrary Phase Rotations
• Efficient Fusion of Photonic W-states with Nonunitary Partial-swap Gates
• Quantum All-Subkeys-Recovery Attacks on 6-round Feistel-2* Structure Based on Multi-Equations Quantum Claw Finding
• Tree Search and Quantum Computation
• Phase shifts in nonresonant coherent excitation
• Simulation of Grover's quantum search algorithm in a Ising nuclear spin chain quantum computer with first and second nearest neighbour couplings
• A family of sure-success quantum algorithms for solving a generalized Grover search problem
• Implementations of two-photon four-qubit Toffoli and Fredkin gates assisted by nitrogen-vacancy centers
• High-Capacity Quantum Associative Memories
• Circuit Design for Clique Problem and Its Implementation on Quantum Computer
• General Phase Matching Condition for Quantum Searching
• Fixed Phase Quantum Search Algorithm
• Multi-objective evolutionary algorithms for quantum circuit discovery
• Amplitude Amplification for Optimization via Subdivided Phase Oracle
• Security and Fairness in Multi-Party Quantum Secret Sharing Protocol
• OPAQUE: Obfuscating Phase in Quantum Circuit Compilation for Efficient IP Protection
• Completing the physical representation of quantum algorithms provides a quantitative explanation of their computational speedup
• Quantum search in many-body interacting system with long-range interaction
• Optimization of probabilistic quantum search algorithm with a priori information
• Optimal exact quantum algorithm for the promised element distinctness problem
• Creation of Entanglement between Two Electron Spins Induced by Many Spin Ensemble Excitations
• Coherence Fraction in Grover Search Algorithm
• A relational time-symmetric framework for analyzing the quantum computational speedup
• A framework for optimal quantum spatial search using alternating phase-walks
• Unifying quantum spatial search, state transfer and uniform sampling on graphs: simple and exact
• SpinQ Gemini: a desktop quantum computer for education and research
• Structured quantum search in NP-complete problems using the cumulative density of states
• Complementary-multiphase quantum search for all numbers of target items
• An Optimized Quantum Maximum or Minimum Searching Algorithm and its Circuits
• Fixed-point quantum continuous search algorithm with optimal query complexity
• Is partial quantum search of a database any easier?
• Quantum Pattern Recognition of Classical Signal
• Near-deterministic quantum search algorithm without phase design
• Choco-Q: Commute Hamiltonian-based QAOA for Constrained Binary Optimization
• Distribution and generation of quantum coherence for Gaussian states in de Sitter space
• A quantum algorithm for solving systems of nonlinear algebraic equations
• Simulation of static and random errors on Grover's search algorithm implemented in a Ising nuclear spin chain quantum computer with few qubits
• Threshold quantum cryptograph based on Grover's algorithm
• Query complexity for searching multiple marked states from an unsorted database
• Quantum Discrete Fourier Transform with Classical Output for Signal Processing
• Quantum Algorithm for Searching of Two Sets Intersection
• Derandomization of quantum algorithm for triangle finding
• Invariance of success probability in Grover's quantum search under local noise with memory
• Deterministic carving of quantum states with Grover's algorithm
• Deleting a marked item from an unsorted database with a single query
• Quantum algorithm for unstructured search of ranked targets
• Constant-Time Quantum Algorithm For The Unstructured Search Problem
• Modularized and Scalable Compilation for Double Quantum Dot Quatum Computing
• Three-qubit exact Grover within the blind oracular quantum computation scheme
• Revisiting fixed-point quantum search: proof of the quasi-Chebyshev lemma
• Highlighting the mechanism of the quantum speedup by time-symmetric and relational quantum mechanics
• Quantum amplitude amplification algorithm: an explanation of availability bias
• Quantum search of partially ordered sets
• A Quantum Search Algorithm for a Specified Number of Targets
• An exact relation between number of black box computations required to solve an oracle problem quantumly and quantum retrocausality
• Quantum Search for Gravitational Wave of Massive Black Hole Binaries
• Completing the physical representation of quantum algorithms provides a retrocausal explanation of their speedup
• Distributed Exact Generalized Grover's Algorithm
• Quantum Search Algorithm for Set Operation
• Unobservable causal loops as a way to explain both the quantum computational speedup and quantum nonlocality
• Exact quantum search based on analytical multiphase matching for known number of target items and the experimental demonstration on IBM Q
• Parameter security characterization of knapsack public-key crypto under quantum computing