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:2609.12725

Fractional revival in complementary prisms of graphs

Sarojini Mohapatra, Hiranmoy Pal

math.COquant-phSubmitted Sep 11, 2026• Announced Sep 14, 2026
arXivHTMLPDF

Abstract

The complementary prism $G\overline{G}$ of a graph $G$ is obtained from the disjoint union of $G$ and its complement $\overline{G}$ by adding an edge between each vertex $a$ in $G$ and its copy $a'$ in $\overline{G}.$ This paper explores a general framework for studying fractional revival with respect to real symmetric matrices with a block structure. The framework is then used to show that, for a fixed state $\mathbf{u}$ in $G$ orthogonal to the all-one vector, the complementary prism $G\overline{G}$ exhibits fractional revival from the state $[\mathbf{u},\mathbf{0}]^T$ with respect to the adjacency, Laplacian, and signless Laplacian matrices. We further characterize perfect pair state transfer in the complementary prism of a complete graph and establish the existence of perfect pair and plus state transfer in the complementary prism of a complete bipartite graph.

Related papers

Pretty good plus state transfer in cycles

Sarojini Mohapatra, Hiranmoy Pal

We investigate fractional revival in graphs with respect to the adjacency, Laplacian, and signless Laplacian matrices. We observe that, under certain conditions, fractional revival is preserved under graph complementation. Then we establish a connection between fractional revival in a graph and in its double cover, and obtain a complete characterization of pretty good plus state transfer in cycles and their complements. This leads to characterizations of pretty good vertex state transfer in weighted paths with potential.

math.COCross-listedarXiv:2603.17595•Mar 19, 2026

Perfect State Transfer Between Real Pure States

Chris D. Godsil, Steve Kirkland, Hermie Monterde

Abstract. Pure states correspond to one-dimensional subspaces of [Formula: see text] represented by unit vectors. In this paper, we develop the theory of perfect state transfer (PST) between real pure states with emphasis on the adjacency and Laplacian matrices as Hamiltonians of a graph representing a quantum spin network. We characterize PST between real pure states based on the spectral information of a graph and prove three fundamental results: (i) every periodic real pure state [Formula: see text] admits PST with another real pure state [Formula: see text], (ii) every connected graph admits PST between real pure states, and (iii) for any pair of real pure states [Formula: see text] and [Formula: see text] and for any time [Formula: see text], there exists a real symmetric matrix [Formula: see text] such that [Formula: see text] and [Formula: see text] admit PST relative to [Formula: see text] at time [Formula: see text]. We also determine all real pure states that admit PST in complete graphs, complete bipartite graphs, paths, and cycles. This leads to a complete characterization of pair and plus state transfer in paths and complete bipartite graphs. We give constructions of graphs that admit PST between real pure states. Finally, using results on the spread of graphs, we prove that amongst all [Formula: see text]-vertex simple unweighted graphs, the least minimum PST time between real pure states is attained by any join graph for the Laplacian case, while it is attained by the join of an empty graph and a complete graph of appropriate sizes for the adjacency case. Reproducibility of computational results. This paper has been awarded the “SIAM Reproducibility Badge: Code and data available” as a recognition that the authors have followed reproducibility principles valued by SIMAX and the scientific computing community. Code and data that allow readers to reproduce the results in this paper are available at none . [Formula: see text]

arXiv:2502.08103•SIAM Journal on Matrix Analysis and Applications•Sep 17, 2025•5 citations

Edge State Transfer

Qiuting Chen

Let G be a graph and let t be a positive real number. Then the evolution of the continuous quantum walk defined on G is described by the transition matrix U(t)=exp(itH).The matrix H is called Hamiltonian. So far the most studied quantum walks are the ones whose Hamiltonians are the adjacency matrices of the underlying graphs and initial states are vertex states e_a, with e_a being the characteristic vector of vertex a. \n \nThis thesis focuses on Laplacian edge state transfer, that is, the quantum walks whose initial states are edge states e_a-e_b and Hamiltonians are the Laplacians of the underlying graphs. So far the research about perfect state transfer only involves vertex states and Laplacian edge state transfer has not been studied before. We extend the known results of perfect vertex state transfer and periodicity of vertex states to Laplacian edge state transfer. \n \nWe prove two useful closure properties for perfect Laplacian edge state transfer. One is that complementation preserves perfect edge state transfer. The other is that if G has perfect Laplacian edge state transfer at time τ and H has perfect Laplacian vertex state transfer also at time τ, then with some mild assumption on the pairs of vertex states and edge states that have perfect state transfer, the Cartesian product G □ H also admits perfect edge state transfer. Those two properties provide us new ways to construct graphs with perfect Laplacian edge state transfer. We also observe one phenomenon that happens in Laplacian edge state transfer which never happens in vertex state transfer: if there is perfect state transfer from e_a-e_b to e_α-e_β and also from e_b-e_c to e_β-e_γ at the same time t in G, then G admits perfect state transfer from e_a-e_c to e_α-e_γ at time t. \n \nWe give characterizations of perfect Laplacian edge state transfer in cycles, paths and complete bipartite graphs K_{2,4n}. We study perfect state transfer and periodicity on edge states with special spectral features. We also consider the case when the unsigned Laplacian is Hamiltonian and initial states are plus states of the form e_a+e_b. In this case, we characterize perfect state transfer in paths, cycles and bipartite graphs. \nWe close this thesis by a list of open questions.

