Fractional Revival and Association Schemes

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

arxiv: 1907.04729 · v1 · pith:HLPLKGFUnew · submitted 2019-07-10 · 🧮 math.CO · quant-ph

Fractional Revival and Association Schemes

Ada Chan , Gabriel Coutinho , Christino Tamon , Luc Vinet , Hanmeng Zhan This is my paper

Pith reviewed 2026-05-24 23:43 UTC · model grok-4.3

classification 🧮 math.CO quant-ph

keywords fractional revivalassociation schemesHamming schemequantum walksentanglement generationBose-Mesner algebraorthogonal polynomials

0 comments

The pith

Balanced fractional revival is characterized in Hamming scheme graphs using the Bose-Mesner algebra of association schemes.

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The paper examines fractional revival in continuous-time quantum walks on graphs whose adjacency matrices are part of the Bose-Mesner algebra of association schemes. It provides a characterization of balanced fractional revival, which enables maximal entanglement, specifically for graphs in the Hamming scheme. The analysis draws on connections between algebraic combinatorics and orthogonal polynomials. This matters because it offers algebraic tools to identify graphs where quantum walks can generate entanglement between specific vertices.

Core claim

In graphs belonging to association schemes, fractional revival between vertices occurs when the walk's unitary evolution maps one vertex state to a superposition of two, and for the Hamming scheme, balanced fractional revival is characterized by specific conditions on the scheme parameters that ensure the superposition is balanced.

What carries the argument

The Bose-Mesner algebra of an association scheme, which allows the adjacency matrix to be expressed in a basis that connects to orthogonal polynomials for analyzing the quantum walk evolution.

If this is right

Provides explicit criteria for when balanced fractional revival occurs in Hamming graphs.
Links combinatorial parameters to quantum entanglement generation in spin networks.
Allows systematic study of fractional revival in other association schemes using similar algebraic methods.

Where Pith is reading between the lines

These are editorial extensions of the paper, not claims the author makes directly.

This characterization could be used to construct quantum networks with desired entanglement properties from known combinatorial objects.
Similar techniques might apply to quantum walks on graphs from other schemes like Johnson or Grassmann schemes.
Testing the conditions on small Hamming graphs could verify the algebraic predictions computationally.

Load-bearing premise

The adjacency matrices of the graphs under study belong to the Bose-Mesner algebra of an association scheme.

What would settle it

Observe a specific graph from the Hamming scheme, such as the hypercube, and check if balanced fractional revival occurs exactly at the times or parameters predicted by the characterization; a mismatch would falsify it.

read the original abstract

Fractional revival occurs between two vertices in a graph if a continuous-time quantum walk unitarily maps the characteristic vector of one vertex to a superposition of the characteristic vectors of the two vertices. This phenomenon is relevant in quantum information in particular for entanglement generation in spin networks. We study fractional revival in graphs whose adjacency matrices belong to the Bose-Mesner algebra of association schemes. A specific focus is a characterization of balanced fractional revival (which corresponds to maximal entanglement) in graphs that belong to the Hamming scheme. Our proofs exploit the intimate connections between algebraic combinatorics and orthogonal polynomials.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit. Tearing a paper down is the easy half of reading it; the pith above is the substance, this is the friction.

Desk Editor's Note private letter to a colleague

The paper characterizes balanced fractional revival in the Hamming scheme by restricting to graphs whose adjacency matrices sit in a Bose-Mesner algebra.

read the letter

