Pith. sign in

REVIEW 5 minor 44 references

Averaging a Haar-random coin fully depolarizes that subspace, yet vertex measurements can still recover initial-state information forever.

Reviewed by Pith at T0; open to challenge. T0 means a machine referee read the full paper against a public rubric. the ladder, T0–T4 →

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

T0 review · grok-4.5

2026-07-11 16:51 UTC pith:3LN2JLLD

load-bearing objection Clean, explicit spectral analysis of Haar-averaged coined walks: coin depolarizes, yet Abelian Cayley graphs keep |G| fixed points and forever-measurable vertex correlations.

arxiv 2607.04584 v2 pith:3LN2JLLD submitted 2026-07-06 quant-ph

Quantum random walks on d-regular graphs with Haar-random coin operators

Alice C. Quillen This is my paper
classification quant-ph
keywords quantum random walkHaar-random coinaveraged quantum channeldepolarizationCayley graphdephasingnon-ergodic channelvertex correlations
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved

The pith

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

This paper constructs discrete quantum walks on d-regular graphs in which the coin at every step is an independent Haar-random unitary. Averaging over those random coins produces a channel that completely depolarizes the coin and recovers the classical balanced random walk on the same graph. Remarkably, the averaged channel is not ergodic: it possesses many fixed points, so certain coherences in the vertex subspace never decay. For Cayley graphs of Abelian groups the channel is dephasing in the Fourier basis, and suitably chosen vertex or two-vertex correlation measurements can still extract the initial superposition parameters after arbitrarily many steps. The construction therefore supplies a clean laboratory for bipartite systems in which one subsystem is violently scrambled while information about the other remains permanently readable.

Core claim

Even though the expectation value of a Haar-random-coin quantum walk completely depolarizes the coin subspace and reproduces classical diffusion on the graph, the resulting averaged channel is never ergodic. On any d-regular graph that admits a unitary edge labeling it has multiple density-operator fixed points; on Cayley graphs of Abelian groups the number of independent fixed points equals the number of vertices and the channel is dephasing in the Fourier basis. Consequently, carefully chosen measurements of vertex positions or of correlations between pairs of vertices continue to carry information about the initial state after arbitrarily many iterations.

What carries the argument

The averaged quantum channel obtained by integrating the unitary walk over the Haar measure on the coin unitaries (Eq. 20 / 22). This super-operator depolarizes the coin, acts as a classical transition matrix on vertices, yet retains a large eigenspace of eigenvalue ±1 that encodes the surviving Fourier coherences.

Load-bearing premise

The graph must allow every edge label to define a global permutation of the vertices so that the controlled-shift operators remain unitary; without that combinatorial condition the averaged channel used throughout the paper is not even defined.

What would settle it

On the cycle of even length, prepare a pure superposition of Fourier modes k and k+N/2, iterate the averaged channel many times, and measure the two-vertex correlator P_vv'; if the extracted angle heta fails to match the prepared superposition (or decays), the claim that off-diagonal Fourier components of eigenvalue −1 survive forever is false.

Watch this falsifier — get emailed when new claim-graph text bears on it.

Editorial analysis

A structured set of objections, weighed in public.

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

Referee Report

0 major / 5 minor

Summary. The paper studies discrete-time quantum walks on d-regular undirected connected simple graphs in which the coin operator is redrawn independently at every step from the Haar measure on U(d). The averaged channel (expectation over the Haar measure) fully depolarizes the coin subspace and recovers the classical random walk with a fair d-sided die; the same averaged channel is nevertheless non-ergodic. Explicit spectral decompositions are given for the cycle, the hypercube and, more generally, Cayley graphs of finite Abelian groups: the channel is dephasing in the Fourier basis of the vertex space, possesses a number of linearly independent fixed points equal to the number of vertices, and admits surviving off-diagonal (or correlation) components that can be detected by suitably chosen vertex measurements even after arbitrarily many iterations. Position variance on the cycle grows linearly with the number of steps, consistent with classical diffusion.

Significance. The work supplies a clean, parameter-free and fully explicit example of a bipartite quantum system in which one subsystem is subjected to maximal random unitary noise while information about the complementary subsystem remains permanently encoded in non-decaying eigenspaces and is in principle measurable. The calculations rest only on the Haar integral and the standard controlled-shift construction; they therefore constitute a useful pedagogical and technical benchmark for the open-quantum-walk and random-circuit communities. The linear growth of variance and the precise characterization of the fixed-point space for Abelian Cayley graphs are concrete, falsifiable predictions that can be checked numerically or experimentally.

