State Transfer on Unitary Cayley Graphs and Quadratic Unitary Cayley Graphs

Akash Kalita; Bikash Bhattacharjya

REVIEW 3 major objections 4 minor 28 references

State Transfer on Unitary Cayley Graphs and Quadratic Unitary Cayley Graphs

T0 review · 3 major / 4 minor · reviewed 2026-08-15 · deepseek-v4-flash

Challenge this review Re-run · record.json Download PDF Read on arXiv ↗ Review JSON

Pith's one-line read The paper fully classifies fractional revival and pretty good fractional revival on unitary Cayley graphs and on quadratic unitary Cayley graphs, and also classifies periodicity, perfect state transfer, and pretty good state transfer on…

desk verdict A clean, correct-in-outline classification of state transfer on two circulant families; the main caveat is how much weight rests on an unproved prior theorem and on omitted 'similar' proofs. read the letter →

arxiv 2508.18068 v1 pith:3A4A6TXQ submitted 2025-08-25 math.CO

Akash Kalita , Bikash Bhattacharjya This is my paper · ORCID

classification math.CO MSC 11A0715A1605C5081P45

keywords unitaryCayleygraphquadraticperiodicityperfectstatetransferprettygoodfractionalrevivalcirculant

verification ladder T0 review T1 audit T2 compute T3 formal

The pith

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

The reading

The paper asks exactly which graphs in two families of circulant graphs — unitary Cayley graphs $X_n$ and quadratic unitary Cayley graphs $G_n$ — support fractional revival and its approximation, pretty good fractional revival, during a continuous-time quantum walk. For $X_n$ it proves a dichotomy: fractional revival occurs precisely when $n=2$ or $n=2p$ for a prime $p$, and pretty good fractional revival occurs for the same set, so the two notions coincide throughout the family. For $G_n$ they diverge: pretty good fractional revival occurs exactly for $n \in \{2,8,2p\}$ with $p$ prime, while fractional revival occurs exactly for $n \in \{2,4,2p\}$ with $p$ an odd prime congruent to $3 \pmod{4}$. The paper also classifies periodicity ($n \in \{2,4,p^s,2p^s\}$ with $p \equiv 3 \pmod{4}$), perfect state transfer ($n=2,4$), and pretty good state transfer ($n=2,4,8$) on $G_n$. These exact lists settle, for two large families of qubit networks, which can transmit a state exactly, which only approximately, and which can entangle two vertices through fractional revival.

What carries the argument

The machinery has four parts. The spectral decomposition of a circulant graph $\mathrm{Cay}(\mathbb{Z}_n,S)$ expresses the transition matrix $H(t)=\exp(-itA)$ as a sum over Fourier eigenprojectors indexed by the eigenvalues $\lambda_r$. For $X_n$ these eigenvalues are given by $\lambda_r=\mu(c(r,n))\,\varphi(n)/\varphi(c(r,n))$ with $c(r,n)=n/\gcd(r,n)$; for $G_n$ they are products of quadratic Gaussian sums attached to the prime-power factors of $n$, obtained by identifying $\mathbb{Z}_n$ with a product of the $\mathbb{Z}_{p_j^{k_j}}$ through the Chinese remainder theorem. Two structural criteria carry the argument. Theorem 2.5 decides fractional revival from the rationality of ratios of eigenvalue differences. Theorem 2.6 decides pretty good fractional revival from the absence of an integer relation $\sum_{r=1}^{n-1}\ell_r(\lambda_r-\lambda_0)=0$ whose odd-index coefficients sum to $\pm1$. The classifications reduce to checking these two criteria case by case through the prime factorization of $n$.

What would settle it

For a predicted negative case, take $n=12$ on the unitary Cayley graph side. The eigenvalues $\lambda_1=0$, $\lambda_2=2$, $\lambda_8=-2$ satisfy the forbidden integer relation of Theorem 2.6 with $\sum_{r\text{ odd}}\ell_r=1$, so the theorem predicts that no sequence of times $t_k$ can make $H(t_k)e_0$ approach $\alpha e_0+\beta e_6$. A direct numerical search of the transition matrix over large times that finds such an approach would refute the classification; the same check can be repeated for $G_{16}$, which is predicted to have no pretty good fractional revival.

