Perfect Quantum State Transfer with Spinor Bosons on Weighted Graphs
Author:
- 3 November 2006
- journal article
- research article
- Published by American Physical Society (APS) in Physical Review Letters
- Vol. 97 (18) , 180502
Abstract
A duality between the properties of many spinor bosons on a regular lattice and those of a single particle on a weighted graph reveals that a quantum particle can traverse an infinite hierarchy of networks with perfect probability in polynomial time, even as the number of nodes increases exponentially. The one-dimensional “quantum wire” and the hypercube are special cases in this construction, where the number of spin degrees of freedom is equal to one and the number of particles, respectively. An implementation of a near-perfect quantum state transfer across a weighted parallelepiped with ultracold atoms in optical lattices is discussed.Keywords
All Related Versions
This publication has 16 references indexed in Scilit:
- Quantum speed limit for perfect state transfer in one dimensionPhysical Review A, 2006
- Perfect transfer of arbitrary states in quantum spin networksPhysical Review A, 2005
- Discrete Quantum Walks Hit Exponentially FasterProbability Theory and Related Fields, 2005
- Perfect State Transfer in Quantum Spin NetworksPhysical Review Letters, 2004
- Tonks–Girardeau gas of ultracold atoms in an optical latticeNature, 2004
- Transition from a Strongly Interacting 1D Superfluid to a Mott InsulatorPhysical Review Letters, 2004
- QUANTUM WALKS AND THEIR ALGORITHMIC APPLICATIONSInternational Journal of Quantum Information, 2003
- Quantum random walks: An introductory overviewContemporary Physics, 2003
- Quantum random-walk search algorithmPhysical Review A, 2003
- An Example of the Difference Between Quantum and Classical Random WalksQuantum Information Processing, 2002