A generalization of quantum pair state transfer
Fuente:
arXiv
Enregistré dans:
| Auteurs principaux: | , , , , , |
|---|---|
| Format: | Preprint |
| Publié: |
2024
|
| Sujets: | |
| Accès en ligne: | |
| Tags: |
Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
|
| _version_ | 1866909271626612736 |
|---|---|
| author | Kim, Sooyeong Monterde, Hermie Ahmadi, Bahman Chan, Ada Kirkland, Stephen Plosker, Sarah |
| author_facet | Kim, Sooyeong Monterde, Hermie Ahmadi, Bahman Chan, Ada Kirkland, Stephen Plosker, Sarah |
| contents | An $s$-pair state in a graph is a quantum state of the form $\mathbf{e}_u+s\mathbf{e}_v$, where $u$ and $v$ are vertices in the graph and $s$ is a non-zero complex number. If $s=-1$ (resp., $s=1$), then such a state is called a pair state (resp. plus state). In this paper, we develop the theory of perfect $s$-pair state transfer in continuous quantum walks, where the Hamiltonian is taken to be the adjacency, Laplacian or signless Laplacian matrix of the graph. We characterize perfect $s$-pair state transfer in complete graphs, cycles and antipodal distance-regular graphs admitting vertex perfect state transfer. We construct infinite families of graphs with perfect $s$-pair state transfer using quotient graphs and graphs that admit fractional revival. We provide necessary and sufficient conditions such that perfect state transfer between vertices in the line graph relative to the adjacency matrix is equivalent to perfect state transfer between the plus states formed by corresponding edges in the graph relative to the signless Laplacian matrix. Finally, we characterize perfect state transfer between vertices in the line graphs of Cartesian products relative to the adjacency matrix. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2404_16654 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | A generalization of quantum pair state transfer Kim, Sooyeong Monterde, Hermie Ahmadi, Bahman Chan, Ada Kirkland, Stephen Plosker, Sarah Quantum Physics Combinatorics 05C50, 81P45, 05C76, 15A18, 81Q10 An $s$-pair state in a graph is a quantum state of the form $\mathbf{e}_u+s\mathbf{e}_v$, where $u$ and $v$ are vertices in the graph and $s$ is a non-zero complex number. If $s=-1$ (resp., $s=1$), then such a state is called a pair state (resp. plus state). In this paper, we develop the theory of perfect $s$-pair state transfer in continuous quantum walks, where the Hamiltonian is taken to be the adjacency, Laplacian or signless Laplacian matrix of the graph. We characterize perfect $s$-pair state transfer in complete graphs, cycles and antipodal distance-regular graphs admitting vertex perfect state transfer. We construct infinite families of graphs with perfect $s$-pair state transfer using quotient graphs and graphs that admit fractional revival. We provide necessary and sufficient conditions such that perfect state transfer between vertices in the line graph relative to the adjacency matrix is equivalent to perfect state transfer between the plus states formed by corresponding edges in the graph relative to the signless Laplacian matrix. Finally, we characterize perfect state transfer between vertices in the line graphs of Cartesian products relative to the adjacency matrix. |
| title | A generalization of quantum pair state transfer |
| topic | Quantum Physics Combinatorics 05C50, 81P45, 05C76, 15A18, 81Q10 |
| url | https://arxiv.org/abs/2404.16654 |