Quantum search in a possible three-dimensional complex subspace
DOI10.1007/S11128-011-0230-5zbMATH Open1243.81057OpenAlexW2019478793MaRDI QIDQ430091FDOQ430091
Authors: Wenliang Jin 
Publication date: 20 June 2012
Published in: Quantum Information Processing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11128-011-0230-5
Recommendations
- Inexact and exact quantum searches with a preparation state in a three-dimensional subspace
- An SO(3) picture for quantum searching.
- Quantum search on simplicial complexes
- On the quantum query complexity of local search in two and three dimensions
- Spatial quantum search in a triangular network
- Quantum search of spatial regions
- Quantum search algorithms on the hypercube
- A realization scheme for quantum multi-object search
- From orthogonal projections to a generalized quantum search
- A desired state can not be found with certainty for Grover's algorithm in a possible three-dimensional complex subspace
Grover's search algorithmdeflection angleidentical rotation anglesthree-dimensional complex subspace
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?)
- 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
- More general quantum search algorithm \(Q=-I_\gamma VI_\tau U\) and the precise formula for the amplitude and the non-symmetric effects of different rotating angles
Cited In (7)
- Dynamical analysis of Grover's search algorithm in arbitrarily high-dimensional search spaces
- An efficient quantum search engine on unsorted database
- An SO(3) picture for quantum searching.
- Inexact and exact quantum searches with a preparation state in a three-dimensional subspace
- A desired state can not be found with certainty for Grover's algorithm in a possible three-dimensional complex subspace
- More general quantum search algorithm \(Q=-I_\gamma VI_\tau U\) and the precise formula for the amplitude and the non-symmetric effects of different rotating angles
- Precise probability that Grover's quantum search finds a solution
This page was built for publication: Quantum search 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 Q430091)