Watch

Extended reading notes

Core claim

The central discovery is a set of exact classifications. A unitary Cayley graph $X_n$ — the circulant graph on $\mathbb{Z}_n$ whose edges connect numbers with a unit difference — admits fractional revival exactly when $n=2$ or $n=2p$ for a prime $p$, and admits pretty good fractional revival for exactly the same values of $n$; the two phenomena therefore coincide for the whole family. The quadratic unitary Cayley graph $G_n$, whose edges connect numbers whose difference is a quadratic residue or the negative of one modulo $n$, splits the two notions: it admits pretty good fractional revival exactly for $n \in \{2,8,2p\}$ with $p$ prime, and fractional revival exactly for $n \in \{2,4,2p\}$ with $p$ an odd prime satisfying $p \equiv 3 \pmod{4}$. Along the way the paper proves that $G_n$ is periodic exactly for $n \in \{2,4,p^s,2p^s\}$ with $p \equiv 3 \pmod{4}$, that it has perfect state transfer only for $n=2,4$, and that it has pretty good state transfer only for $n=2,4,8$. In particular there are infinitely many $G_n$ that approximate revival but never achieve it, and infinitely many that achieve fractional revival without perfect state transfer.

Load-bearing premise

The whole classification stands on the borrowed criterion that a circulant graph has pretty good fractional revival exactly when no integer combination of its eigenvalue gaps has the forbidden parity sum; if that criterion is false, all the listed vertex counts would have to be rechecked.

Editorial extensions

If this is right

For unitary Cayley graphs, the paper fixes the exact list: $X_n$ has fractional revival, and equivalently pretty good fractional revival, only for $n=2$ or $n=2p$ with $p$ prime.
The quadratic family gives infinitely many concrete networks, $G_{2p}$ with $p \equiv 3 \pmod{4}$, where two vertices can be entangled by fractional revival even though no perfect state transfer occurs.
It also gives infinitely many networks, $G_{2p}$ with $p \equiv 1 \pmod{4}$, that achieve pretty good fractional revival but neither exact fractional revival nor pretty good state transfer; the approximability hierarchy is therefore strict and populated.
Periodicity, perfect state transfer, and pretty good state transfer on $G_n$ are pinned down for every $n$, so the five phenomena are now closed questions for both families.

Reading between the lines

Editorial extensions of the paper, not claims the author makes directly.

The pattern suggests a testable conjecture for $k$-th power unitary Cayley graphs: admissible $n$ will again be controlled by one odd prime factor and by whether $-1$ lies in the subgroup of $k$-th powers modulo that prime.
Since the pretty good fractional revival criterion is imported as a cited theorem rather than proved in this paper, an independent proof of that criterion would place the two PGFR classifications on a fully self-contained footing.
The contrast between the unitary family, where fractional revival and pretty good fractional revival coincide, and the quadratic family, where they diverge, indicates that quadratic-residue structure rather than integrality alone is what opens the gap between approximate and exact revival.

Share X Bluesky LinkedIn Reddit HN

Signed reviews

No signed human review yet.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, and a circularity audit.

Desk Editor's Note

read the letter

The short version: this is a standard classification paper done competently. It takes known state-transfer criteria and runs them on the unitary Cayley graphs X_n and the quadratic unitary Cayley graphs G_n. The results are new, the classifications look right, and I checked enough of the eigenvalue computations to believe the casework.

What's actually new: for X_n, they classify PGFR and FR — both happen exactly for n = 2 or n = 2p, so FR iff PGFR. For G_n, they classify periodicity (n = 2, 4, p^s, 2p^s with p ≡ 3 mod 4), PST (n = 2, 4), PGST (n = 2, 4, 8), PGFR (n = 2, 8, 2p), and FR (n = 2, 4, 2p with p ≡ 3 mod 4). The FR classifications are the most interesting, and the paper points out that there are infinite families where PGFR occurs but FR does not. That is a genuinely useful piece of landscape.

