Quantum search in a possible three-dimensional complex subspace

DOI10.1007/s11128-011-0230-5zbMath1243.81057OpenAlexW2019478793MaRDI QIDQ430091

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 computation (81P68) Quantum algorithms and complexity in the theory of computing (68Q12)

Related Items (3)

Dynamical analysis of Grover's search algorithm in arbitrarily high-dimensional search spaces ⋮ 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.
• Strengths and Weaknesses of Quantum Computing
• 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

This page was built for publication: Quantum search in a possible three-dimensional complex subspace