minor comments (5)
  1. Section headings and some inline text contain spurious spaces (e.g., “W ALK”, “THA T”, “A VERAGED”). These appear to be PDF-extraction artefacts; they should be cleaned in the final version.
  2. Indexing conventions for vertices and coin states alternate between {0,…,N-1} and {1,…,N} (explicitly noted by the author). A single consistent convention, or a short clarifying sentence at the start of each example, would improve readability.
  3. Figure 2 compares a Hadamard walk at steps 3/23/43 with a Haar-random walk at steps 5/85/165. A brief remark explaining the different time scales (or a common set of iteration numbers) would make the visual comparison more immediate.
  4. The linearization used to estimate the change in variance (Eqs. 114–117) is approximate; a short remark that higher-order moments of the Haar measure are not needed for the leading linear growth would strengthen the presentation of Section V.
  5. The combinatorial precondition that the edge-labeling functions w(j,v) must be permutations (so that the Ŵ_j are unitary) is standard for coined walks, yet it is worth restating once more in the concluding section that the non-ergodicity proof of §III D applies only to graphs admitting such a labeling.

Circularity Check

0 steps flagged

No circularity: all claims follow by direct calculation from the Haar average and the controlled-shift definition.

full rationale

The paper defines the Haar-random coined walk via the product of the controlled-shift operator Λ_S (Eq. 3) and an independent Haar-random unitary on the coin (Eq. 17). The averaged channel is obtained by applying the standard first-moment formula for Haar unitaries (Mele Cor. 13) to the coin factor, immediately yielding the depolarizing map of Eq. 19–22. Non-ergodicity is shown by exhibiting multiple fixed points (the completely mixed coin tensored with any Fourier projector, or more generally any density operator diagonal in the Fourier basis of a Cayley graph of an Abelian group). The explicit eigenvectors and eigenvalues for the cycle (Eqs. 42–43), hypercube (Eqs. 72, 74) and general Abelian Cayley graph (Eqs. 96–97) are obtained by substituting the Fourier representation of the shift operators into the averaged channel and reading off the spectrum; no free parameters are fitted and no uniqueness theorem is imported from prior work by the same author. The claim that vertex-subspace correlations can survive is likewise a direct consequence of the existence of those non-decaying eigenmodes. All steps are therefore self-contained algebraic consequences of the definitions; the only external inputs are textbook facts about Haar measure and Fourier analysis on finite Abelian groups. Circularity score is therefore zero.

Axiom & Free-Parameter Ledger

0 free parameters · 3 axioms · 0 invented entities

The paper rests entirely on standard quantum-information and representation-theory facts; no free parameters are fitted and no new physical entities are postulated. The only non-trivial modeling choice is the combinatorial requirement that the graph admit a unitary edge labeling, which is stated explicitly and is satisfied by all Cayley graphs of Abelian groups used in the examples.

axioms (3)
  • standard math The first moment of a Haar-random unitary on C^d is the completely depolarizing map: E[U O U†] = (tr O / d) I_d (Mele, Cor. 13).
    Invoked immediately to obtain the averaged coin channel (Eq. 19).
  • domain assumption A d-regular undirected simple connected graph admits index functions w(j,v) that are permutations of the vertex set for each edge label j, so that the operators Ŵ_j are unitary.
    Required for the controlled-shift operator Λ_S (Eq. 3) to be unitary; stated in Section II and used throughout.
  • standard math Finite Abelian groups possess a complete set of one-dimensional irreducible characters that furnish a discrete Fourier transform diagonalizing the Cayley-graph shift operators.
    Used to obtain the spectral decomposition of the averaged channel (Sections IV A–C).

pith-pipeline@v1.1.0-grok45 · 30462 in / 2386 out tokens · 22453 ms · 2026-07-11T16:51:59.183787+00:00 · methodology

0 comments
read the original abstract

