Simulation and the exact complexity of Grover's search algorithm

MaRDI QIDQ3565988zbMATH OpenFDO

Authors Eugen Grycko, Tobias Mühlenbruch, Werner Kirsch

Publication date 7 June 2010

zbMATH Keywords

search spacetensor productunitary operator

Mathematics Subject Classification ID

Searching and sorting (68P10) Analysis of algorithms and problem complexity (68Q25)

Recommendations

• The simulation of Grover quantum search algorithm
• QCL implementation of quantum search algorithms
• An Upper Bound on the Rate of Information Transfer by Grover’s Oracle
• An upper bound on the rate of information transfer by Grover's oracle
• A panoply of quantum algorithms

Cited in

(5)

• Workflow of the Grover algorithm simulation incorporating CUDA and GPGPU
• QCL implementation of quantum search algorithms
• scientific article; zbMATH DE number 1303028 (Why is no real title available?)
• Grover's algorithm on a Feynman computer
• The simulation of Grover quantum search algorithm

This page was built for publication: Simulation and the exact complexity of Grover's search algorithm

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