Majorization arrow in quantum-algorithm design
Open Access
- 9 August 2002
- journal article
- research article
- Published by American Physical Society (APS) in Physical Review A
- Vol. 66 (2) , 022305
- https://doi.org/10.1103/physreva.66.022305
Abstract
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.Keywords
All Related Versions
This publication has 8 references indexed in Scilit:
- Information and computation: Classical and quantum aspectsReviews of Modern Physics, 2002
- Family of Grover’s quantum-searching algorithmsPhysical Review A, 2000
- Quantum Algorithm for Distributed Clock SynchronizationPhysical Review Letters, 2000
- Conditions for a Class of Entanglement TransformationsPhysical Review Letters, 1999
- Analog analogue of a digital quantum computationPhysical Review A, 1998
- Quantum algorithms revisitedProceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences, 1998
- Quantum Mechanics Helps in Searching for a Needle in a HaystackPhysical Review Letters, 1997
- Some Methods applicable to Identities and Inequalities of Symmetric Algebraic Functions of n LettersProceedings of the Edinburgh Mathematical Society, 1902