A desired state can not be found with certainty for Grover's algorithm in a possible three-dimensional complex subspace

DOI10.1007/s11128-010-0209-7zbMath1216.81049OpenAlexW2031465840MaRDI QIDQ544841

Wenliang Jin, Xiang-Dong Chen

Publication date: 16 June 2011

Published in: Quantum Information Processing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11128-010-0209-7

zbMATH Keywords

deflection angleidentical rotation anglesGrover's quantum search algorithm

Mathematics Subject Classification ID

Searching and sorting (68P10) Quantum computation (81P68) Quantum algorithms and complexity in the theory of computing (68Q12)

Related Items (3)

From orthogonal projections to a generalized quantum search ⋮ An efficient quantum search engine on unsorted database ⋮ Inexact and exact quantum searches with a preparation state in a three-dimensional subspace

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Quantum computers and unstructured search: finding and counting items with an arbitrarily entangled initial state
• Phase matching in quantum searching.
• AnSO(3) picture for quantum searching
• Strengths and Weaknesses of Quantum Computing
• Experimental NMR realization of a generalized quantum search algorithm

This page was built for publication: A desired state can not be found with certainty for Grover's algorithm in a possible three-dimensional complex subspace