Phys. Rev. A 66, 022305 (2002) [5 pages]Majorization arrow in quantum-algorithm designReceived 11 December 2001; published 9 August 2002 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. © 2002 The American Physical Society URL:
http://link.aps.org/doi/10.1103/PhysRevA.66.022305
DOI:
10.1103/PhysRevA.66.022305
PACS:
03.67.Lx, 02.30.Lt, 89.70.+c
|
|
About | Terms and Conditions | Subscriptions | Search | Help
Use of the American Physical Society websites and journals implies that the user has read and agrees to our Terms and Conditions and any applicable Subscription Agreement. Physical Review®, Physical Review Letters®, Reviews of Modern Physics®, and Physical Review Special Topics® are trademarks of the American Physical Society.