# name
Majorization arrow in quantum-algorithm design

# metadata.dc.description.abstract[].value
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.

# metadata.dc.relation.isformatof[].value
Reproducció digital del document publicat en format paper, proporcionada per PROLA i http://dx.doi.org/10.1103/PhysRevA.66.022305

# metadata.dc.source[].value
Articles publicats en revistes (Física Quàntica i Astrofísica)

# metadata.dc.title[].value
Majorization arrow in quantum-algorithm design