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

DOI10.1007/s11128-014-0810-2zbMath1305.81049OpenAlexW2074609811MaRDI QIDQ488196

J. M. Amezcua-Ortega, D. A. Valdes-Amaro, A. Rangel-Huerta, Carlos Guillén-Galván, César Bautista-Ramos

Publication date: 23 January 2015

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

Full work available at URL: https://doi.org/10.1007/s11128-014-0810-2

zbMATH Keywords

Grover algorithm\(k\)-potent matrixcyclic subspaceexact quantum searchquantum amplitude amplification algorithm

Mathematics Subject Classification ID

Searching and sorting (68P10) Quantum computation (81P68)

Cites Work

• Quantum search in a possible three-dimensional complex subspace
• A desired state can not be found with certainty for Grover's algorithm in a possible three-dimensional complex subspace
• From orthogonal projections to a generalized quantum search
• Phase matching in quantum searching.
• Quantum Computation and Quantum Information
• Fixed-Point Quantum Search
• 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

This page was built for publication: Inexact and exact quantum searches with a preparation state in a three-dimensional subspace