Pretty good state transfer in qubit chains—The Heisenberg Hamiltonian
DOI10.1063/1.4978327zbMath1359.81047arXiv1608.04722OpenAlexW3102074691WikidataQ62597379 ScholiaQ62597379MaRDI QIDQ2974636
Gabriel Coutinho, Simone Severini, L. Banchi, Chris D. Godsil
Publication date: 10 April 2017
Published in: Journal of Mathematical Physics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1608.04722
Sums of independent random variables; random walks (60G50) Network design and communication in computer systems (68M10) Lattice systems (Ising, dimer, Potts, etc.) and systems on graphs arising in equilibrium statistical mechanics (82B20) Diophantine approximation in probabilistic number theory (11K60) Quantum information, communication, networks (quantum-theoretic aspects) (81P45)
Related Items (29)
Cites Work
- Quantum state transfer and network engineering
- Spectra of graphs
- When can perfect state transfer occur?
- Recurrence Time of a Dynamical System
- Pretty good state transfer of entangled states through quantum spin chains
- PERFECT, EFFICIENT, STATE TRANSFER AND ITS APPLICATION AS A CONSTRUCTIVE TOOL
- COMMUNICATION IN XYZ ALL-TO-ALL QUANTUM NETWORKS WITH A MISSING LINK
- Unnamed Item
This page was built for publication: Pretty good state transfer in qubit chains—The Heisenberg Hamiltonian