Parametric quantum search algorithm by CP maps: algebraic, geometric and complexity aspects
Demosthenes Ellinas, Christos Konstandakis
A toy model relaxation of the unitarity of a quantum search algorithm is introduced and the resulting parametric quantum search is investigated mathematically via a one-parameter family of completely positive trace preserving maps by introducing the oracle algebra (an SU(2) isomorphic matrix algebra). The parametric search is shown to be conditionally as fast as the original algorithm. Geometrically, it is related to spherical geodesics which exhibit an azimuthal symmetry, while its search map and density matrix enjoy geometric and structural symmetries.
Journal of Physics A Mathematical and Theoretical•Oct 1, 2013•4 citations