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 (19)

• Random Matrix Theories in Quantum Physics: Common Concepts
• Quantum Communication Through an Unmodulated Spin Chain
• Quantum Computation and Decision Trees
• Perfect state transfer in quantum spin networks
• Perfect Transfer of Arbitrary States in Quantum Spin Networks
• An example of the difference between quantum and classical random walks
• Conclusive and arbitrarily perfect quantum state transfer using parallel spin chain channels
• The Propagation of Quantum Information Through a Spin System
• Entanglement dynamics and quantum state transport in spin chains
• Perfect State Transfer, Effective Gates and Entanglement Generation in Engineered Bosonic and Fermionic Networks
• 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 (23)

• Distance-regular graphs
• Quantum Networks on Cubelike Graphs
• Perfect state transfer on distance-regular graphs and association schemes
• State transfer in intrinsic decoherence spin channels
• Transport of Quantum Correlations across a spin chain
• State transfer in dissipative and dephasing environments
• Perfect state transfers by selective quantum interferences within complex spin networks
• Asymptotically perfect efficient quantum state transfer across uniform chains with two impurities
• Excitation- and state-transfer through spin chains in the presence of spatially correlated noise
• 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
• Robustness of spin-chain state-transfer schemes
• Entanglement of Free Fermions on Hadamard Graphs
• Perfect transfer of quantum states in a network of harmonic oscillators
• A general algorithm for manipulating non-linear and linear entanglement witnesses by using exact convex optimization
• Perfect State Transfer on Weighted Graphs of the Johnson Scheme
• Perfect quantum state transfer of hard-core bosons on weighted path graphs
• Generating GHZ state in 2m-qubit spin network
• Quantum state transfer in atom-cavity systems with uncolored Cayley interacting networks
• Generating maximally entangled distant pair in invariant stratification spin networks
• Routing a quantum state in a bio-inspired network
• Which weighted circulant networks have perfect state transfer?