Perfect quantum state transfer using Hadamard diagonalizable graphs
DOI10.1016/j.laa.2017.05.037zbMath1370.05137arXiv1610.06094OpenAlexW2536379336MaRDI QIDQ2402461
Sarah Plosker, Nathaniel Johnston, Rebecca Storey, Xiao-Hong Zhang, Stephen J. Kirkland
Publication date: 7 September 2017
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1610.06094
Laplacian matrixquantum state transferperfect state transferdouble coverHadamard diagonalizable graphcubelike graphs
Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Eigenvalues, singular values, and eigenvectors (15A18) Graph operations (line graphs, products, etc.) (05C76) Quantum information, communication, networks (quantum-theoretic aspects) (81P45)
Related Items
Cites Work
- Perfect state transfer in Laplacian quantum walk
- Perfect state transfer in cubelike graphs
- On Hadamard diagonalizable graphs
- Characterization of quantum circulant networks having perfect state transfer
- Sensitivity analysis of perfect state transfer in quantum spin networks
- Perfect state transfer in products and covers of graphs
- Pretty good state transfer in qubit chains—The Heisenberg Hamiltonian
- Perfect state transfer, integral circulants and join of graphs
- QUANTUM PERFECT STATE TRANSFER ON WEIGHTED JOIN GRAPHS
- Approximation to real irrationals by certain classes of rational fractions