The paper's main contribution is a characterization of balanced fractional revival in the Hamming scheme using the Bose-Mesner algebra of association schemes. This gives concrete conditions for when a continuous-time quantum walk produces maximal entanglement between two vertices. They focus on graphs whose adjacency matrices lie in that algebra, which lets them bring in orthogonal polynomials and eigenvalue techniques that are standard for these objects. The Hamming scheme gets special attention because it models things like hypercubes and other symmetric structures relevant to spin networks. What the paper does well is keep the scope tight. By staying inside association schemes they avoid loose claims and get a clean algebraic result. The link to entanglement generation is stated clearly without overhyping. The soft spots are mostly around verification. The abstract lays out the plan but the actual derivations aren't here, so I can't check if the orthogonal polynomial connections deliver exactly as claimed. That said, the method is the usual one in the literature, so it probably holds up. No sign of circular reasoning or invented entities. This work is for specialists in quantum walks on graphs or algebraic combinatorics applied to quantum information. Someone already familiar with association schemes and Bose-Mesner algebras will get the most out of it, as it refines existing techniques rather than introducing new machinery. It deserves a serious referee. The result is specific and the framework is established, so a referee can focus on whether the characterization is complete and correct. I would recommend sending it to peer review.

Referee Report

0 major / 2 minor

Summary. The manuscript studies fractional revival in continuous-time quantum walks on graphs whose adjacency matrices lie in the Bose-Mesner algebra of an association scheme. It derives a characterization of balanced fractional revival (corresponding to maximal entanglement) specifically for graphs belonging to the Hamming scheme, using the connections between the algebraic structure of association schemes and orthogonal polynomials.

Significance. If the characterization holds, the work provides a concrete algebraic criterion for maximal entanglement generation in a well-studied family of graphs, directly relevant to quantum information applications in spin networks. The deliberate restriction to the Bose-Mesner algebra enables the use of standard eigenvalue and orthogonal-polynomial machinery, yielding results that are parameter-free within the scheme and build on established combinatorial tools rather than ad-hoc assumptions.

minor comments (2)

[Abstract] The abstract states the focus on the Hamming scheme but does not preview the precise form of the characterization (e.g., conditions on the eigenvalues or intersection numbers); adding one sentence would improve readability for readers outside algebraic combinatorics.
[Introduction] Notation for the association scheme parameters (e.g., the intersection numbers p_{ij}^k) is introduced without an explicit reference to the standard definition in the first section where it appears; a brief reminder or citation to the Bose-Mesner algebra axioms would aid clarity.

Simulated Author's Rebuttal

0 responses · 0 unresolved

We thank the referee for their positive review of our manuscript and their recommendation to accept. No major comments were raised in the report.

Circularity Check

0 steps flagged

No significant circularity; derivation is self-contained algebraic analysis

full rationale

The paper restricts to graphs whose adjacency matrices lie in the Bose-Mesner algebra of an association scheme and derives a characterization of balanced fractional revival inside the Hamming scheme by applying standard eigenvalue decompositions and orthogonal polynomial connections from algebraic combinatorics. These are external, independently established tools (not fitted parameters or self-defined quantities within the paper). No step reduces a claimed result to its own inputs by construction, no load-bearing self-citation chain appears, and the scoping choice is explicit rather than smuggled. The central claim therefore retains independent mathematical content.

Axiom & Free-Parameter Ledger

0 free parameters · 0 axioms · 0 invented entities

Based on abstract only; no explicit free parameters, new axioms, or invented entities are described. The work relies on standard background from association schemes and orthogonal polynomials.

pith-pipeline@v0.9.0 · 5619 in / 991 out tokens · 17057 ms · 2026-05-24T23:43:17.989760+00:00 · methodology

discussion (0)

Reference graph

Works this paper leans on

21 extracted references · 21 canonical work pages · 2 internal anchors

[1]

Bernard , A

P.-A. Bernard , A. Chan , ´E. Loranger , C. Tamon , L. Vinet . A graph with fractional revival. Physics Letters A , 382(5):259-264, 2018

work page 2018
[2]

S. Bose . Quantum Communication through an Unmodulated Spin Chain. Physical Review Letters, 91(20):207901, 2003

work page 2003
[3]

Brouwer , A.M

A.E. Brouwer , A.M. Cohen , A. Neumaier . Distance-Regular Graphs. Springer-Verlag, 1989

work page 1989
[4]

