The Majorization Arrow in Quantum Algorithm Design
arXiv:quant-ph/0111146 · doi:10.1103/PhysRevA.66.022305
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.
REVTEX4.b4 file, 4 color figures (typos corrected.)
References in corpus (3)
Cited by in corpus (18)
- A short review on entanglement in quantum spin systems
- Universality of Entanglement and Quantum Computation Complexity
- Adiabatic quantum computation and quantum phase transitions
- Quantum circuits for maximally entangled states
- Majorization relations and entanglement generation in a beam splitter
- Optimal common resource in majorization-based resource theories
- Coherence Depletion in Quantum Algorithms
- Quantum Entanglement involved in Grover's and Shor's algorithms: the four-qubit case
- Approximate transformations of bipartite pure-state entanglement from the majorization lattice
- The principle of majorization: application to random quantum circuits
- Shortcut to Multipartite Entanglement Generation: A Graph Approach to Boson Subtractions
- Quantum Phase Transitions in Anti-ferromagnetic Planar Cubic Lattices
- Complementarity and Entanglement in Quantum Information Theory
- Majorization and the time complexity of linear optical networks
- Spectral order and isotonic differential operators of Laguerre-Polya type
- Majorization in General Grover's Algorithms: Efficient vs Non-efficient cases
- Majorization in Quantum Adiabatic Algorithms
- Maximal Entanglement: Applications in Quantum Information and Particle Physics