Systematic Analysis of Majorization in Quantum Algorithms

Abstract

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.

15 pages, 14 figures, final version

Cited by in corpus (9)

• A short review on entanglement in quantum spin systems
• Correlations in Grover search
• Coherence Depletion in Quantum Algorithms
• The principle of majorization: application to random quantum circuits
• Shortcut to Multipartite Entanglement Generation: A Graph Approach to Boson Subtractions
• Quantum Phase Transitions in Anti-ferromagnetic Planar Cubic Lattices
• Majorization and the time complexity of linear optical networks
• On the solution of trivalent decision problems by quantum state identification
• Majorization in Quantum Adiabatic Algorithms