Linear and Multilinear Algebra · 2019 · 15 citations · 16 references
Natural SciencesMathematicsCombinatoricsComplex SystemsDynamical SystemsDirected Acyclic GraphsGraph AlgorithmsGraph TheoryGraph LaplacianGraph Theory In NetworksState Transfer
For two graphs G and H, the corona product G∘H is the graph obtained by taking one copy of G and |VG| copies of H, and joining the ith vertex of G with every vertex of the ith copy of H. In this paper, we study the state transfer of corona relative to the signless Laplacian matrix. We explore some conditions that guarantee the signless Laplacian perfect state transfer in G∘H. We prove that G∘Km has no signless Laplacian perfect state transfer for some special m. We also show that K2∘H has pretty good state transfer but no perfect state transfer relative to the signless Laplacian matrix for a regular graph H. Furthermore, we show that nK2¯∘K1 has signless Laplacian pretty good state transfer, where nK2¯ is the cocktail party graph.
16
An introduction to the theory of numbers
Journal of the Franklin Institute · 1960 · 3.7K citations
Quantum Communication through an Unmodulated Spin Chain
Sougato Bose · Physical Review Letters · 2003 · 1.4K citations · Full text
Quantum computation and decision trees
Edward Farhi, Sam Gutmann · Physical Review A · 1998 · 1.3K citations · Full text
Perfect State Transfer in Quantum Spin Networks
Matthias Christandl, Nilanjana Datta, Artur Ekert et al. · Physical Review Letters · 2004 · 1.2K citations · Full text
Computing, Computer Science, Physics +15