An exact quantum search algorithm with arbitrary database

DOI10.1007/s10773-014-2055-3zbMath1308.81062OpenAlexW2068366909MaRDI QIDQ490398

Yong-Cai Geng, Sumit K. Garg

Publication date: 22 January 2015

Published in: International Journal of Theoretical Physics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10773-014-2055-3

zbMATH Keywords

Grover algorithmquantum search algorithmlong algorithmzero theoretical failure rate

Mathematics Subject Classification ID

Searching and sorting (68P10) Quantum computation (81P68)

Related Items (1)

Unnamed Item

Cites Work

• Phase matching in quantum searching.
• AnSO(3) picture for quantum searching
• Rapid solution of problems by quantum computation
• Strengths and Weaknesses of Quantum Computing
• Quantum cryptanalysis of hash and claw-free functions
• Phase matching condition for quantum search with a generalized initial state
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: An exact quantum search algorithm with arbitrary database