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

Springer eBooks

Fractional Revivals

C. Leichtle, W. P. Schleich, Ilya Sh. Averbukh

Published Jan 1, 1996• 0 citations
Publisher
DOI
10.1007/978-1-4757-9742-8_153

Related papers

Revivals, Fractional Revivals and Tomograms

S. Lakshmibala, V. Balakrishnan

SpringerBriefs in physics•Jan 1, 2022•0 citations

Fractional revival and association schemes

Ada Chan, Gabriel Coutinho, Christino Tamon +2 more

arXiv:1907.04729•Discrete Mathematics•Jul 1, 2020•16 citations

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

Fractional revivals in the Jaynes-Cummings model

Ilya Sh. Averbukh

Quantum Electronics and Laser Science Conference•May 10, 1992•0 citations

Generalized fractional revival on graphs

Whitney Drazen

A continuous-time quantum walk is a process on a network of quantum particles that is governed by the transition matrix $U(t) = e^{-itA}$, where is $A$ is the adjacency matrix of the graph representing the network. Certain instantaneous phenomena occuring in quantum walks can be utilized in quantum computing algorithms. The two-vertex phenomenon fractional revival occurs between vertices $u$ and $v$ at time $t$ if the columns of $U(t)$ corresponding to $u$ and $v$ are only supported on the rows indexed by those same two vertices. This means that given any initial state supported only on vertices $u$ and $v$, the state of the system at time $t$ will again be supported only on those same two vertices. Fractional revival can be used to generate entanglement between two quantum particles. We will discuss $K$-fractional revival, the generalization of fractional revival to $K$, a larger subset of the vertices in our graph. We will also explore the related concept approximate $K$-fractional revival, which denotes the existence of a sequence of times for which $U(t)$ comes arbitrarily close to achieving $K$-fractional revival. Next, we will examine some spectral characterizations of these phenomena, which will allow us to determine if a given graph exhibits either $K$-fractional revival or approximate $K$-fractional revival. Lastly, we will detail families of examples of approximate $K$-fractional revival on path graphs.--Author's abstract

•Jan 1, 2021•0 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
A continuous-time quantum walk is a process on a network of quantum particles that is governed by the transition matrix U(t)=e−itAU(t) = e^{-itA}U(t)=e−itA, where is AAA is the adjacency matrix of the graph representing the network. Certain instantaneous phenomena occuring in quantum walks can be utilized in quantum computing algorithms. The two-vertex phenomenon fractional revival occurs between vertices uuu and vvv at time ttt if the columns of U(t)U(t)U(t) corresponding to uuu and vvv are only supported on the rows indexed by those same two vertices. This means that given any initial state supported only on vertices uuu and vvv, the state of the system at time ttt will again be supported only on those same two vertices. Fractional revival can be used to generate entanglement between two quantum particles. We will discuss KKK-fractional revival, the generalization of fractional revival to KKK, a larger subset of the vertices in our graph. We will also explore the related concept approximate KKK-fractional revival, which denotes the existence of a sequence of times for which U(t)U(t)U(t) comes arbitrarily close to achieving KKK-fractional revival. Next, we will examine some spectral characterizations of these phenomena, which will allow us to determine if a given graph exhibits either KKK-fractional revival or approximate KKK-fractional revival. Lastly, we will detail families of examples of approximate KKK-fractional revival on path graphs.--Author's abstract
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.