Brouwer and W.H

A.E. Brouwer and W.H. Haemers. Spectra of graphs. Universitext. Springer, New York, 2012

work page 2012
[5]

Brown , C

J. Brown , C. Godsil , D. Mallory , A. Raz , C. Tamon. Perfect State Transfer on Signed Graphs. Quantum Information and Computation 13(5&6):511-530, 2013

work page 2013
[6]

A. Chan . Complex Hadamard Matrices, Instantaneous Uniform Mixing and Cubes. arXiv:1305.5811 [math.co]

work page internal anchor Pith review Pith/arXiv arXiv
[7]

Chan , G

A. Chan , G. Coutinho , C. Tamon , L. Vinet , H. Zhan . Quantum Fractional Revival on Graphs. Discrete Applied Mathematics , doi:10.1016/j.dam.2018.12.017

work page doi:10.1016/j.dam.2018.12.017 2018
[8]

T.X. Cai , A. Granville . On the residues of binomial coeﬃcients and their products m odulo prime powers. Acta Mathematica Sinica (English Series) 18(2):277-288, 2002

work page 2002
[9]

Coutinho , C

G. Coutinho , C. Godsil , K. Guo , F. V anhove. Perfect state transfer on distance regular graphs and association schemes. Linear Algebra and Its Applications , 478:108-130, 2015

work page 2015
[10]

Chihara , D

L. Chihara , D. Stanton . Zeros of generalized Krawtchouk polynomials. Journal of Ap- proximation Theory 60(1):43-57, 1990

work page 1990
[11]

Christandl , L

M. Christandl , L. Vinet , A. Zhedanov . Analytic next-to-nearest-neighbor XX models with perfect state transfer and fractional revival. Physical Review A , 96(3), 032335, 2017

work page 2017
[12]

L.E. Dickson . History of the Theory of Numbers, Volume 1: Divisibility and P rimality. Chelsea, 1952

work page 1952
[13]

F arhi, S

E. F arhi, S. Gutmann . Quantum computation and decision trees. Physical Review A , 58:915, 1998. 22

work page 1998
[14]

Genest , L

V. Genest , L. Vinet , A. Zhedanov . Quantum spin chains with fractional revival. Annals of Physics 371:348-367, 2016

work page 2016
[15]

C. Godsil . State Transfer on Graphs. Discrete Mathematics , 312, 123-147, 2012

work page 2012
[16]

Godsil , G

C. Godsil , G. Royle . Algebraic Graph Theory . Springer, 2001

work page 2001
[17]

Strongly Cospectral Vertices

C. Godsil , J. Smith . Strongly Cospectral Vertices. arXiv:1709.07975 [math.c o]

work page internal anchor Pith review Pith/arXiv arXiv
[18]

MacWilliams, N.J.A

F.J. MacWilliams, N.J.A. Sloane . The Theory of Error-Correcting Codes. North-Holland, 1977

work page 1977
[19]

Nielsen , I

M. Nielsen , I. Chuang . Quantum Computation and Quantum Information . Cambridge University Press, 2000

work page 2000
[20]

Pemberton-Ross, A

P.J. Pemberton-Ross, A. Kay. Perfect Quantum Routing in Regular Spin Networks. Phys- ical Review Letters 106, 020503, 2011

work page 2011
[21]

D. Stanton. Orthogonal polynomials and combinatorics. In Special Functions 2000: Current perspective and future directions , J. Boustoz, M.E.H. Ismail, S. Suslov (eds.), NATO science series, Vol. 30, 389-409, Springer, 2001. 23

work page 2000

[1] [1]

Bernard , A

P.-A. Bernard , A. Chan , ´E. Loranger , C. Tamon , L. Vinet . A graph with fractional revival. Physics Letters A , 382(5):259-264, 2018

work page 2018

[2] [2]

S. Bose . Quantum Communication through an Unmodulated Spin Chain. Physical Review Letters, 91(20):207901, 2003