•Jan 11, 2019•2 citations

Closed-form autonomous optimal cloning on spin networks beyond the star: fractional revival, perfect transfer and balanced beam splitters in symmetric sectors

Hikaru Wakaura

Abstract Copying quantum information is forbidden by the no-cloning theorem, yet approximate copies with the highest fidelity allowed by quantum mechanics are a basic resource for quantum networks and for assessing the security of quantum key distribution. Such cloners are usually gate sequences, but a spin network with fixed couplings can perform the transformation autonomously: the unknown qubit and blank qubits sit on the vertices of a graph and the free evolution does the rest. Until now, the only spin graph known to reach the optimal phase-covariant fidelity for every number of clones $M$ was the star with a tuned anisotropy. Which other graphs can clone optimally, and why, has remained open. Here we show that the complete bipartite graph $K_{2,M-1}$---the unknown qubit and one target on one side, the remaining targets on the other---reaches the optimal $1\to M$ phase-covariant fidelity for every $M\ge 3$, with all couplings given in closed form. For odd $M$ a staggered Ising anisotropy suffices, with the parameters fixed by two integers; for even $M$ an additional Ising coupling among the middle targets is required, with its value an explicit algebraic number. Both families reduce, in the permutation-symmetric sectors, to two four-level problems: a perfect-state-transfer ladder on a four-cycle and a freeze block whose characteristic polynomial we obtain analytically. We verify the formulas with no free parameter up to $M=10$ and classify exactness for all four-vertex graphs with a least-squares test of the exact revival and transfer equations. The results connect the fractional-revival engineering of spin chains to optimal cloning and identify the hidden involution behind both. Beyond cloning, optimal quantum machines can thus be read off from the spectrum of small symmetric blocks, suggesting autonomous implementations of other covariant transformations on spin and Rydberg arrays.

•Oct 19, 2026•0 citations

Perfect $(s,r)$-state transfer

Stephen Kirkland, Hermie Monterde, Sarah Plosker

Much work has been done in the last two decades on the topic of quantum state transfer in a quantum spin network. One can model such a system of interacting qubits using an undirected graph, and studying vertex-to-vertex dynamics. This setup has recently been relaxed to allow for dynamics between linear combinations of two vertex states, i.e.\ from $\mathbf u = \mathbf e_a + s \mathbf e_b$ to $\mathbf μ=\mathbf e_α + r \mathbf e_β$, where $r=s$ is either $-1$ (which corresponds to pair state transfer) or $+1$ (which corresponds to plus state transfer), or more recently $r=s$ is taken to be any real number (which corresponds to $s$-pair state transfer). Here, we broaden the investigation of $s$-pair state transfer to \textit{perfect $(s,r)$-state transfer}, which is perfect state transfer from $\mathbf u = \mathbf e_a + s \mathbf e_b$ to $\mathbf μ=\mathbf e_α + r \mathbf e_β$ (up to some dilation) where $r,s\in \mathbb C$. We identify infinite families of graphs with perfect $(s,r)$-state transfer and provide characterizations of cases when $|r|= |s|$ and when $|r|\neq |s|$, showing situations when the degree of entanglement between vertex states is preserved, and when it is not preserved. The latter is particularly important as it represents perfect state transfer from an entangled pair of qubits to another one where the degree of entanglement need not be the same\mdash in fact, it can be set up so as to ``boost'' (increase) entanglement. We provide an algorithm that finds the vector with two nonzero entries that maximizes the fidelity of transfer for a fixed time $t$ starting from a given $s$-pair state $\mathbf u$. Finally, we provide a sensitivity analysis, with respect to readout time errors, of perfect $(s,r)$-state transfer.

quant-pharXiv:2609.10713•Sep 11, 2026•0 citations

Approximate quantum fractional revival in paths and cycles

Ada Chan, Whitney Drazen, Or Eisenberg +2 more

