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:1801.09654 · Discrete Applied Mathematics

Quantum fractional revival on graphs

Ada Chan, Gabriel Coutinho, Christino Tamon, Luc Vinet, Hanmeng Zhan

Published Jan 21, 2019• 40 citations
arXivHTMLPDF
DOI
10.1016/j.dam.2018.12.017

Related papers

A graph with fractional revival

Pierre-Antoine Bernard, Ada Chan, Érika Loranger +2 more

arXiv:1710.02705•Physics Letters A•Dec 5, 2017•29 citations

Quantum spin chains with fractional revival

Vincent X. Genest, Luc Vinet, Alexei S. Zhedanov

arXiv:1507.05919•Annals of Physics•Jun 2, 2016•54 citations

Quantum graphs

Theoretical and mathematical physics•Sep 22, 2008•0 citations

Fractional revival on abelian Cayley graphs

Xiwang Cao, Gaojun Luo

Fractional revival, known as a quantum transport phenomenon, is essential for entanglement generation in quantum spin networks. The concept of fractional revival is a generalization of perfect state transfer and periodicity on graphs. In this paper, we propose a sufficient and necessary condition for abelian Cayley graphs having fractional revival between any two distinct vertices. With this characterization, two general constructions of abelian Cayley graphs having fractional revival is presented. Meanwhile, we establish several new families of abelian Cayley graphs admitting fractional revival.

arXiv:2208.05107•Aug 10, 2022•4 citations

Quantum graphs

Peter Kuchment

Waves in Random Media•Jan 1, 2004•12 citations

Laplacian Fractional Revival on Graphs

Ada Chan, Bobae Johnson, Mengzhen Liu +3 more

We develop the theory of fractional revival in the quantum walk on a graph using its Laplacian matrix as the Hamiltonian. We first give a spectral characterization of Laplacian fractional revival, which leads to a polynomial time algorithm to check this phenomenon and find the earliest time when it occurs. We then apply the characterization theorem to special families of graphs. In particular, we show that no tree admits Laplacian fractional revival except for the paths on two and three vertices, and the only graphs on a prime number of vertices that admit Laplacian fractional revival are double cones. Finally, we construct, through Cartesian products and joins, several infinite families of graphs that admit Laplacian fractional revival; some of these graphs exhibit polygamous fractional revival.

arXiv:2010.10413•The Electronic Journal of Combinatorics•Jul 16, 2021•9 citations
Fractional revival, known as a quantum transport phenomenon, is essential for entanglement generation in quantum spin networks. The concept of fractional revival is a generalization of perfect state transfer and periodicity on graphs. In this paper, we propose a sufficient and necessary condition for abelian Cayley graphs having fractional revival between any two distinct vertices. With this characterization, two general constructions of abelian Cayley graphs having fractional revival is presented. Meanwhile, we establish several new families of abelian Cayley graphs admitting fractional revival.
We develop the theory of fractional revival in the quantum walk on a graph using its Laplacian matrix as the Hamiltonian. We first give a spectral characterization of Laplacian fractional revival, which leads to a polynomial time algorithm to check this phenomenon and find the earliest time when it occurs. We then apply the characterization theorem to special families of graphs. In particular, we show that no tree admits Laplacian fractional revival except for the paths on two and three vertices, and the only graphs on a prime number of vertices that admit Laplacian fractional revival are double cones. Finally, we construct, through Cartesian products and joins, several infinite families of graphs that admit Laplacian fractional revival; some of these graphs exhibit polygamous fractional revival.