From orthogonal projections to a generalized quantum search

DOI10.1007/s11128-011-0355-6zbMath1263.81111MaRDI QIDQ1937233

Carlos Guillén-Galván, A. Rangel-Huerta, César Bautista-Ramos

Publication date: 28 February 2013

Published in: Quantum Information Processing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11128-011-0355-6

zbMATH Keywords

Grover algorithm; orthogonal projection; Moebius transformations; quantum amplitude amplification algorithm

Mathematics Subject Classification ID

68P10: Searching and sorting

81P68: Quantum computation

Related Items

Inexact and exact quantum searches with a preparation state in a three-dimensional subspace

Cites Work

• A desired state can not be found with certainty for Grover's algorithm in a possible three-dimensional complex subspace
• Quantum computers and unstructured search: finding and counting items with an arbitrarily entangled initial state
• MÖBIUS TRANSFORMATIONS IN QUANTUM AMPLITUDE AMPLIFICATION WITH GENERALIZED PHASES
• A categorical manifesto
• A relational model of data for large shared data banks
• Moebius transformations and continued fractions
• The convergence and values of periodic continued fractions
• 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 condition for quantum search with a generalized initial state
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item