Soft spots, in proportion. The big one is Theorem 2.6, imported without proof from the authors' own preprint. It is the necessary-and-sufficient criterion for PGFR on circulant graphs, and every non-existence lemma in Sections 3 and 6 is an application of it. If that theorem were misstated or inapplicable, the classifications for both families would collapse. That is a real dependency, but it is not a circularity or a free parameter — the theorem is stated cleanly and the applications are direct. Still, a referee would be right to ask for a proof or a published reference before accepting the paper. The second issue is the number of 'proof similar, omitted' lemmas (3.7, 4.3, 4.5, 4.7, 4.9, 4.14, 6.12). In a classification paper this is acceptable when the similarity is obvious; here it is mostly obvious, but there are enough of them that an independent reader cannot fully verify the casework without redoing it. The stress-test note worried about sign ambiguities in the G_2p eigenvalue lists; I did not find a concrete error, but the character labeling is delicate and deserves a careful look.

Who this is for: algebraic graph theorists working on continuous-time quantum walks. It is a within-subfield advance, not a reorganization of anything, but it is solid. I would send it to peer review and expect it to be published after the authors either prove Theorem 2.6 or cite a published version, and after the omitted proofs are filled in. I would cite it if I were working on these families myself.

Referee Report

3 major / 4 minor

Summary. The paper studies continuous-time quantum walks on unitary Cayley graphs X_n and quadratic unitary Cayley graphs G_n. It claims complete classifications for five phenomena: pretty good fractional revival and fractional revival on X_n, and periodicity, perfect state transfer, pretty good state transfer, pretty good fractional revival, and fractional revival on G_n. The main results are that X_n admits PGFR if and only if n is 2 or twice a prime, that X_n admits FR in exactly the same cases, that G_n admits PGFR if and only if n is in {2, 8, 2p} with p prime, and that G_n admits FR if and only if n is in {2, 4, 2p} with p ≡ 3 mod 4. The proofs reduce the problem to explicit eigenvalue formulas for the two graph families and to an integer-relation criterion for PGFR on circulant graphs.

Significance. If the classifications are correct, the paper gives complete characterizations of several quantum-walk phenomena on two natural circulant families, and the result that FR and PGFR coincide for X_n is a clean and useful observation. The strategy of reducing PGFR to an integer-relation condition and FR to a rational-ratio condition is appropriate, and the spectral inputs from Klotz-Sander and Huang are made explicit. The claims are concrete and falsifiable in individual cases. However, the proof is not yet reliable: the central PGFR criterion is imported without proof, and Section 6 contains a concrete CRT-dependent eigenvalue error that invalidates a key non-existence lemma.

major comments (3)

[§2, Theorem 2.6] Theorem 2.6 is the sole criterion used to prove every PGFR existence and non-existence statement in Sections 3 and 6, yet it is imported without proof from the authors' own preprint [18] and is not restated with full hypotheses. The condition is delicate: it depends on the parity of the eigenvector index r as ordered in Theorem 2.1, and a misstatement or misapplication would invalidate Theorems 3.8, 3.10, 6.13, and 7.3. The authors should provide a complete proof of Theorem 2.6, or cite a published version, and verify explicitly that the connection sets considered satisfy its hypotheses.
[§6, Lemma 6.6] The eigenvalue assignment λ_{3p} = λ_{(0,3)} = (1−p)/2 is incorrect. The CRT identification Z_{8p} ≅ Z_p × Z_8 sends r = 3p to (0, 3p mod 8), which is (0,1) for p ≡ 3 mod 8 and (0,5) for p ≡ 7 mod 8, never (0,3). For the concrete case p = 3, G_24 is the 24-cycle (all unit squares modulo 24 are equal to 1), and its eigenvalue at r = 9 is 2cos(3π/4) = −√2, not (1−p)/2 = −1. Therefore the integer relation displayed in Lemma 6.6 is not a relation among the true eigenvalues, and the exclusion of n = 8p in Theorem 6.13 is not established by the given proof. Lemma 6.7 is affected by the same CRT mislabeling.
[§§3, 4, 6] Several lemmas that are essential to the final classifications are dismissed with "proof similar" and no details: Lemmas 3.7, 4.3, 4.5, 4.7, 4.9, 4.14, and 6.12. Given the CRT-indexing errors in Lemmas 6.4–6.7, these omissions are not merely stylistic: the reader cannot separate an incorrect eigenvalue label from an incorrect application of Theorem 2.6. Full proofs, or at least detailed derivations of the displayed eigenvalues, should be provided for every non-existence lemma used in Theorems 6.13 and 7.3.

