Quantum Networks on Cubelike Graphs

Abstract

Cubelike graphs are the Cayley graphs of the elementary abelian group (Z_2)^n (e.g., the hypercube is a cubelike graph). We give conditions for perfect state transfer between two particles in quantum networks modeled by a large class of cubelike graphs. This generalizes results of Christandl et al. [Phys. Rev. Lett. 92, 187902 (2004)] and Facer et al. [Phys. Rev. A 92, 187902 (2008)].

5 pages, 2 eps figures

References in corpus (6)

• Quantum Communication through Spin Chain Dynamics: an Introductory Overview
• Perfect state transfer over distance-regular spin networks
• Perfect quantum state transfer with spinor bosons on weighted graphs
• Quantum transport on two-dimensional regular graphs
• Perfect transference of a d-level quantum state over pseudo-distance-regular networks
• A note on graphs resistant to quantum uniform mixing

Cited by in corpus (2)

• State Transfer in Highly Connected Networks and a Quantum Babinet Principle
• A general algorithm for manipulating non-linear and linear entanglement witnesses by using exact convex optimization