Quantum Networks on Cubelike Graphs
arXiv:0808.0510 · doi:10.1103/PhysRevA.78.052320
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 (13)
- Quantum random walks - an introductory overview
- Perfect state transfer in quantum spin networks
- Quantum Communication through Spin Chain Dynamics: an Introductory Overview
- An example of the difference between quantum and classical random walks
- Hitting time for quantum walks on the hypercube
- Spacetime structures of continuous time quantum walks
- Decoherence in Quantum Walks on the Hypercube
- Perfect state transfer over distance-regular spin networks
- Perfect quantum state transfer with spinor bosons on weighted graphs
- Quantum switching networks for perfect qubit routing
- 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 (42)
- A Review of Perfect State Transfer and its Application as a Constructive Tool
- Perfect state transfer in cubelike graphs
- Perfect Quantum Routing in Regular Spin Networks
- The Basics of Perfect Communication through Quantum Networks
- Perfect state transfer on distance-regular graphs and association schemes
- Universal quantum computation by discontinuous quantum walk
- Eigenvalues of Cayley graphs
- Perfect quantum state transfer on diamond fractal graphs
- Perfect quantum state transfer using Hadamard diagonalizable graphs
- Spectra of Perfect State Transfer Hamiltonians on Fractal-Like Graphs
- Asymptotically perfect efficient quantum state transfer across uniform chains with two impurities
- Perfect state transfer in products and covers of graphs
- Perfect State Transfer on NEPS of the path P3
- State Transfer in Highly Connected Networks and a Quantum Babinet Principle
- Mixed-state quantum transport in correlated spin networks
- Parity-dependent state transfer for direct entanglement generation
- On state transfer in Cayley graphs for abelian groups
- Strongly cospectral vertices in normal Cayley graphs
- A general algorithm for manipulating non-linear and linear entanglement witnesses by using exact convex optimization
- Unifying quantum spatial search, state transfer and uniform sampling on graphs: simple and exact
- Co-Processors for Quantum Devices
- Short time behavior of continuous time quantum walks on graphs
- Perfect quantum state transfer of hard-core bosons on weighted path graphs
- Enhancing quantum state transfer efficiency in binary-tree spin networks by partially collapsing measurements
- Perfect state transfer, graph products and equitable partitions
- Bounds on probability of state transfer with respect to readout time and edge weight
- Implementation of hitting times of discrete time quantum random walks on Cubelike graphs
- Perfect State Transfer on Signed Graphs
- Perfect State Transfer in Weighted Cubelike Graphs
- Continuous-time Quantum Walks on Cayley Graphs of Extraspecial Groups
- Complex Hadamard Diagonalisable Graphs
- Perfect state transfer on quotient graphs
- State Transfer on Graphs
- The 3-dimensional cube is the only periodic, connected cubic graph with perfect state transfer
- Walk Entropies in Graphs
- Perfect state transfer of a qudit over underlying networks of group association schemes
- Perfect state transfer over interacting boson networks associated with group schemes
- Perfect state transfer in NEPS of complete graphs
- A Note on Eigenvalues of Cayley Graphs
- Perfect quantum state transfer in weighted paths with potentials (loops) using orthogonal polynomials
- Uniform mixing on integral abelian Cayley graph
- Perfect edge state transfer on cubelike graphs