2001/11/30 by José I. Latorre, J. I. Latorre, M. A. Martín-Delgado +1 · 1 citation
Computer Science · Physics and Astronomy · #Quantum Computing Algorithms and Architecture #Quantum Information and Cryptography #Quantum Mechanics and Applications #cond-mat #hep-th #quant-ph
paper · pdf · doi:10.1103/physreva.66.022305
REVTEX4.b4 file, 4 color figures (typos corrected.)
arxiv created 2001/12/04 · openalex publication_date 2002/08/09 · arxiv updated 2009/11/30 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
We apply majorization theory to study the quantum algorithms known so far and find that there is a majorization principle underlying the way they operate. Grover's algorithm is a neat instance of this principle where majorization works step by step until the optimal target state is found. Extensions of this situation are also found in algorithms based in quantum adiabatic evolution and the family of quantum phase-estimation algorithms, including Shor's algorithm. We state that in quantum algorithms the time arrow is a majorization arrow.