Complexity of Grover's algorithm: an algebraic approach

MaRDI QIDQ5448002zbMATH OpenFDO

Authors Carlos A. de Moura, Carlile Lavor, Luiz Mariano Carvalho, R. Portugal

Publication date 20 March 2008

zbMATH Keywords

Grover's algorithmlinear algebraquantum computation

Mathematics Subject Classification ID

Quantum computation (81P68)

Recommendations

• Clifford algebra applied to Grover's algorithm
• scientific article; zbMATH DE number 1284000
• 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

(19)

• Diagonalization of diffusion matrix in Grover's algorithm
• A review on quantum search algorithms
• Solving binary \(\mathcal {MQ}\) with Grover's algorithm
• A quantum approach to the discretizable molecular distance geometry problem
• Optimal fixed-point quantum search in an interacting Ising spin system
• Method for organizing Grover's quantum oracle
• Quantum distributed computing applied to Grover's search algorithm
• Quantum computational complexity in curved spacetime
• OPTIMAL DATABASE SEARCH: WAVES AND CATALYSIS
• Grover's algorithm on a Feynman computer
• Grover's algorithm and the secant varieties
• Comparing two quantum oracles using the Deutsch-Jozsa algorithm
• The simulation of Grover quantum search algorithm
• Wave Algorithms: Optimal Database Search and Catalysis
• Clifford algebra applied to Grover's algorithm
• Performance of Grover's search algorithm with diagonalizable collective noises
• Phase shift and multi-controlled \(Z\)-type gates
• Tree search and quantum computation
• Quantum cooperative search algorithm for 3-sat

This page was built for publication: Complexity of Grover's algorithm: an algebraic approach

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