Perfect state transfer over distance-regular spin networks

Abstract

By considering distance-regular graphs as spin networks, first we introduce some particular spin Hamiltonians which are extended version of those of Refs.\cite{8,9''}. Then, by using spectral analysis techniques and algebraic combinatoric structure of distance-regular graphs such as stratification introduced in \cite{obata, js} and Bose-Mesner algebra, we give a method for finding a set of coupling constants in the Hamiltonians so that a particular state initially encoded on one site of a network will evolve freely to the opposite site without any dynamical controls, i.e., we show that how to derive the parameters of the system so that perfect state transfer (PST) can be achieved. As examples, the cycle networks with even number of vertices and $d$-dimensional hypercube networks are considered in details and the method is applied for some important distance-regular networks in appendix.

37 pages, 2 figures

References in corpus (11)

• Perfect Transfer of Arbitrary States in Quantum Spin Networks
• The Propagation of Quantum Information Through a Spin System
• Perfect quantum state transfer with randomly coupled quantum chains
• Perfect State Transfer: Beyond Nearest-Neighbor Couplings
• Quantum Speed Limit for Perfect State Transfer in One Dimension
• Perfect state transfer in networks of arbitrary topology and coupling configuration
• Quantum Communication in Spin Systems With Long-Range Interactions
• Investigation of continuous-time quantum walk by using Krylov subspace-Lanczos algorithm
• Investigation of Continuous-Time Quantum Walk Via Modules of Bose-Mesner and Terwilliger Algebras
• Evaluation of effective resistances in pseudo-distance-regular resistor networks
• Investigation of continuous-time quantum walk on root lattice $A_n$ and honeycomb lattice

Cited by in corpus (5)

• Quantum Networks on Cubelike Graphs
• State Transfer in Highly Connected Networks and a Quantum Babinet Principle
• Perfect transference of a d-level quantum state over pseudo-distance-regular networks
• Two-qutrit Entanglement Witnesses and Gell-Mann Matrices
• A general algorithm for manipulating non-linear and linear entanglement witnesses by using exact convex optimization