With unitary coin operator that is a random matrix drawn from a uniform distribution with respect to the Haar measure, we construct a variant of a discrete quantum random walk using a d-regular undirected connected simple graph. With each step of the walk, the coin operator random matrix is drawn independently from the distribution. The expectation value over the distribution of random unitaries for the associated quantum channel gives a depolarization channel for the coin subspace and resembles the associated classical random walk where the direction a walker steps depends upon the outcome of a fair coin or balanced d-sided dice. Remarkably, despite the fact that the averaged channel depolarizes the coin subspace, measurements in the vertex subspace can be designed that would reveal information about the initial quantum state, even after many iterations of the channel. We illustrate with examples of quantum walks on Cayley graphs of Abelian groups, such as the cycle and hypercube graphs. For Cayley graphs of Abelian groups, the averaged channel is dephasing in the Fourier basis. These quantum walks are examples of bipartite strongly interacting systems, where one subsystem is strongly perturbed, yet information about the initial state in the other subsystem is potentially measurable forever. Due to its decoherence, a quantum random walk with a Haar-random coin would not be useful in search algorithms but could aid in understanding quantum systems with strongly perturbed subsystems.

Figures

Figures reproduced from arXiv: 2607.04584 by Alice C. Quillen.

Figure 1
Figure 1. Figure 1: FIG. 1. A quantum circuit illustration of a quantum walk [PITH_FULL_IMAGE:figures/full_fig_p003_1.png] view at source ↗
Figure 2
Figure 2. Figure 2: FIG. 2. a) An illustration of the quantum random walk on [PITH_FULL_IMAGE:figures/full_fig_p005_2.png] view at source ↗

discussion (0)

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

Reference graph

Works this paper leans on

