Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:1701.04145 · Linear Algebra and its Applications

Universality in perfect state transfer

Erin Connelly, Nathaniel Grammel, Michael Kraut, Luis Serazo, Christino Tamon

Published Jun 16, 2017• 8 citations
arXivHTMLPDF
DOI
10.1016/j.laa.2017.06.015

Related papers

Almost Perfect State Transfer Over Arbitrary Distances

Robert Mereau, David L. Feder

URSCA Proceedings•Nov 30, 2015•0 citations

Perfect state transfer on Cayley graphs over a non-abelian group of order $8n$

Akash Kalita, Bikash Bhattacharjya

The \textit{transition matrix} of a graph $Γ$ with adjacency matrix $A$ is defined by $H(τ) := \exp(-\mathbf{i}τA)$, where $τ\in \mathbb{R}$ and $\mathbf{i} = \sqrt{-1}$. The graph $Γ$ exhibits \textit{perfect state transfer} (PST) between the vertices $u$ and $v$ if there exists $τ_0(>0)\in \mathbb{R}$ such that $\lvert H(τ_0)_{uv} \rvert = 1$. For a positive integer $n$, the group $V_{8n}$ is defined as $V_{8n} := \langle a,b \colon a^{2n} = b^{4} = 1, ba = a^{-1}b^{-1}, b^{-1}a = a^{-1}b \rangle$. In this paper, we study the existence of perfect state transfer on Cayley graphs $\text{Cay}(V_{8n}, S)$. We present some necessary and sufficient conditions for the existence of perfect state transfer on $\text{Cay}(V_{8n}, S)$.

arXiv:2405.02122•May 3, 2024•3 citations

PERFECT, EFFICIENT, STATE TRANSFER AND ITS APPLICATION AS A CONSTRUCTIVE TOOL

Alastair Kay

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 transferred to the opposite end in a fixed time. The perfect state transfer systems are then used as a constructive tool to design Hamiltonian implementations of other primitive protocols such as entanglement generation and signal amplification in measurements, before showing that, in fact, universal quantum computation can be implemented in this way.

arXiv:0903.4274•International Journal of Quantum Information•Jun 1, 2010•348 citations

Universal state transfer on graphs

Stephen Cameron, Shannon Fehrenbach, Leah Granger +3 more

arXiv:1310.3885•Linear Algebra and its Applications•May 21, 2014•26 citations

Perfect state transfer on Cayley graphs over dihedral groups

Xiwang Cao, Keqin Feng

Recently, there are extensive studies on perfect state transfer on graphs due to their significant applications in quantum information processing and quantum computations. However, most of the graphs previously investigated are abelian Cayley graphs. In this paper, we study perfect state transfer on Cayley graphs over dihedral groups. Using the representations of the dihedral group , we present some necessary and sufficient conditions for the Cayley graph to have a perfect state transfer between two distinct vertices for some connection set S. Based on these conditions, we show that cannot have PST if n is odd and S is conjugation-closed. For some even integers n, it is possible for to have PST, some concrete constructions are provided.

Linear and Multilinear Algebra•Apr 3, 2019•29 citations

State-Transfer Collisions

Alan C. Gallagher

•Jan 1, 1970•1 citation
Perfect state transfer on Cayley graphs over a non-abelian group of order 8n8n8n
The \textit{transition matrix} of a graph ΓΓΓ with adjacency matrix AAA is defined by H(τ):=exp⁡(−iτA)H(τ) := \exp(-\mathbf{i}τA)H(τ):=exp(−iτA), where τ∈Rτ\in \mathbb{R}τ∈R and i=−1\mathbf{i} = \sqrt{-1}i=−1​. The graph ΓΓΓ exhibits \textit{perfect state transfer} (PST) between the vertices uuu and vvv if there exists τ0(>0)∈Rτ_0(>0)\in \mathbb{R}τ0​(>0)∈R such that ∣H(τ0)uv∣=1\lvert H(τ_0)_{uv} \rvert = 1∣H(τ0​)uv​∣=1. For a positive integer nnn, the group V8nV_{8n}V8n​ is defined as V8n:=⟨a,b ⁣:a2n=b4=1,ba=a−1b−1,b−1a=a−1b⟩V_{8n} := \langle a,b \colon a^{2n} = b^{4} = 1, ba = a^{-1}b^{-1}, b^{-1}a = a^{-1}b \rangleV8n​:=⟨a,b:a2n=b4=1,ba=a−1b−1,b−1a=a−1b⟩. In this paper, we study the existence of perfect state transfer on Cayley graphs Cay(V8n,S)\text{Cay}(V_{8n}, S)Cay(V8n​,S). We present some necessary and sufficient conditions for the existence of perfect state transfer on Cay(V8n,S)\text{Cay}(V_{8n}, S)Cay(V8n​,S).
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 transferred to the opposite end in a fixed time. The perfect state transfer systems are then used as a constructive tool to design Hamiltonian implementations of other primitive protocols such as entanglement generation and signal amplification in measurements, before showing that, in fact, universal quantum computation can be implemented in this way.
Recently, there are extensive studies on perfect state transfer on graphs due to their significant applications in quantum information processing and quantum computations. However, most of the graphs previously investigated are abelian Cayley graphs. In this paper, we study perfect state transfer on Cayley graphs over dihedral groups. Using the representations of the dihedral group , we present some necessary and sufficient conditions for the Cayley graph to have a perfect state transfer between two distinct vertices for some connection set S. Based on these conditions, we show that cannot have PST if n is odd and S is conjugation-closed. For some even integers n, it is possible for to have PST, some concrete constructions are provided.