Please use this identifier to cite or link to this item:
Title: Majorization arrow in quantum-algorithm design
Author: Latorre, José Ignacio
Martín-Delgado, M. A.
Keywords: Teoria de la informació
Computació quàntica
Information theory
Quantum computers
Issue Date: 2002
Publisher: The American Physical Society
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.
Note: Reproducció digital del document publicat en format paper, proporcionada per PROLA i
It is part of: Physical Review A, 2002, vol. 66, núm. 2, p. 022305.
ISSN: 1050-2947
Appears in Collections:Articles publicats en revistes (Física Quàntica i Astrofísica)

Files in This Item:
File Description SizeFormat 
508524.pdf113.75 kBAdobe PDFView/Open

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.