Títol:
|
Majorization arrow in quantum-algorithm design
|
Autor/a:
|
Latorre, José Ignacio; Martín-Delgado, M. A.
|
Altres autors:
|
Universitat de Barcelona |
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. |
Matèries:
|
-Teoria de la informació -Computació quàntica -Algorismes -Information theory -Quantum computers -Algorithms |
Drets:
|
(c) The American Physical Society, 2002
|
Tipus de document:
|
Article Article - Versió publicada |
Publicat per:
|
The American Physical Society
|
Compartir:
|
|