Quantum search with certainty based on modified Grover algorithms: optimum choice of parameters
From MaRDI portal
Publication:2393688
DOI10.1007/S11128-012-0498-0zbMATH Open1271.81054OpenAlexW1992761376MaRDI QIDQ2393688FDOQ2393688
Authors: Yanyan Li 
Publication date: 12 August 2013
Published in: Quantum Information Processing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11128-012-0498-0
Recommendations
Searching and sorting (68P10) Quantum algorithms and complexity in the theory of computing (68Q12) Quantum computation (81P68)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Strengths and Weaknesses of Quantum Computing
- Exact quantum algorithm to distinguish Boolean functions of different weights
- Phase matching in quantum searching.
- An SO(3) picture for quantum searching.
- Geometric pictures for quantum search algorithms
- Experimental NMR realization of a generalized quantum search algorithm
- Phase matching condition for quantum search with a generalized initial state
- Phase matching in Grover's algorithm
- Quantum database search with certainty by a single query
Cited In (23)
- Asymmetric bidirectional controlled teleportation via seven-qubit cluster state
- Improved Grover's quantum searching algorithm
- A modified quantum search algorithm
- Quantum confidentiality query protocol based on Bell state identity
- Highlighting the mechanism of the quantum speedup by time-symmetric and relational quantum mechanics
- A low failure rate quantum algorithm for searching maximum or minimum
- A novel quantum anonymous ranking protocol
- Duality quantum computer and the efficient quantum simulations
- Precise probability that Grover's quantum search finds a solution
- Multiple-server flexible blind quantum computation in networks
- Completing the physical representation of quantum algorithms provides a quantitative explanation of their computational speedup
- Non-Boolean quantum amplitude amplification and quantum mean estimation
- FORMULATION OF A FAMILY OF SURE-SUCCESS QUANTUM SEARCH ALGORITHMS
- Title not available (Why is that?)
- A relational time-symmetric framework for analyzing the quantum computational speedup
- Dynamic Grover search: applications in recommendation systems and optimization problems
- An exact quantum search algorithm with arbitrary database
- Title not available (Why is that?)
- A review on quantum search algorithms
- Understanding mathematics of Grover's algorithm
- Quantum all-subkeys-recovery attacks on 6-round Feistel-\(2^\ast\) structure based on multi-equations quantum claw finding
- Quantum sampling for balanced allocations
- PHASE MATCHING IN FIXED-POINT QUANTUM SEARCH ALGORITHM
This page was built for publication: Quantum search with certainty based on modified Grover algorithms: optimum choice of parameters
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2393688)
