A desired state can not be found with certainty for Grover's algorithm in a possible three-dimensional complex subspace
From MaRDI portal
(Redirected from Publication:544841)
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
Cites work
- scientific article; zbMATH DE number 1462669 (Why is no real title available?)
- scientific article; zbMATH DE number 2103524 (Why is no real title available?)
- scientific article; zbMATH DE number 1406119 (Why is no real title available?)
- An SO(3) picture for quantum searching.
- Experimental NMR realization of a generalized quantum search algorithm
- Phase matching in quantum searching.
- Quantum computers and unstructured search: finding and counting items with an arbitrarily entangled initial state
- Strengths and Weaknesses of Quantum Computing
Cited in
(5)- Quantum search in a possible three-dimensional complex subspace
- 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
- Dynamical analysis of Grover's search algorithm in arbitrarily high-dimensional search spaces
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)