work page 2003

[3] [3]

Brouwer , A.M

A.E. Brouwer , A.M. Cohen , A. Neumaier . Distance-Regular Graphs. Springer-Verlag, 1989

work page 1989

[4] [4]

Brouwer and W.H

A.E. Brouwer and W.H. Haemers. Spectra of graphs. Universitext. Springer, New York, 2012

work page 2012

[5] [5]

Brown , C

J. Brown , C. Godsil , D. Mallory , A. Raz , C. Tamon. Perfect State Transfer on Signed Graphs. Quantum Information and Computation 13(5&6):511-530, 2013

work page 2013

[6] [6]

A. Chan . Complex Hadamard Matrices, Instantaneous Uniform Mixing and Cubes. arXiv:1305.5811 [math.co]

work page internal anchor Pith review Pith/arXiv arXiv

[7] [7]

Chan , G

A. Chan , G. Coutinho , C. Tamon , L. Vinet , H. Zhan . Quantum Fractional Revival on Graphs. Discrete Applied Mathematics , doi:10.1016/j.dam.2018.12.017

work page doi:10.1016/j.dam.2018.12.017 2018

[8] [8]

T.X. Cai , A. Granville . On the residues of binomial coeﬃcients and their products m odulo prime powers. Acta Mathematica Sinica (English Series) 18(2):277-288, 2002

work page 2002

[9] [9]

Coutinho , C

G. Coutinho , C. Godsil , K. Guo , F. V anhove. Perfect state transfer on distance regular graphs and association schemes. Linear Algebra and Its Applications , 478:108-130, 2015

work page 2015

[10] [10]

Chihara , D

L. Chihara , D. Stanton . Zeros of generalized Krawtchouk polynomials. Journal of Ap- proximation Theory 60(1):43-57, 1990

work page 1990

[11] [11]

Christandl , L

M. Christandl , L. Vinet , A. Zhedanov . Analytic next-to-nearest-neighbor XX models with perfect state transfer and fractional revival. Physical Review A , 96(3), 032335, 2017

work page 2017

[12] [12]

L.E. Dickson . History of the Theory of Numbers, Volume 1: Divisibility and P rimality. Chelsea, 1952

work page 1952

[13] [13]

F arhi, S

E. F arhi, S. Gutmann . Quantum computation and decision trees. Physical Review A , 58:915, 1998. 22

work page 1998

[14] [14]

Genest , L

V. Genest , L. Vinet , A. Zhedanov . Quantum spin chains with fractional revival. Annals of Physics 371:348-367, 2016

work page 2016

[15] [15]

C. Godsil . State Transfer on Graphs. Discrete Mathematics , 312, 123-147, 2012

work page 2012

[16] [16]

Godsil , G

C. Godsil , G. Royle . Algebraic Graph Theory . Springer, 2001

work page 2001

[17] [17]

Strongly Cospectral Vertices

C. Godsil , J. Smith . Strongly Cospectral Vertices. arXiv:1709.07975 [math.c o]

work page internal anchor Pith review Pith/arXiv arXiv

[18] [18]

MacWilliams, N.J.A

F.J. MacWilliams, N.J.A. Sloane . The Theory of Error-Correcting Codes. North-Holland, 1977

work page 1977

[19] [19]

Nielsen , I

M. Nielsen , I. Chuang . Quantum Computation and Quantum Information . Cambridge University Press, 2000

work page 2000

[20] [20]

Pemberton-Ross, A

P.J. Pemberton-Ross, A. Kay. Perfect Quantum Routing in Regular Spin Networks. Phys- ical Review Letters 106, 020503, 2011

work page 2011

[21] [21]

D. Stanton. Orthogonal polynomials and combinatorics. In Special Functions 2000: Current perspective and future directions , J. Boustoz, M.E.H. Ismail, S. Suslov (eds.), NATO science series, Vol. 30, 389-409, Springer, 2001. 23

work page 2000