minor comments (4)

[Abstract] The abstract contains an incomplete sentence: "we classify all X_n admitting pretty good fractional" should read "pretty good fractional revival."
[§5, Lemma 5.5] In the proof of Lemma 5.5, the displayed phase should be exp(−i(t_k λ_r + πr)), which is independent of the starting vertex a; as written with πar, the contradiction obtained at r = 3 and r = 2^{h−2} is not valid for general a.
[§4, Corollary 4.15.1] Corollary 4.15.1 repeats Theorem 4.15 verbatim in the text; if the corollary is intended to assert periodicity rather than integrality, the distinction should be stated explicitly and the proof of the corollary should be supplied.
[§4, Lemma 4.1; §6, Lemma 6.3] There are minor typographical errors: in Lemma 4.1 the index should be a = 2^{h−3} rather than 2h−3, and in Lemma 6.3 the phrase "us write" should be "we write."

Circularity Check

0 steps flagged · score 0.0 of 10

No significant circularity: the PGFR/FR classifications are direct applications of external spectral theorems and a general self-cited criterion that does not encode the target results.

full rationale

The paper's central classifications are reductions to Theorem 2.6, a necessary-and-sufficient integer-relation criterion for PGFR on circulant graphs quoted from the authors' own preprint [18] ('Theorem 2.6 is our main tool to investigate the existence of PGFR on the unitary Cayley graph X_n and the quadratic unitary Cayley graph G_n'). Although this is a self-citation and is load-bearing, it is not circular under the stated rules: the criterion is parameter-free, applies to any circulant graph Cay(Z_n,S), and its assumptions do not include the target classifications for X_n or G_n. The existence proofs (Lemmas 3.4, 6.2, 6.3) verify the criterion's condition on eigenvalue differences; the non-existence proofs (Lemmas 3.5-3.7, 6.4-6.12) exhibit explicit integer relations with odd-index sum ±1. These are applications, not restatements, of the criterion. The eigenvalue inputs themselves are external (Huang's Theorem 2.12 for G_n; Klotz-Sander's Lemma 3.1 for X_n). The FR results add the separate eigenvalue-difference condition of Wang, Wang, and Liu (Theorem 2.5 and Corollary 2.5.1), with Lemmas 3.9, 7.1, and 7.2 checking those differences directly. There are no fitted parameters, no empirical subsets, and no renaming of known results. The repeated 'proof similar, omitted' passages and the fact that Theorem 2.6 is stated without proof are completeness or correctness risks, not circularity. Accordingly, the derivation chain is self-contained against external criteria, and the circularity score is 0.

Assumptions & free parameters 0 free parameters · 6 assumptions · 0 invented entities

The central claims rest on external spectral theorems (Huang, Klotz-Sander), general state-transfer criteria (Wang et al., Pal, and the authors' own Theorem 2.6 from [18]), and standard definitions of continuous-time quantum walks. No free parameters or invented entities appear; the load-bearing imported assumption is Theorem 2.6.

assumptions (6)

domain assumption Theorem 2.6 (PGFR criterion for circulant graphs) from [18]
Used in nearly every proof in Sections 3 and 6; the paper gives no proof and the theorem comes from the authors' own arXiv preprint. The classifications reduce to the integer-relation condition stated in this theorem.
standard math Huang's spectral formula for quadratic unitary Cayley graphs (Theorem 2.12)
Provides all eigenvalues of G_n; used in Sections 4 through 7.
standard math Klotz-Sander Mobius function eigenvalue formula for unitary Cayley graphs (Lemma 3.1)
Provides eigenvalues of X_n used in Section 3.
standard math Wang et al. FR characterization for circulant graphs (Theorem 2.5) and its rational-ratio corollary
Used to prove FR for X_2p and to rule out FR for G_2p with p congruent to 1 modulo 4.
standard math Pal and Pal-Bhattacharjya PGST criteria (Theorems 5.1 and 5.3)
Necessary condition b=a+n/2 and the odd-prime-factor obstruction are used to reduce PGST classification to powers of two.
standard math Godsil's equivalence between periodicity and integrality for these graphs
Used in Section 4 to convert the integrality classification of G_n into the periodicity classification.

how reviews work

0 comments

Cite this review

Pith. "Pith review of State Transfer on Unitary Cayley Graphs and Quadratic Unitary Cayley Graphs." pith.science (2026). https://pith.science/paper/3A4A6TXQ

@misc{pith2026250818068,
  author       = {Pith},
  title        = {Pith review of: State Transfer on Unitary Cayley Graphs and Quadratic Unitary Cayley Graphs},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/3A4A6TXQ}},
  note         = {Machine review of arXiv:2508.18068}
}

abstract

The unitary Cayley graph, denoted $X_n$, is the graph with vertex set ${\mathbb{Z}}_n$ such that two distinct vertices $a$ and $b$ are adjacent if $a-b=u$ for some $u$ with $1 \leq u \leq n-1$ and $\gcd(u,n) = 1$. The quadratic unitary Cayley graph, denoted $G_n$, is the graph with vertex set ${\mathbb{Z}}_n$ such that two distinct vertices $a$ and $b$ are adjacent if $a-b=u^2$ or $a-b=-u^2$ for some $u$ with $1 \leq u \leq n-1$ and $\gcd(u,n) = 1$. In this paper, we classify all $X_n$ admitting pretty good fractional. We also classify all $X_n$ that admit fractional revival. It turns out that $X_n$ admits fractional revival if and only if it admits pretty good fractional revival. Further, we classify all $G_n$ admitting periodicity. As a consequence, we obtain all $G_n$ admitting perfect state transfer. We also classify $G_n$ admitting pretty good state transfer, pretty good fractional revival and fractional revival.

Review history (2 revisions) →

Discussion (0). Continue with ORCID to comment.

Reference graph

Works this paper leans on

28 extracted references · 27 canonical work pages

[18]

Pretty good fractional revival on abelian Cayley graphs

A. Kalita and B. Bhattacharjya. Pretty good fractional revival on abelian Cayley graphs. arXiv:2503.20367v2 (2025)

work page Pith review arXiv 2025
[1]

Basic, M.D

M. Basic, M.D. Petkovic, and D. Stevanovic. Perfect state transfer in integral circulant graphs. �� 22(7) (2009), 1117-1121

work page 2009
[2]

de Beaudrap

N. de Beaudrap. On restricted unitary Cayley graphs and symplectic transformations modulo n. �� 17 (2010), #R69

work page 2010
[3]

Bhakta and B

K. Bhakta and B. Bhattacharjya. Grover walks on quadratic unitary Cayley graphs and integral regular graphs. arXiv:2405.01020 (2024). 22

arXiv 2024
[4]

Bhakta and B

K. Bhakta and B. Bhattacharjya. Periodicity and perfect state transfer of Grover walks on quadratic unitary Cayley graphs. �� 24 (2025), 260

work page 2025
[5]

S. Bose. Quantum communication through an unmodulated spin chain. �� 91(20) (2003), 207901

work page 2003
[6]

D. M. Burton. Elementary number theory. McGraw Hill Education. Seventh Edition. (2012)

work page 2012
[7]

Fractional revival on abelian Cayley graphs

X. Cao and G. Luo. Fractional revival on abelian Cayley graphs. arXiv:2208.05107 (2022)

work page Pith review arXiv 2022

Show all 28 references

[8]

Christandl, N

M. Christandl, N. Datta, T.C. Dorlas, A. Ekert, A. Kay, and A.J. Landahl. Perfect transfer of arbitrary states in quantum spin networks. �� 71 (2005), 032312

2005
[9]

Christandl, N

M. Christandl, N. Datta, A. Ekert, and A.J. Landahl. Perfect state transfer in quantum spin networks. �� 92(18) (2004), 187902

2004
[10]

A. Chan, G. Coutinho, C. Tamon, L. Vinet, and H. Zhan. Quantum fractional revival on graphs. �� 269 (2019), 86-98

2019
[11]

A. Chan, W. Drazen, O. Eisenberg, M. Kempton, and G. Lippner. Pretty good quantum fractional revival in paths and cycles. �� 4(6) (2021), 989-1004

2021
[12]

A. Chan, B. Johnson, M. Liu, M. Schmidt, Z. Yin, and H. Zhan. Laplacian pretty good fractional revival. �� 345 (2022), 112971

2022
[13]

Drazen, M

W. Drazen, M. Kempton, and G. Lippner. Pretty good fractional revival via diagonal perturbation: theory and examples. �� 7(5) (2024), 1507-1523

2024
[14]

Farhi and S

E. Farhi and S. Gutmann. Quantum computation and decision trees. �� 58(2) (1998), 915-928

1998
[15]

C. Godsil. State transfer on graphs. �� 312 (2012), 129-147

2012
[16]

C. Godsil. When can perfect state transfer occur? �� 23 (2012), 877-890

2012
[17]

J. Huang. On the quadratic unitary Cayley graphs. �� 644 (2022), 219-233

2022
[19]

Klotz and T

W. Klotz and T. Sander. Some properties of unitary Cayley graphs. �� 14 (2007), #R45. 23

2007
[20]

Pal and B

H. Pal and B. Bhattacharjya. Pretty good state transfer on circulant graphs. �� 24(2) (2017), #P2.23

2017
[21]

H. Pal. More circulant graphs exhibiting pretty good state transfer. �� 341 (2018), 889-895

2018
[22]

H. Pal. State transfer on NEPS and Cayley graphs. PhD Dissertation. Indian Institute of Technology Guwahati. (2016)

2016
[23]

H. Pal. Quantum state transfer on a class of circulant graphs. �� 69(13) (2021), 2527-2538

2021
[24]

Steinberg

B. Steinberg. Representation Theory of Finite Groups. Universitext. Springer. New York. (2012)

2012
[25]

Y-Y. Tan, K. Feng, and X. Cao. Perfect state transfer on abelian Cayley graphs. �� 563 (2019), 331-352

2019
[26]

Vinet and A

L. Vinet and A. Zhedanov. Almost perfect transfer in quantum spin chains. �� 86 (2012), 052319

2012
[27]

J. Wang, L. Wang, and X. Liu. Fractional revival on Cayley graphs over abelian groups. �� 347 (2024), 114218

2024
[28]

J. Wang, L. Wang, and X. Liu. Pretty good fractional revival on Cayley graphs over dicyclic groups. arXiv:2312.10985 (2023). 24

2023 arXiv

Pith tools

Reviewed August 15, 2026 · model on record in the stance chip above.

[1] [18]

Pretty good fractional revival on abelian Cayley graphs

A. Kalita and B. Bhattacharjya. Pretty good fractional revival on abelian Cayley graphs. arXiv:2503.20367v2 (2025)

work page Pith review arXiv 2025

[2] [1]

Basic, M.D

M. Basic, M.D. Petkovic, and D. Stevanovic. Perfect state transfer in integral circulant graphs. �� 22(7) (2009), 1117-1121

work page 2009

[3] [2]

de Beaudrap

N. de Beaudrap. On restricted unitary Cayley graphs and symplectic transformations modulo n. �� 17 (2010), #R69

work page 2010

[4] [3]

Bhakta and B

K. Bhakta and B. Bhattacharjya. Grover walks on quadratic unitary Cayley graphs and integral regular graphs. arXiv:2405.01020 (2024). 22

arXiv 2024

[5] [4]

Bhakta and B

K. Bhakta and B. Bhattacharjya. Periodicity and perfect state transfer of Grover walks on quadratic unitary Cayley graphs. �� 24 (2025), 260

work page 2025

[6] [5]

S. Bose. Quantum communication through an unmodulated spin chain. �� 91(20) (2003), 207901

work page 2003

[7] [6]

D. M. Burton. Elementary number theory. McGraw Hill Education. Seventh Edition. (2012)

work page 2012

[8] [7]

Fractional revival on abelian Cayley graphs

X. Cao and G. Luo. Fractional revival on abelian Cayley graphs. arXiv:2208.05107 (2022)

work page Pith review arXiv 2022