Spin Chains, Graphs and State Revival

@article{Miki2018SpinCG,
  title={Spin Chains, Graphs and State Revival},
  author={Hiroshi Miki and Satoshi Tsujimoto and Luc Vinet},
  journal={Orthogonal Polynomials},
  year={2018}
}
Connections between the 1-excitation dynamics of spin lattices and quantum walks on graphs will be surveyed. Attention will be paid to perfect state transfer (PST) and fractional revival (FR) as well as to the role played by orthogonal polynomials in the study of these phenomena. Included is a discussion of the ordered Hamming scheme, its relation to multivariate Krawtchouk polynomials of the Tratnik type, the exploration of quantum walks on graphs of this association scheme and their… 

Quantum walk on extension of association schemes

. In this paper, we study quantum walks on the extension of association schemes. Various state transfers can be achieved on these graphs, such as multiple state transfer among extreme points of a

Czech Technical University in Prague Faculty of Nuclear Sciences and Physical Engineering DOCTORAL THESIS State Transfer in Imperfect Networks Prague 2020

This work explores the adverse effects of several perturbations of the ideal models inspired by the physical character of these systems, and proposes Dynamical Decoupling, a quantum error correction method, restricted to using single-particle operations only.

References

SHOWING 1-10 OF 34 REFERENCES

Quantum walks on graphs of the ordered Hamming scheme and spin networks

It is shown that the hopping of a single excitation on certain triangular spin lattices with non-uniform couplings and local magnetic fields can be described as the projections of quantum walks on

Perfect State Transfer in Quantum Walks on Graphs

We provide a brief survey of perfect state transfer in quantum walks on finite graphs. The ability to transfer a quantum state from one part of a quantum computer to another is a key ingredient of

How to construct spin chains with perfect state transfer

It is shown how to systematically construct the $XX$ quantum spin chains with nearest-neighbor interactions that allow perfect state transfer (PST). Sets of orthogonal polynomials (OPs) are in

An Example of the Difference Between Quantum and Classical Random Walks

A general definition of quantum random walks on graphs is discussed and with a simple graph the possibility of very different behavior between a classical random walk and its quantum analog is illustrated.

Quantum communication through spin chain dynamics: an introductory overview

We present an introductory overview of the use of spin chains as quantum wires, which has recently developed into a topic of lively interest. The principal motivation is in connecting quantum

Quantum State Transfer in a Two-dimensional Regular Spin Lattice of Triangular Shape

Quantum state transfer in a triangular domain of a two-dimensional, equally-spaced, spin lat- tice with non-homogeneous nearest-neighbor couplings is analyzed. An exact solution of the one-

Quantum Perfect State Transfer in a 2D Lattice

A finite oscillator model based on two-variable Krawtchouk polynomials is presented and its application to spin dynamics is discussed. The model is defined on a triangular lattice. The conditions

Perfect Transfer of Arbitrary States in Quantum Spin Networks

We propose a class of qubit networks that admit perfect state transfer of any two-dimensional quantum state in a fixed period of time. We further show that such networks can distribute arbitrary

Perfect, Efficent, State Transfer and its Application as a Constructive Tool

We review the subject of perfect state transfer — how one designs the (fixed) interactions of a chain of spins so that a quantum state, initially inserted on one end of the chain, is perfectly