Files

508524.pdf (113.75 KB)

Document type

Article

Version

Published version

Publication date

2002

All rights reserved

Please use this identifier to cite or link to this item: https://hdl.handle.net/2445/9572

Majorization arrow in quantum-algorithm design

Journal Title

Authors

Director/Tutor

Journal ISSN

Volume Title

Related resource

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.

Subject

Teoria de la informació, Computació quàntica, Algorismes

Subject (English)

Information theory, Quantum computers, Algorithms

Citation

Collections

Articles publicats en revistes (Física Quàntica i Astrofísica)

Citation

LATORRE, José Ignacio and MARTÍN-DELGADO, M. A. Majorization arrow in quantum-algorithm design. Physical Review A. 2002. Vol. 66, num. 2, pags. 022305. ISSN 1050-2947. [consulted: 14 of June of 2026]. Available at: https://hdl.handle.net/2445/9572

Export metadata

JSON - METS

Share record