44 extracted references · 17 canonical work pages · 12 internal anchors

  1. [1]

    Example 1: The Hadamard coin quantum walk on the cycle graph 3

  2. [2]

    A quantum walk with a Markov coin that is Haar-random 4 A

    Example 2: The Grover coin quantum walk on the hypercube graph 4 III. A quantum walk with a Markov coin that is Haar-random 4 A. The averaged quantum channel 4 B. A numerical illustration of the Haar-random coin quantum walk on the cycle graph 5 C. Expectation values of the iterated Markov coin random walk 6 D. The averaged channel is not ergodic 6 E. The...

    Pith/arXiv arXiv 2026

  3. [3]

    The quantum channel itself is also a linear operator (often called a superoperator)

    Byquantum channelE(ρ) we mean a trace preserving completely positive linear map operating on the space of density operators. The quantum channel itself is also a linear operator (often called a superoperator). Since we work with a bipartite tensor product space, we can take the partial trace of a density operator. When tracing over thed-dimensional subspa...

  4. [4]

    Instead of an infinite dimensional line, the graph is the cycle graph withNvertices (e.g., following [1])

    Example 1: The Hadamard coin quantum walk on the cycle graph We give an example similar to the quantum walk on the line [2]. Instead of an infinite dimensional line, the graph is the cycle graph withNvertices (e.g., following [1]). Each vertex has two edges so the graph degree is d= 2. The quantum space is 2×Ndimensional. We label the vertices so thatvis ...

  5. [5]

    For thed-dimensional hypercube, with N= 2 d vertices, theN-dimensional space describing ver- tices is equivalent to the tensor product ofdtwo state quantum systems ordqubits

    Example 2: The Grover coin quantum walk on the hypercube graph We give an example for a quantum walk on the hy- percube [19, 26]. For thed-dimensional hypercube, with N= 2 d vertices, theN-dimensional space describing ver- tices is equivalent to the tensor product ofdtwo state quantum systems ordqubits. A vertex on the hypercube can be labelled with its b...

  6. [6]

    The averaged channel has more than one fixed point (in the space of density operators) and consequently it is not er- godic

    Since these states have trace of 1 and are positive, they are both in the space of density operators. The averaged channel has more than one fixed point (in the space of density operators) and consequently it is not er- godic. We find that the averaged channel of a quantum random walk with a Haar-random coin is not ergodic when constructed on anyd-regular...

  7. [7]

    A characterχ k() :G→C(labelled by indexk) generates a complex numberχ k(g) that is a root of unity for each elementgin the group

    can be defined using the group ˆGof its multiplica- tive characters (which are the 1-dimensional irreducible representations). A characterχ k() :G→C(labelled by indexk) generates a complex numberχ k(g) that is a root of unity for each elementgin the group. Mul- tiplication of the characters obey group multiplication; χk(g)χk(h) =χ k(gh) forg, h∈G. For an ...

  8. [8]

    Each discrete Fourier transform in the product is associated with a generators j ∈Sand depends on a phase factorω j as defined in equation 89

    A Fourier basis for a finite Abelian group can be described as a product of discrete Fourier transforms in the form of equation 36. Each discrete Fourier transform in the product is associated with a generators j ∈Sand depends on a phase factorω j as defined in equation 89. According to the fundamental theorem of finite Abelian groups, any finite Abelian ...

  9. [9]

    Equation 93 shows that in the Fourier basis, the unitary operators ˆWm ∈ L(C N) are diagonal

    The sum overkis over all Fourier basis elements. Equation 93 shows that in the Fourier basis, the unitary operators ˆWm ∈ L(C N) are diagonal. As before, we construct a quantum random walk with a Haar-random coin. The averaged channel ¯ESV is again given via equation 22 which we write in the Fourier basis giving ¯ESV (ρ) = 1 d dX m=1 |m⟩ ⟨m| ⊗ ˆWm trA(ρ) ...

    2026

  10. [10]

    Aharonov, D., Ambainis, A., Kempe, J., Vazirani, U.,

  11. [11]

    Quantum walks on graphs, in: Proceedings of the Thirty-Third Annual ACM Symposium on Theory of Computing, Association for Computing Machinery, New York, NY, USA. pp. 50–59. URL:https://doi.org/10. 1145/380752.380758, doi:doi:10.1145/380752.380758

    work page doi:10.1145/380752.380758

  12. [12]

    Quan- tum random walks

    Aharonov, Y., Davidovich, L., Zagury, N., 1993. Quan- tum random walks. Phys Rev A 48, 1687–1690. doi:doi: 10.1103/PhysRevA.48.1687

    doi:10.1103/physreva.48.1687 1993

  13. [13]

    Ahlbrecht, A., Vogts, H., Werner, A.H., Werner, R.F.,

  14. [14]

    Journal of Mathematical Physics 52, 042201

    Asymptotic evolution of quantum walks with random coin. Journal of Mathematical Physics 52, 042201. URL:https://doi.org/10.1063/1.3575568, 18 doi:doi:10.1063/1.3575568

    work page doi:10.1063/1.3575568

  15. [15]

    Cen- tral Limit Theorems for Open Quantum Random Walks and Quantum Measurement Records

    Attal, S., Guillotin-Plantard, N., Sabot, C., 2015. Cen- tral Limit Theorems for Open Quantum Random Walks and Quantum Measurement Records. Annales Henri Poincar´ e 16, 15–43. doi:doi:10.1007/s00023-014-0319-3

    work page doi:10.1007/s00023-014-0319-3 2015

  16. [16]

    Fourier Analysis on Finite Groups and Applications

    Audrey, T., 1999. Fourier Analysis on Finite Groups and Applications. volume 43 ofLondon Mathematical Society Student Texts. Cambridge University Press

    1999

  17. [17]

    Markovian Repeated Interaction Quantum Systems

    Bougron, J.F., Joye, A., Pillet, C.A., 2022. Marko- vian repeated interaction quantum systems. Reviews in Mathematical Physics 34, 2250028–43. doi:doi: 10.1142/S0129055X22500283,arXiv:2202.05321

    work page internal anchor Pith review Pith/arXiv arXiv doi:10.1142/s0129055x22500283 2022

  18. [18]

    Quantum random walks with decoherent coins

    Brun, T.A., Carteret, H.A., Ambainis, A., 2003. Quan- tum random walks with decoherent coins. Phys Rev A 67, 032304. doi:doi:10.1103/PhysRevA.67.032304, arXiv:quant-ph/0210180

    work page internal anchor Pith review Pith/arXiv arXiv doi:10.1103/physreva.67.032304 2003

  19. [19]

    Ergodic and Mixing Quantum Channels in Finite Dimensions

    Burgarth, D., Chiribella, G., Giovannetti, V., Perinotti, P., Yuasa, K., 2013. Ergodic and mixing quantum channels in finite dimensions. New Journal of Physics 15, 073045. doi:doi:10.1088/1367-2630/15/7/073045, arXiv:1210.5625

    work page internal anchor Pith review Pith/arXiv arXiv doi:10.1088/1367-2630/15/7/073045 2013

  20. [20]

    Open Quantum Random Walks: Reducibility, Period, Ergodic Properties

    Carbone, R., Pautrat, Y., 2016. Open Quantum Random Walks: Reducibility, Period, Ergodic Properties. Annales Henri Poincar´ e 17, 99–135. doi:doi:10.1007/s00023-015- 0396-y

    work page doi:10.1007/s00023-015- 2016

  21. [21]

    Spatial search by quantum walk

    Childs, A.M., Goldstone, J., 2004. Spatial search by quantum walk. Phys Rev A 70, 022314. doi:doi:10.1103/PhysRevA.70.022314, arXiv:quant-ph/0306054

    work page internal anchor Pith review Pith/arXiv arXiv doi:10.1103/physreva.70.022314 2004

  22. [22]

    Uni- versal Computation by Multiparticle Quantum Walk

    Childs, A.M., Gosset, D., Webb, Z., 2013. Uni- versal Computation by Multiparticle Quantum Walk. Science 339, 791–794. doi:doi:10.1126/science.1229957, arXiv:1205.3782

    Pith/arXiv arXiv doi:10.1126/science.1229957 2013

  23. [23]

    Stochastic collision model approach to transport phenomena in quantum networks

    Chisholm, D.A., Garc´ ıa-P´ erez, G., Rossi, M.A.C., Palma, G.M., Maniscalco, S., 2021. Stochastic collision model approach to transport phenomena in quantum networks. New Journal of Physics 23, 033031. doi:doi:10.1088/1367- 2630/abd57d,arXiv:2010.05618

    work page internal anchor Pith review Pith/arXiv arXiv doi:10.1088/1367- 2021

  24. [24]

    Quantum collision models: Open sys- tem dynamics from repeated interactions

    Ciccarello, F., Lorenzo, S., Giovannetti, V., Palma, G.M., 2022. Quantum collision models: Open sys- tem dynamics from repeated interactions. Physics Re- ports 954, 1–70. doi:doi:10.1016/j.physrep.2022.01.001, arXiv:2106.11974

    Pith/arXiv arXiv doi:10.1016/j.physrep.2022.01.001 2022

  25. [25]

    Anderson localization of a one- dimensional quantum walker

    Derevyanko, S., 2018. Anderson localization of a one- dimensional quantum walker. Scientific Reports 8, 1795

    2018

  26. [26]

    Pseudo-Random Unitary Op- erators for Quantum Information Processing

    Emerson, J., Weinstein, Y.S., Saraceno, M., Lloyd, S., Cory, D.G., 2003. Pseudo-Random Unitary Op- erators for Quantum Information Processing. Sci- ence 302, 2098–2101. doi:doi:10.1126/science.1090790, arXiv:quant-ph/0410087

    Pith/arXiv arXiv doi:10.1126/science.1090790 2003

  27. [27]

    Random Quantum Circuits

    Fisher, M.P.A., Khemani, V., Nahum, A., Vijay, S., 2023. Random Quantum Circuits. Annual Re- view of Condensed Matter Physics 14, 335–379. doi:doi:10.1146/annurev-conmatphys-031720-030658, arXiv:2207.14280

    Pith/arXiv arXiv doi:10.1146/annurev-conmatphys-031720-030658 2023

  28. [28]

    Simulating Anderson localization via a quantum walk on a one-dimensional lattice of superconducting qubits

    Ghosh, J., 2014. Simulating Anderson localization via a quantum walk on a one-dimensional lattice of super- conducting qubits. Phys Rev A 89, 022309. doi:doi: 10.1103/PhysRevA.89.022309,arXiv:1311.4284

    work page internal anchor Pith review Pith/arXiv arXiv doi:10.1103/physreva.89.022309 2014

  29. [29]

    Graydon, M.A., Skanes-Norman, J., Wallman, J.J.,

  30. [30]

    Designing Stochastic Channels

    Designing Stochastic Channels. arXiv e-prints , arXiv:2201.07156doi:doi:10.48550/arXiv.2201.07156, arXiv:2201.07156

    work page internal anchor Pith review Pith/arXiv arXiv doi:10.48550/arxiv.2201.07156

  31. [31]

    Quantum random walks: An introductory overview

    Kempe, J., 2003. Quantum random walks: An introductory overview. Contemporary Physics 44, 307–327. doi:doi:10.1080/00107151031000110776, arXiv:quant-ph/0303081

    Pith/arXiv arXiv doi:10.1080/00107151031000110776 2003

  32. [32]

    Quantum walks on Cayley graphs

    Lopez Acevedo, O., Gobron, T., 2006. Quantum walks on Cayley graphs. Journal of Physics A: Mathemat- ical and General 39, 585–599. doi:doi:10.1088/0305- 4470/39/3/011,arXiv:quant-ph/0503078

    work page internal anchor Pith review Pith/arXiv arXiv doi:10.1088/0305- 2006

  33. [33]

    Quantum walks in higher dimensions

    Mackay, T.D., Bartlett, S.D., Stephenson, L.T., Sanders, B.C., 2002. Quantum walks in higher dimen- sions. Journal of Physics A Mathematical General 35, 2745–2753. doi:doi:10.1088/0305-4470/35/12/304, arXiv:quant-ph/0108004

    work page internal anchor Pith review Pith/arXiv arXiv doi:10.1088/0305-4470/35/12/304 2002

  34. [34]

    Introduction to Haar Measure Tools in Quantum Information: A Beginner’s Tutorial

    Mele, A.A., 2024. Introduction to Haar Measure Tools in Quantum Information: A Beginner’s Tutorial. Quantum 8, 1340. doi:doi:10.22331/q-2024-05-08-1340, arXiv:2307.08956

    Pith/arXiv arXiv doi:10.22331/q-2024-05-08-1340 2024

  35. [35]

    Theory of Ergodic Quantum Processes

    Movassagh, R., Schenker, J., 2021. Theory of Ergodic Quantum Processes. Physical Review X 11, 041001. doi:doi:10.1103/PhysRevX.11.041001, arXiv:2004.14397

    work page internal anchor Pith review Pith/arXiv arXiv doi:10.1103/physrevx.11.041001 2021

  36. [36]

    Quantum Walks and Search Algorithms

    Portugal, R., 2018. Quantum Walks and Search Algorithms. Quantum Science and Technology. 2nd ed., Springer Nature Switzerland, Cham, Switzerland. doi:doi:10.1007/978-3-319-97813-0

    doi:10.1007/978-3-319-97813-0 2018

  37. [37]

    Matrix product solutions of boundary driven quantum chains

    Prosen, T., 2015. Matrix product solutions of bound- ary driven quantum chains. Journal of Physics A Mathematical General 48, 373001. doi:doi:10.1088/1751- 8113/48/37/373001,arXiv:1504.00783

    work page internal anchor Pith review Pith/arXiv arXiv doi:10.1088/1751- 2015

  38. [38]

    Quan- tum random-walk search algorithm

    Shenvi, N., Kempe, J., Whaley, K.B., 2003. Quan- tum random-walk search algorithm. Phys Rev A 67, 052307. doi:doi:10.1103/PhysRevA.67.052307, arXiv:quant-ph/0210064

    Pith/arXiv arXiv doi:10.1103/physreva.67.052307 2003

  39. [39]

    Stanzione, V., Civolani, A., Malo, J.Y., Chiofalo, M.L.,

  40. [40]

    Physical Review B 112, 224209

    Tailoring transport in quantum spin chains via disorder and collisions. Physical Review B 112, 224209. doi:doi:10.1103/zt36-nkbv,arXiv:2502.15515

    work page doi:10.1103/zt36-nkbv

  41. [41]

    Quantum walks: a com- prehensive review

    Venegas-Andraca, S.E., 2012. Quantum walks: a com- prehensive review. Quantum Information Processing Vol- ume 11, 1015–1106

    2012

  42. [42]

    Recurrence in discrete-time quantum stochastic walks

    ˇStefaˇ n´ ak, M., Potoˇ cek, V., Yal¸ cınkaya,˙I., G´ abris, A., Jex, I., 2026. Recurrence in discrete-time quantum stochastic walks. Quantum 10, 1982. doi:doi:10.22331/q- 2026-01-22-1982

    doi:10.22331/q- 2026

  43. [43]

    Quantum simulations of classical ran- dom walks and undirected graph connectivity

    Watrous, J., 2001. Quantum simulations of classical ran- dom walks and undirected graph connectivity. Journal of Computer and System Sciences 62, 376–391

    2001

  44. [44]

    Quantum stochastic walks: A generalization of classical random walks and quantum walks

    Whitfield, J.D., Rodr´ ıguez-Rosario, C.A., Aspuru-Guzik, A., 2010. Quantum stochastic walks: A generalization of classical random walks and quantum walks. Phys Rev A 81, 022323. doi:doi:10.1103/PhysRevA.81.022323, arXiv:0905.2942

    work page internal anchor Pith review Pith/arXiv arXiv doi:10.1103/physreva.81.022323 2010