From orthogonal projections to a generalized quantum search

From orthogonal projections to a generalized quantum search
Bautista-Ramos, César; Guillén-Galván, Carlos; Rangel-Huerta, Alejandro
2012-01-06 00:00:00
A quantum algorithm with certainty is introduced in order to find a marked pre-image of an element which is known to be in the image domain of an orthogonal projection operator. The analysis of our algorithm is made by using properties of the Moebius transformations acting on the complex projective line. This new algorithm closely resembles the quantum amplitude amplification algorithm, however it is proven that our algorithm is a proper generalization of the latter (with generalized phases), in such a way that the quantum search engine of the main operator of quantum amplification is included as a particular case. In order to show that there exist search problems that can be solved by our proposal but cannot be by applying the quantum amplitude amplification algorithm, we modify our algorithm as a cryptographic authentification protocol. This protocol results to be robust enough against attacks based on the quantum amplitude amplification algorithm. As a byproduct, we show a condition where it is impossible to find exactly a pre-image of an orthoghonal projection. This result generalizes the fact that, it is impossible to find a target state exactly by using quantum amplification on a three dimensional invariant subspace.
http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.pngQuantum Information ProcessingSpringer Journalshttp://www.deepdyve.com/lp/springer-journals/from-orthogonal-projections-to-a-generalized-quantum-search-zGSbiGWQRk

Abstract

A quantum algorithm with certainty is introduced in order to find a marked pre-image of an element which is known to be in the image domain of an orthogonal projection operator. The analysis of our algorithm is made by using properties of the Moebius transformations acting on the complex projective line. This new algorithm closely resembles the quantum amplitude amplification algorithm, however it is proven that our algorithm is a proper generalization of the latter (with generalized phases), in such a way that the quantum search engine of the main operator of quantum amplification is included as a particular case. In order to show that there exist search problems that can be solved by our proposal but cannot be by applying the quantum amplitude amplification algorithm, we modify our algorithm as a cryptographic authentification protocol. This protocol results to be robust enough against attacks based on the quantum amplitude amplification algorithm. As a byproduct, we show a condition where it is impossible to find exactly a pre-image of an orthoghonal projection. This result generalizes the fact that, it is impossible to find a target state exactly by using quantum amplification on a three dimensional invariant subspace.

Journal

Quantum Information Processing
– Springer Journals

Published: Jan 6, 2012

Recommended Articles

Loading...

References

A categorical manifesto

Goguen, J.A.

Quantum mechanics helps in searching for a needle in a haystack

Grover, L.K.

Quantum computers can search rapidly by using almost any transformation

Grover, L.K.

Arbitrary phase rotation can not be used in Grover’s quantum search algorithm