VERIFIER-BASED ALGORITHM FOR UNSORTED DATABASE SEARCH PROBLEM

DOI10.1142/S0219749907003067MaRDI QIDQ3509799zbMATH OpenOpenAlexFDO

Authors Xiaodi Wu, Gui-Lu Long

Publication date 2 July 2008

Published in International Journal of Quantum Information (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1142/s0219749907003067

zbMATH Keywords

Grover algorithmlong algorithmquantum search algorithm

Mathematics Subject Classification ID

Searching and sorting (68P10) Randomized algorithms (68W20) Analysis of algorithms (68W40) Quantum computation (81P68)

Recommendations

• scientific article; zbMATH DE number 861625
• Nondeterministic query algorithms
• Publicly verifiable database scheme with efficient keyword search
• scientific article; zbMATH DE number 1696846
• scientific article; zbMATH DE number 2101003
• Unbounded Searching Algorithms
• scientific article; zbMATH DE number 11737
• An Efficient Algorithm to Compute the Candidate Keys of a Relational Database Schema
• Average complexity of searching for identical objects in random nonuniform databases

Cites work

• An SO(3) picture for quantum searching.
• Oracle Quantum Computing
• Phase matching condition for quantum search with a generalized initial state
• Phase matching in quantum searching.
• Strengths and Weaknesses of Quantum Computing

Cited in

(3)

• DELETING A MARKED BASIS-STATE FROM AN EVEN SUPERPOSITION OF ALL BASIS-STATES WITH A SINGLE QUERY
• scientific article; zbMATH DE number 861625 (Why is no real title available?)
• Exact quantum search by parallel unitary discrimination schemes

This page was built for publication: VERIFIER-BASED ALGORITHM FOR UNSORTED DATABASE SEARCH PROBLEM

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3509799)