Grover's Quantum Search Algorithm for an Arbitrary Initial Amplitude Distribution
arXiv:quant-ph/9807027 · doi:10.1103/PhysRevA.60.2742
Abstract
Grover's algorithm for quantum searching is generalized to deal with arbitrary initial complex amplitude distributions. First order linear difference equations are found for the time evolution of the amplitudes of the marked and unmarked states. These equations are solved exactly. New expressions are derived for the optimal time of measurement and the maximal probability of success. They are found to depend on the averages and variances of the initial amplitude distributions of the marked and unmarked states, but not on higher moments. Our results imply that Grover's algorithm is robust against modest noise in the amplitude initialization procedure.
5 pages, no figures. This paper generalizes the results of http://xxx.lanl.gov/abs/quant-ph/9801066 (quant-ph/9801066) to the case of complex amplitudes and the case of an unknown initial amplitude distribution. Some changes in this final version. To appear in Phys. Rev. A
References in corpus (5)
Cited by in corpus (39)
- Adiabatic Quantum Computing
- Quantum coherence and geometric quantum discord
- Coherence depletion in the Grover quantum search algorithm
- Theory of Initialization-Free Decoherence-Free Subspaces and Subsystems
- Intrinsic geometry of quantum adiabatic evolution and quantum phase transitions
- Analysis of Generalized Grover's Quantum Search Algorithms Using Recursion Equations
- Accuracy vs run time in adiabatic quantum search
- An entanglement monotone derived from Grover's algorithm
- Quantum Fast Poisson Solver: the algorithm and modular circuit design
- The effect of unitary noise on Grover's quantum search algorithm
- Grover's Quantum Search Algorithm for an Arbitrary Initial Mixed State
- Geometric Strategy for the Optimal Quantum Search
- Characterization of pure quantum states of multiple qubits using the Groverian entanglement measure
- Coherence number as a discrete quantum resource
- The Groverian Measure of Entanglement for Mixed States
- What is a quantum computer, and how do we build one?
- An optimized quantum minimum searching algorithm with sure-success probability and its experiment simulation with Cirq
- On the role of dealing with quantum coherence in amplitude amplification
- Simple implementation of a quantum search with trapped ions
- Quantum Associative Memory in HEP Track Pattern Recognition
- Quantum Discrete Cosine Transform for Image Compression
- An algorithm for DNA read alignment on quantum accelerators
- Analysis of Grover's quantum search algorithm as a dynamical system
- Recommendation systems with quantum k-NN and Grover's algorithms for data processing
- Algebraic analysis of quantum search with pure and mixed states
- Effect of qubit losses on Grover's quantum search algorithm
- Quantum search degeneration under amplitude noise in queries to the oracle
- Error Avoiding Quantum Codes and Dynamical Stabilization of Grover's Algorithm
- Amplitude Amplification for Optimization via Subdivided Phase Oracle
- Unity-Efficiency Parametric Down-Conversion via Amplitude Amplification
- Single-Step Quantum Search Using Problem Structure
- An Optimized Quantum Maximum or Minimum Searching Algorithm and its Circuits
- State preparation based on Grover's algorithm in the presence of global information about the state
- Voronoi Diagrams for Quantum States and Its Application to a Numerical Estimation of a Quantum Channel Capacity
- Invariance of success probability in Grover's quantum search under local noise with memory
- Hypothesis elimination on a quantum computer
- Quasi-adiabatic Grover search via the WKB approximation
- Quantum Multi-object Search Algorithm with the Availability of Partial Information
- Ion Trap Proposal for Quantum Search