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-7zbMATH Open1216.81049OpenAlexW2031465840MaRDI QIDQ544841FDOQ544841
Authors: 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
Recommendations
- Quantum search in a possible three-dimensional complex subspace
- Dynamical analysis of Grover's search algorithm in arbitrarily high-dimensional search spaces
- Algebraic analysis of quantum search with pure and mixed states
- An SO(3) picture for quantum searching.
- Phase condition for the Grover algorithm
Searching and sorting (68P10) Quantum algorithms and complexity in the theory of computing (68Q12) Quantum computation (81P68)
Cites Work
- Strengths and Weaknesses of Quantum Computing
- Phase matching in quantum searching.
- Title not available (Why is that?)
- An SO(3) picture for quantum searching.
- Title not available (Why is that?)
- Quantum computers and unstructured search: finding and counting items with an arbitrarily entangled initial state
- Title not available (Why is that?)
- Experimental NMR realization of a generalized quantum search algorithm
Cited In (5)
- Dynamical analysis of Grover's search algorithm in arbitrarily high-dimensional search spaces
- Quantum search in a possible three-dimensional complex subspace
- An efficient quantum search engine on unsorted database
- Inexact and exact quantum searches with a preparation state in a three-dimensional subspace
- From orthogonal projections to a generalized quantum search
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
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q544841)
