Quantum search in a possible three-dimensional complex subspace

DOI10.1007/S11128-011-0230-5MaRDI QIDQ430091zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

Grover's search algorithmdeflection angleidentical rotation anglesthree-dimensional complex subspace

Mathematics Subject Classification ID

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

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

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?)
• 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
• 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

(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)