⚛️ quantum physics

Fractional revival in complementary prisms of graphs

This paper establishes a general framework for analyzing fractional revival in real symmetric matrices with block structures and applies it to demonstrate that complementary prisms of graphs exhibit fractional revival for specific states under adjacency, Laplacian, and signless Laplacian matrices, while also characterizing perfect state transfer phenomena in the complementary prisms of complete and complete bipartite graphs.

Original authors: Sarojini Mohapatra, Hiranmoy Pal

Published 2026-09-14

📖 4 min read🧠 Deep dive

CC BY 4.0

Original authors: Sarojini Mohapatra, Hiranmoy Pal

Original paper licensed under CC BY 4.0 (http://creativecommons.org/licenses/by/4.0/). ✨ This is an AI-generated explanation of the paper below. It is not written or endorsed by the authors. For technical accuracy, refer to the original paper. Read full disclaimer

In the microscopic world where information is stored and processed, the rules of physics shift from the predictable to the probabilistic. Here, the fundamental units of data are not static bits but quantum states, which can exist in multiple configurations simultaneously. A central challenge in this field is moving these states from one location to another without losing their delicate information or the entanglement that links them. Scientists model these networks of quantum particles as graphs, where dots represent the particles and lines represent the connections between them. To understand how information travels, they use a mathematical tool called a continuous-time quantum walk. Imagine a particle that does not hop from one point to another like a person stepping on stones, but instead flows through the entire network at once, exploring every possible path simultaneously. The goal is to find specific network shapes where this flow can be perfectly controlled, allowing a quantum state to arrive at a destination with absolute certainty.

For years, researchers have been hunting for a phenomenon called perfect state transfer, where a quantum state moves from one point to another with 100% efficiency. However, this ideal scenario is incredibly rare in simple, unweighted networks. When perfect transfer cannot be achieved, scientists look for a slightly more flexible outcome known as fractional revival. In this case, the quantum state does not travel entirely to a new location; instead, it splits. Part of the state remains at the starting point while another part appears at the destination. This partial transfer is still highly valuable, as it can generate the entanglement necessary for quantum computing. The question remains: which network structures allow for this controlled splitting, and can we design new shapes that guarantee it?

A team of researchers at the National Institute of Technology Rourkela in India has developed a new framework to answer these questions, focusing on a specific type of network construction called a complementary prism. To visualize this structure, imagine taking a network of connections and creating an exact copy of it. Then, for every single point in the original network, draw a direct line connecting it to its twin in the copy. The result is a two-layered structure where the original and the copy are tightly interwoven. The researchers investigated how quantum walks behave on these double-layered networks, specifically looking at how states move between the original layer and the copy. They discovered a powerful rule: if a specific starting point in the original network has a special symmetry—meaning it is balanced in a way that its total influence canc out—the complementary prism will reliably exhibit fractional revival. The state will split, with one part staying put and the other appearing at the corresponding location in the copy layer.

The study goes further by identifying exactly when this split becomes a perfect transfer. The researchers found that for the state to move completely from the original layer to the copy, the mathematical properties of the starting point in the original network must match the properties of its twin in the copy. When this condition is met, the quantum state travels entirely across the gap, achieving perfect state transfer. This finding allowed the team to map out exactly which famous network shapes, such as complete networks where every point connects to every other, or bipartite networks divided into two distinct groups, would support this perfect movement. They proved that for complete networks, perfect transfer between certain pairs of points is impossible, effectively ruling out a whole class of potential designs. However, for complete bipartite networks, they identified a precise condition where perfect transfer occurs, creating an infinite family of new network shapes that can perform this feat.

The researchers also explored "plus states," which are combinations of two points acting together as a single unit. They found that in the complementary prisms of certain bipartite networks, these combined states can also move perfectly from one layer to the other, but only if the network size follows a specific numerical pattern. This work provides a clear blueprint for engineers and physicists. By constructing networks in the shape of these complementary prisms and ensuring the starting points meet the identified symmetry conditions, it is possible to design quantum systems where information can be reliably split or fully transferred. The paper does not just suggest these outcomes; it provides mathematical proofs that these behaviors are guaranteed for the described structures, offering a solid foundation for building more robust quantum communication channels.

Technical Summary: Fractional Revival in Complementary Prisms of Graphs

Problem Statement
The paper addresses the problem of quantum state transfer in quantum spin networks, modeled by continuous-time quantum walks on graphs. While Perfect State Transfer (PST) between vertex states has been extensively studied, it is a rare phenomenon in finite unweighted graphs. Consequently, research has expanded to include PST between more general states (pair and plus states) and the broader phenomenon of fractional revival, where a state evolves into a superposition of itself and another state. The specific focus of this work is the complementary prism of a graph, denoted $GG$ , which is constructed from the disjoint union of a graph $G$ and its complement $\overline{G}$ by adding edges between each vertex $a \in V(G)$ and its copy $a' \in V(\overline{G})$ . The authors aim to characterize the existence of fractional revival and PST in $GG$ with respect to the adjacency ( $A$ ), Laplacian ( $L$ ), and signless Laplacian ( $Q$ ) matrices.

Methodology
The authors develop a general framework for analyzing fractional revival in real symmetric matrices with a specific block structure.

Block Matrix Framework: They establish a connection between a large block matrix $M$ and a smaller quotient matrix $H$ . By identifying invariant subspaces spanned by vectors $u_j$ that satisfy specific eigenvector conditions across the blocks, they prove that fractional revival in the graph associated with $H$ implies fractional revival in the graph associated with $M$ (Theorem 5).
Extension to Complementary Prisms: They apply this framework to the complementary prism $GG$ . The matrix representing $GG$ (for $M \in \{A, L, Q\}$ ) is shown to have a block form where the diagonal blocks are $M(G) + \delta I$ and the off-diagonal blocks are scalar multiples of the identity matrix ( $\zeta I$ ).
Spectral Analysis: The authors utilize known spectral results for the complementary prism (from [5]) to determine the eigenvalues and eigenvectors of $GG$ based on the spectra of $G$ . They specifically analyze cases where $G$ is regular or complete bipartite to derive conditions for periodicity and strong cospectrality, which are necessary conditions for PST.
State Characterization: The study focuses on specific initial states, including:
- States $[u, 0]^T$ where $u$ is a fixed state in $G$ orthogonal to the all-one vector.
- Pair states of the form $\frac{1}{\sqrt{2}}(e_a - e_b)$ .
- Plus states of the form $\frac{1}{\sqrt{2}}(e_a + e_b)$ .

Key Contributions and Results

General Framework for Fractional Revival: The paper provides a constructive method (Theorem 5 and Theorem 6) to determine fractional revival in block-structured matrices. This allows the reduction of complex graph problems to simpler quotient graphs.
Fractional Revival in Complementary Prisms:
- Theorem 7: For any fixed state $u$ in $G$ such that $u \perp \mathbf{1}$ , the complementary prism $GG$ exhibits fractional revival from $[u, 0]^T$ to $[0, u]^T$ with respect to $A$ , $L$ , and $Q$ .
- Theorem 8: PST between $[u, 0]^T$ and $[0, u]^T$ occurs if and only if the eigenvalues of $u$ in $G$ and $\overline{G}$ are identical ( $\lambda = \mu$ ).
- Theorem 9: The complementary prism of any graph $G$ exhibits PST between $\frac{1}{\sqrt{n}}[\mathbf{1}, 0]^T$ and $\frac{1}{\sqrt{n}}[0, \mathbf{1}]^T$ with respect to the Laplacian matrix at odd multiples of $\pi/2$ .
- Corollary 4: If $a$ and $b$ are twin vertices in $G$ , $GG$ exhibits fractional revival from $\frac{1}{\sqrt{2}}(e_a - e_b)$ to $\frac{1}{\sqrt{2}}(e_{a'} - e_{b'})$ .
Characterization in Complete Graphs ( $K_n$ ):
- Adjacency: No perfect pair state transfer exists in $K_n K_n$ for $n \ge 2$ (Theorem 10).
- Laplacian: Perfect pair state transfer exists if and only if $n=2$ (Theorem 11).
- Signless Laplacian: Perfect pair state transfer exists if and only if $n=2$ (Theorem 12).
Characterization in Complete Bipartite Graphs ( $K_{m,n}$ ):
- Pair PST: PST between $\frac{1}{\sqrt{2}}(e_a - e_b)$ and $\frac{1}{\sqrt{2}}(e_{a'} - e_{b'})$ (where $a,b$ are in the same partite set) occurs with respect to the Laplacian matrix if and only if $m = n$ , and with respect to the signless Laplacian matrix if and only if $m - n = 2$ (Theorem 13).
- Laplacian Pair PST: Complete characterization shows existence if and only if $m=n$ (Theorem 14).
- Plus PST: The paper establishes an infinite family of graphs exhibiting perfect plus state transfer. Specifically, for $K_{n,n}K_{n,n}$ , Laplacian PST between $\frac{1}{\sqrt{2}}(e_a + e_b)$ and $\frac{1}{\sqrt{2}}(e_{a'} + e_{b'})$ (where $a,b$ are in different partite sets) occurs if and only if $n$ is a multiple of 4 (Theorem 15).
- Non-existence: No perfect plus state transfer exists in $K_{n,n}K_{n,n}$ with respect to the adjacency matrix (Theorem 16) or the signless Laplacian matrix for $n \ge 2$ (Theorem 17).

Significance and Claims
The paper claims to provide a general framework for studying fractional revival in matrices with block structures, which is then successfully applied to the complementary prism. The primary significance lies in:

Extending PST beyond vertex states: The work demonstrates that while vertex PST is rare, the complementary prism structure supports PST and fractional revival for a wide class of pair and plus states.
Infinite Families: The characterization of PST in $K_{n,n}K_{n,n}$ yields an infinite family of graphs exhibiting perfect plus state transfer (specifically when $n$ is a multiple of 4), addressing the scarcity of such graphs in the literature.
Unified Treatment: The results unify the analysis of fractional revival across three major graph matrices ( $A, L, Q$ ) for the complementary prism, identifying precise conditions (such as twin vertices or specific regularity) under which these phenomena occur.

The authors do not propose experimental implementations or future applications beyond the theoretical characterization of these graph classes. The work is presented as a theoretical contribution to the spectral theory of graphs and quantum information transport.

Technical Summary: Fractional Revival in Complementary Prisms of Graphs

More like this