We initiate the study of approximate quantum fractional revival in graphs, a generalization of pretty good quantum state transfer in graphs. We give a complete characterization of approximate fractional revival in a graph in terms of the eigenvalues and eigenvectors of the adjacency matrix of a graph. This characterization follows from a lemma due to Kronecker on Diophantine approximation, and is similar to the spectral characterization of pretty good state transfer in graphs. Using this, we give a complete characterizations of when approximate fractional revival can occur in paths and in cycles.

arXiv:2005.00492•May 1, 2020•3 citations
The complementary prism GG‾G\overline{G}GG of a graph GGG is obtained from the disjoint union of GGG and its complement G‾\overline{G}G by adding an edge between each vertex aaa in GGG and its copy a′a'a′ in G‾.\overline{G}.G. This paper explores a general framework for studying fractional revival with respect to real symmetric matrices with a block structure. The framework is then used to show that, for a fixed state u\mathbf{u}u in GGG orthogonal to the all-one vector, the complementary prism GG‾G\overline{G}GG exhibits fractional revival from the state [u,0]T[\mathbf{u},\mathbf{0}]^T[u,0]T with respect to the adjacency, Laplacian, and signless Laplacian matrices. We further characterize perfect pair state transfer in the complementary prism of a complete graph and establish the existence of perfect pair and plus state transfer in the complementary prism of a complete bipartite graph.
We investigate fractional revival in graphs with respect to the adjacency, Laplacian, and signless Laplacian matrices. We observe that, under certain conditions, fractional revival is preserved under graph complementation. Then we establish a connection between fractional revival in a graph and in its double cover, and obtain a complete characterization of pretty good plus state transfer in cycles and their complements. This leads to characterizations of pretty good vertex state transfer in weighted paths with potential.
Abstract. Pure states correspond to one-dimensional subspaces of [Formula: see text] represented by unit vectors. In this paper, we develop the theory of perfect state transfer (PST) between real pure states with emphasis on the adjacency and Laplacian matrices as Hamiltonians of a graph representing a quantum spin network. We characterize PST between real pure states based on the spectral information of a graph and prove three fundamental results: (i) every periodic real pure state [Formula: see text] admits PST with another real pure state [Formula: see text], (ii) every connected graph admits PST between real pure states, and (iii) for any pair of real pure states [Formula: see text] and [Formula: see text] and for any time [Formula: see text], there exists a real symmetric matrix [Formula: see text] such that [Formula: see text] and [Formula: see text] admit PST relative to [Formula: see text] at time [Formula: see text]. We also determine all real pure states that admit PST in complete graphs, complete bipartite graphs, paths, and cycles. This leads to a complete characterization of pair and plus state transfer in paths and complete bipartite graphs. We give constructions of graphs that admit PST between real pure states. Finally, using results on the spread of graphs, we prove that amongst all [Formula: see text]-vertex simple unweighted graphs, the least minimum PST time between real pure states is attained by any join graph for the Laplacian case, while it is attained by the join of an empty graph and a complete graph of appropriate sizes for the adjacency case. Reproducibility of computational results. This paper has been awarded the “SIAM Reproducibility Badge: Code and data available” as a recognition that the authors have followed reproducibility principles valued by SIMAX and the scientific computing community. Code and data that allow readers to reproduce the results in this paper are available at none . [Formula: see text]
Let G be a graph and let t be a positive real number. Then the evolution of the continuous quantum walk defined on G is described by the transition matrix U(t)=exp(itH).The matrix H is called Hamiltonian. So far the most studied quantum walks are the ones whose Hamiltonians are the adjacency matrices of the underlying graphs and initial states are vertex states e_a, with e_a being the characteristic vector of vertex a. \n \nThis thesis focuses on Laplacian edge state transfer, that is, the quantum walks whose initial states are edge states e_a-e_b and Hamiltonians are the Laplacians of the underlying graphs. So far the research about perfect state transfer only involves vertex states and Laplacian edge state transfer has not been studied before. We extend the known results of perfect vertex state transfer and periodicity of vertex states to Laplacian edge state transfer. \n \nWe prove two useful closure properties for perfect Laplacian edge state transfer. One is that complementation preserves perfect edge state transfer. The other is that if G has perfect Laplacian edge state transfer at time τ and H has perfect Laplacian vertex state transfer also at time τ, then with some mild assumption on the pairs of vertex states and edge states that have perfect state transfer, the Cartesian product G □ H also admits perfect edge state transfer. Those two properties provide us new ways to construct graphs with perfect Laplacian edge state transfer. We also observe one phenomenon that happens in Laplacian edge state transfer which never happens in vertex state transfer: if there is perfect state transfer from e_a-e_b to e_α-e_β and also from e_b-e_c to e_β-e_γ at the same time t in G, then G admits perfect state transfer from e_a-e_c to e_α-e_γ at time t. \n \nWe give characterizations of perfect Laplacian edge state transfer in cycles, paths and complete bipartite graphs K_{2,4n}. We study perfect state transfer and periodicity on edge states with special spectral features. We also consider the case when the unsigned Laplacian is Hamiltonian and initial states are plus states of the form e_a+e_b. In this case, we characterize perfect state transfer in paths, cycles and bipartite graphs. \nWe close this thesis by a list of open questions.
Abstract Copying quantum information is forbidden by the no-cloning theorem, yet approximate copies with the highest fidelity allowed by quantum mechanics are a basic resource for quantum networks and for assessing the security of quantum key distribution. Such cloners are usually gate sequences, but a spin network with fixed couplings can perform the transformation autonomously: the unknown qubit and blank qubits sit on the vertices of a graph and the free evolution does the rest. Until now, the only spin graph known to reach the optimal phase-covariant fidelity for every number of clones MMM was the star with a tuned anisotropy. Which other graphs can clone optimally, and why, has remained open. Here we show that the complete bipartite graph K2,M−1K_{2,M-1}K2,M−1​---the unknown qubit and one target on one side, the remaining targets on the other---reaches the optimal 1→M1\to M1→M phase-covariant fidelity for every M≥3M\ge 3M≥3, with all couplings given in closed form. For odd MMM a staggered Ising anisotropy suffices, with the parameters fixed by two integers; for even MMM an additional Ising coupling among the middle targets is required, with its value an explicit algebraic number. Both families reduce, in the permutation-symmetric sectors, to two four-level problems: a perfect-state-transfer ladder on a four-cycle and a freeze block whose characteristic polynomial we obtain analytically. We verify the formulas with no free parameter up to M=10M=10M=10 and classify exactness for all four-vertex graphs with a least-squares test of the exact revival and transfer equations. The results connect the fractional-revival engineering of spin chains to optimal cloning and identify the hidden involution behind both. Beyond cloning, optimal quantum machines can thus be read off from the spectrum of small symmetric blocks, suggesting autonomous implementations of other covariant transformations on spin and Rydberg arrays.
Perfect (s,r)(s,r)(s,r)-state transfer
Much work has been done in the last two decades on the topic of quantum state transfer in a quantum spin network. One can model such a system of interacting qubits using an undirected graph, and studying vertex-to-vertex dynamics. This setup has recently been relaxed to allow for dynamics between linear combinations of two vertex states, i.e.\ from u=ea+seb\mathbf u = \mathbf e_a + s \mathbf e_bu=ea​+seb​ to μ=eα+reβ\mathbf μ=\mathbf e_α + r \mathbf e_βμ=eα​+reβ​, where r=sr=sr=s is either −1-1−1 (which corresponds to pair state transfer) or +1+1+1 (which corresponds to plus state transfer), or more recently r=sr=sr=s is taken to be any real number (which corresponds to sss-pair state transfer). Here, we broaden the investigation of sss-pair state transfer to \textit{perfect (s,r)(s,r)(s,r)-state transfer}, which is perfect state transfer from u=ea+seb\mathbf u = \mathbf e_a + s \mathbf e_bu=ea​+seb​ to μ=eα+reβ\mathbf μ=\mathbf e_α + r \mathbf e_βμ=eα​+reβ​ (up to some dilation) where r,s∈Cr,s\in \mathbb Cr,s∈C. We identify infinite families of graphs with perfect (s,r)(s,r)(s,r)-state transfer and provide characterizations of cases when ∣r∣=∣s∣|r|= |s|∣r∣=∣s∣ and when ∣r∣≠∣s∣|r|\neq |s|∣r∣=∣s∣, showing situations when the degree of entanglement between vertex states is preserved, and when it is not preserved. The latter is particularly important as it represents perfect state transfer from an entangled pair of qubits to another one where the degree of entanglement need not be the same\mdash in fact, it can be set up so as to ``boost'' (increase) entanglement. We provide an algorithm that finds the vector with two nonzero entries that maximizes the fidelity of transfer for a fixed time ttt starting from a given sss-pair state u\mathbf uu. Finally, we provide a sensitivity analysis, with respect to readout time errors, of perfect (s,r)(s,r)(s,r)-state transfer.
We initiate the study of approximate quantum fractional revival in graphs, a generalization of pretty good quantum state transfer in graphs. We give a complete characterization of approximate fractional revival in a graph in terms of the eigenvalues and eigenvectors of the adjacency matrix of a graph. This characterization follows from a lemma due to Kronecker on Diophantine approximation, and is similar to the spectral characterization of pretty good state transfer in graphs. Using this, we give a complete characterizations of when approximate fractional revival can occur in paths and in cycles.