Perfect quantum state transfer with spinor bosons on weighted graphs

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 near-perfect quantum state transfer across a weighted parallelepiped with ultracold atoms in optical lattices is discussed.

4 pages, 2 figures, revtex

References in corpus (2)

• Perfect Transfer of Arbitrary States in Quantum Spin Networks
• Quantum Speed Limit for Perfect State Transfer in One Dimension

Cited by in corpus (7)

• Quantum Networks on Cubelike Graphs
• Quantum walks on quotient graphs
• Adiabatic Quantum Transport in a Spin Chain with a Moving Potential
• Theoretical analysis of perfect quantum state transfer with superconducting qubits
• Iterative quantum state transfer along a chain of nuclear spin qubits
• Storing quantum states in bosonic dissipative networks
• Cooling ultracold bosons in optical lattices by spectral transform