Majorization in quantum adiabatic algorithms
- Publication Type:
- Journal Article
- Citation:
- Physical Review A - Atomic, Molecular, and Optical Physics, 2006, 74 (4)
- Issue Date:
- 2006-10-25
Closed Access
| Filename | Description | Size | |||
|---|---|---|---|---|---|
 | 2008004803OK.pdf | 169.04 kB |
Copyright Clearance Process
- Recently Added
- In Progress
- Closed Access
This item is closed access and not available.
The majorization theory has been applied to analyze the mathematical structure of quantum algorithms. An empirical conclusion by numerical simulations obtained in the previous literature indicates that step-by-step majorization seems to appear universally in quantum adiabatic algorithms. In this paper, a rigorous analysis of the majorization arrow in a special class of quantum adiabatic algorithms is carried out. In particular, we prove that for any adiabatic algorithm of this class, step-by-step majorization of the ground state holds exactly. For the actual state, we show that step-by-step majorization holds approximately, and furthermore that the longer the running time of the algorithm, the better the approximation. © 2006 The American Physical Society.
Please use this identifier to cite or link to this item: