pith. sign in

arxiv: 2605.04414 · v2 · pith:7IWYK23Fnew · submitted 2026-05-06 · 🧮 math.CO · quant-ph

Uniform Mixing in Chiral Quantum Walks

Luke Levine , Jessy Jacob Mesapam , Benjamin Mustico , Christino Tamon , Gabriel Tucker , Hanmeng Zhan This is my paper

Pith reviewed 2026-05-21 00:03 UTC · model grok-4.3

classification 🧮 math.CO quant-ph
keywords uniform mixingquantum walkscomplete graphsunitary signingsHamming graphscirculantschiral graphsno-go theorems
0
0 comments X

The pith

For some unitary signings, complete graphs have probabilistic uniform mixing in quantum walks.

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

This paper demonstrates that complete graphs equipped with certain unitary signings can achieve probabilistic uniform mixing under continuous-time quantum walks. Previous results had shown that ordinary complete graphs only mix uniformly for two, three, or four vertices. The method relies on a stopping rule that turns the global mixing problem into a local one, which also yields faster mixing for an orientation of the Hamming graph H(n,4) and creates infinite families of oriented circulants that mix on average, going against a known no-go result.

Core claim

We show that for some unitary signing σ, the complete graph K^σ_n has probabilistic uniform mixing. In contrast to Ahmadi et al. who proved no complete graph has uniform mixing except K2, K3, and K4, our technique based on a stopping rule for quantum walks reduces global to local uniform mixing. As a corollary, we found an orientation of H(n,4) that mixes to uniform faster than any other Hamming graphs. We also show that there are infinite families of oriented circulants with average uniform mixing, a chiral violation of Godsil's no-go theorem.

What carries the argument

The stopping rule for quantum walks which reduces global to local uniform mixing

Load-bearing premise

The stopping rule for quantum walks reduces global to local uniform mixing, as described in the technique section.

What would settle it

Explicit calculation of the quantum walk evolution operator for a small n like 5 or 6 with a specific unitary signing to verify if the probability distribution becomes uniform at some stopping time.

Figures

Figures reproduced from arXiv: 2605.04414 by Benjamin Mustico, Christino Tamon, Gabriel Tucker, Hanmeng Zhan, Jessy Jacob Mesapam, Luke Levine.

Figure 1
Figure 1. Figure 1: Quantum uniform mixing times. Our speedup in mixing time is a simple consequence of the signing on K4 which improves the mixing profile of K1,3. More specifically, the signing of K4 allows us to treat any vertex as the conical vertex in K1,3 (where the mixing time is π/3 √ 3). However, if we start at a pendant vertex in K1,3, we incur a slower mixing time of 2π/3 √ 3. For the second part of this work, we c… view at source ↗
Figure 2
Figure 2. Figure 2: A unitary signing of K4. This is switching equivalent to K1 + K⃗ 3. 2.1 Quantum walks Given a graph X, let A(X) denote its adjacency matrix whose spectral decomposition is A(X) = X r λrEr where Er are the orthogonal projectors onto the λr-eigenspace. The continuous-time quan￾tum walk on X is defined as the unitary matrix UX(t) = exp(−itA(X)) = X r e −iλrtEr where the second equality followed from the spect… view at source ↗
Figure 3
Figure 3. Figure 3: The chiral ghost trick: K6 morphs into K1,5. In contrast to Theorem 1, we have the following corollary of Theorem 2. Corollary 1. For any n ≥ 2, there is a unitary signing σ so that the complete graph Kσ n has uniform mixing (in expected n 3/2 time). Proof. Note Kn+1 = K1 + Kn. We consider two cases based on the parity of n. Case 1: n is odd. We use a circulant signing A = Circ(0, −i, i, −i, i, . . . , −i,… view at source ↗
Figure 4
Figure 4. Figure 4: A tale of three uniform mixing times: (a) view at source ↗
Figure 5
Figure 5. Figure 5: Oriented graphs with average uniform mixing: (a) Transitive tournament view at source ↗
read the original abstract

This paper studies uniform mixing in continuous-time quantum walks. We show that for some unitary signing $\sigma$, the complete graph $K^\sigma_n$ has probabilistic uniform mixing. In contrast, Ahmadi \etal (2003) proved that no complete graph has uniform mixing except for $K_2$, $K_3$, and $K_4$. Our technique is based on a stopping rule for quantum walks which reduces global to local uniform mixing. As a corollary, we found an orientation of $H(n,4)$ that mixes to uniform faster than any other Hamming graphs, which improves a result of Godsil and Zhan (2019). We also show that there are infinite families of oriented circulants with average uniform mixing. This is a chiral violation of a No-Go theorem due to Godsil (2013) which states that no graph has average uniform mixing except for $K_2$.

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.

Referee Report

2 major / 2 minor

Summary. The manuscript claims that for some unitary signing σ, the signed complete graph K^σ_n exhibits probabilistic uniform mixing in continuous-time quantum walks, achieved via a stopping rule that reduces the global mixing problem to a local one. This contrasts with the no-go result of Ahmadi et al. (2003) for unsigned complete graphs (except K2, K3, K4). Corollaries include an orientation of the Hamming graph H(n,4) that mixes faster than prior examples, and infinite families of oriented circulants with average uniform mixing, providing a chiral violation of Godsil's (2013) no-go theorem on average uniform mixing.

Significance. If the stopping-rule reduction and explicit constructions are rigorously verified, the results would be significant for quantum walks on graphs: they supply the first uniform-mixing examples on complete graphs beyond the known small cases by exploiting unitary signings, and they furnish a concrete chiral counterexample to the average-uniform-mixing prohibition. The improvement on Hamming-graph mixing times and the infinite families are concrete, falsifiable contributions that could stimulate further work on signed and oriented graphs.

major comments (2)
  1. [Abstract / Technique section] The central claim that a stopping rule reduces global probabilistic uniform mixing on K^σ_n to local mixing is load-bearing, yet the abstract supplies no explicit derivation showing how the eigenvalues of the signed adjacency matrix produce the required cancellation at the chosen stopping time t. Prior no-go results for unsigned K_n demonstrate that mixing depends sensitively on the spectrum; therefore the extension to unitary signings must be spelled out with the precise time-evolution formula (likely in the technique section or §3).
  2. [Corollary on H(n,4)] The corollary asserting that an orientation of H(n,4) mixes to uniform faster than any other Hamming graph improves Godsil and Zhan (2019), but the manuscript must supply the explicit mixing-time comparison (e.g., the numerical value of the stopping time or the decay rate) and confirm that the improvement is not merely marginal; without these data the claim cannot be assessed.
minor comments (2)
  1. [Introduction] Define 'unitary signing' σ and 'chiral quantum walk' at the first use, with a short reminder of how the signing modifies the adjacency matrix.
  2. [Section on circulants] Add a brief remark on how the new families of oriented circulants differ from the constructions already appearing in the literature on average mixing.

Simulated Author's Rebuttal

2 responses · 0 unresolved

We thank the referee for the careful review and constructive suggestions. We address each major comment below and will revise the manuscript to improve clarity and provide the requested explicit details.

read point-by-point responses

  1. Referee: The central claim that a stopping rule reduces global probabilistic uniform mixing on K^σ_n to local mixing is load-bearing, yet the abstract supplies no explicit derivation showing how the eigenvalues of the signed adjacency matrix produce the required cancellation at the chosen stopping time t. ... the extension to unitary signings must be spelled out with the precise time-evolution formula (likely in the technique section or §3).

    Authors: We agree that the connection between the signed spectrum and the stopping-time cancellation should be made more explicit for readers familiar with the unsigned no-go results. The full derivation, including the time-evolution operator U(t) = exp(-itA_σ) and the eigenvalue-driven cancellation that reduces global to local mixing, appears in Section 3. In the revision we will add a concise paragraph immediately after the abstract statement of the stopping rule that displays the key formula for the amplitude at time t and notes how the unitary signing alters the relevant eigenvalues relative to the unsigned case. revision: yes

  2. Referee: The corollary asserting that an orientation of H(n,4) mixes to uniform faster than any other Hamming graph improves Godsil and Zhan (2019), but the manuscript must supply the explicit mixing-time comparison (e.g., the numerical value of the stopping time or the decay rate) and confirm that the improvement is not merely marginal.

    Authors: We accept the request for quantitative comparison. The revised version will include a short table (or inline calculation) giving the explicit stopping time t for the oriented H(n,4) together with the corresponding values from Godsil and Zhan (2019). We will also state the decay rate of the deviation from uniform and note that the improvement is by a constant factor independent of n, which is non-marginal for the infinite family. revision: yes

Circularity Check

0 steps flagged

No significant circularity; derivation relies on new stopping rule and signings independent of inputs

full rationale

The paper's central result—that certain unitary signings σ allow probabilistic uniform mixing on K^σ_n, plus corollaries on oriented Hamming graphs and circulants violating Godsil's no-go—rests on introducing a stopping rule that reduces global to local mixing. This technique is presented as novel and is not shown to reduce by construction to any fitted parameter, self-definition, or prior ansatz from the authors. Citations to Godsil and Zhan (2019) and Godsil (2013) provide context for improvement and contrast rather than load-bearing justification for the new claims. The derivation chain is therefore self-contained against external benchmarks and does not exhibit any of the enumerated circularity patterns.

Axiom & Free-Parameter Ledger

0 free parameters · 2 axioms · 0 invented entities

The central claims rest on standard properties of unitary operators and quantum walk Hamiltonians from prior literature, with no free parameters or invented entities introduced in the abstract.

axioms (2)
  • domain assumption Unitary signings exist that preserve the required spectral properties for the quantum walk operator.
    Invoked implicitly when stating that for some σ the signed graph has uniform mixing.
  • domain assumption The stopping rule correctly reduces global uniform mixing to local mixing without altering the probability distribution.
    Central to the technique described in the abstract.

pith-pipeline@v0.9.0 · 5696 in / 1283 out tokens · 61021 ms · 2026-05-21T00:03:01.184703+00:00 · methodology

Review history (2 revisions) →

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Lean theorems connected to this paper

Citations machine-checked in the Pith Canon. Every link opens the source theorem in the public Lean library.

What do these tags mean?
matches
The paper's claim is directly supported by a theorem in the formal canon.
supports
The theorem supports part of the paper's argument, but the paper may add assumptions or extra steps.
extends
The paper goes beyond the formal theorem; the theorem is a base layer rather than the whole result.
uses
The paper appears to rely on the theorem as machinery.
contradicts
The paper's claim conflicts with a theorem or certificate in the canon.
unclear
Pith found a possible connection, but the passage is too broad, indirect, or ambiguous to say the theorem truly supports the claim.

Reference graph

Works this paper leans on

24 extracted references · 24 canonical work pages

  1. [1]

    Aharonov, A

    D. Aharonov, A. Ambainis, J. Kempe, U. Vazirani, Quantum Walks on Graphs,Pro- ceedings of the Annual ACM Symposium on the Theory of Computing(STOC), p50-59, 2001

    work page 2001

  2. [2]

    Ahmadi, R

    A. Ahmadi, R. Belk, C. Tamon, C. Wendler, On Mixing in Continuous-time Quantum Walks on Some Circulant Graphs,Quantum Information and Computation3(6):611-618, 2003

    work page 2003

  3. [3]

    N. Alon, K. Zheng, Unitary signing and induced subgraphs of Cayley graphs ofZ n 2, Advances in Combinatorics, November 09, 2020

    work page 2020

  4. [4]

    Babai, Spectra of Cayley Graphs,Journal of Combinatorial Theory B27:180-189, 1979

    L. Babai, Spectra of Cayley Graphs,Journal of Combinatorial Theory B27:180-189, 1979

    work page 1979

  5. [5]

    Cabello, Bell’s theorem with and without inequalities for the three-qubit Greenberger- Horne-Zeilinger and W states,Physical Review A65:032108, 2002

    A. Cabello, Bell’s theorem with and without inequalities for the three-qubit Greenberger- Horne-Zeilinger and W states,Physical Review A65:032108, 2002

    work page 2002

  6. [6]

    Cameron, S

    S. Cameron, S. Fehrenbach, L. Granger, O. Hennigh, S. Shrestha, C. Tamon, Universal State Transfer on Graphs,Linear Algebra and Its Applications455:115-142, 2014

    work page 2014

  7. [7]

    Coutinho, C

    G. Coutinho, C. Godsil, K. Guo, H. Zhan, A New Perspective on the Average Mixing Matrix,Electronic Journal of Combinatorics25(4), #P4.14, 2018

    work page 2018

  8. [8]

    Davis,Circulant Matrices, second edition, Chelsea, 1994

    P. Davis,Circulant Matrices, second edition, Chelsea, 1994. 14

    work page 1994

  9. [9]

    D’Hondt, P

    E. D’Hondt, P. Panangaden, The computational power of the W and GHZ states,Quan- tum Information and Computation6(2):173-183, 2006

    work page 2006

  10. [10]

    D¨ ur, G

    W. D¨ ur, G. Vidal, J.I. Cirac, Three qubits can be entangled in two inequivalent ways, Physical Review A62:062314, 2000

    work page 2000

  11. [11]

    Godsil, Average Mixing of Continuous Quantum Walks,Journal of Combinatorial Theory A120:1649-1662, 2013

    C. Godsil, Average Mixing of Continuous Quantum Walks,Journal of Combinatorial Theory A120:1649-1662, 2013

    work page 2013

  12. [12]

    Godsil, G

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

    work page 2001

  13. [13]

    Godsil, H

    C. Godsil, H. Zhan, Discrete-time Quantum Walks and Discrete Structures,J. Combi- natorial Theory A167:181-212, 2019

    work page 2019

  14. [14]

    Godsil, H

    C. Godsil, H. Zhan, Uniform Mixing on Cayley Graphs,Electronic Journal of Combi- natorics24, Issue 3, 2017

    work page 2017

  15. [15]

    Haemers, Interlacing Eigenvalues and Graphs,Linear Algebra and Its Applications 227-228:593-616, 1995

    W. Haemers, Interlacing Eigenvalues and Graphs,Linear Algebra and Its Applications 227-228:593-616, 1995

    work page 1995

  16. [16]

    R. Horn, C. Johnson,Matrix Analysis, second edition, Cambridge University Press, 2013

    work page 2013

  17. [17]

    Lipinska, G

    V. Lipinska, G. Murta, S. Wehner, Anonymous transmission in a noisy quantum network using the W state,Physical Review A98:052320, 2018

    work page 2018

  18. [18]

    Lovasz, P

    L. Lovasz, P. Winkler, Exact Mixing in an Unknown Markov Chain,Electronic Journal of Combinatorics2, 1995

    work page 1995

  19. [19]

    M. Luby, A. Sinclair, D. Zuckerman, Optimal speedup of Las Vegas algorithms,Infor- mation Processing Letters47:173-180, 1993

    work page 1993

  20. [20]

    Moore, A

    C. Moore, A. Russell, Quantum walks on the Hypercube,Proc. 6th International Work- shop on Randomization and Approximation Techniques in Computer Science (RANDOM 2002), 164-178, 2002

    work page 2002

  21. [21]

    Motwani, P

    R. Motwani, P. Raghavan,Randomized Algorithms, Cambridge University Press, 1995

    work page 1995

  22. [22]

    Nielsen, I

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

    work page 2000

  23. [23]

    Sin, Uniform mixing in continuous-time quantum walks on oriented, nonabelian Cay- ley graphs, https://arxiv.org/abs/2510.08376

    P. Sin, Uniform mixing in continuous-time quantum walks on oriented, nonabelian Cay- ley graphs, https://arxiv.org/abs/2510.08376

    work page arXiv

  24. [24]

    W. Xie, A. Kay, C. Tamon, Breaking the Speed Limit of Perfect Quantum State Trans- fer,Physical Review A108:012408, 2023. 15

    work page 2023