Physics – Quantum Physics
Scientific paper
2002-12-16
European Physical Journal D 29, 119-132 (2004)
Physics
Quantum Physics
15 pages, 14 figures, final version
Scientific paper
10.1140/epjd/e2004-00009-3
Motivated by the need to uncover some underlying mathematical structure of optimal quantum computation, we carry out a systematic analysis of a wide variety of quantum algorithms from the majorization theory point of view. We conclude that step-by-step majorization is found in the known instances of fast and efficient algorithms, namely in the quantum Fourier transform, in Grover's algorithm, in the hidden affine function problem, in searching by quantum adiabatic evolution and in deterministic quantum walks in continuous time solving a classically hard problem. On the other hand, the optimal quantum algorithm for parity determination, which does not provide any computational speed-up, does not show step-by-step majorization. Lack of both speed-up and step-by-step majorization is also a feature of the adiabatic quantum algorithm solving the 2-SAT ``ring of agrees'' problem. Furthermore, the quantum algorithm for the hidden affine function problem does not make use of any entanglement while it does obey majorization. All the above results give support to a step-by-step Majorization Principle necessary for optimal quantum computation.
Latorre Jose I.
Martin-Delgado Miguel Angel
Orus Roman
No associations
LandOfFree
Systematic Analysis of Majorization in Quantum Algorithms does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Systematic Analysis of Majorization in Quantum Algorithms, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Systematic Analysis of Majorization in Quantum Algorithms will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-426992