Reuse & Permissions

It is not necessary to obtain permission to reuse this article or its components as it is available under the terms of the Creative Commons Attribution 4.0 International license. This license permits unrestricted use, distribution, and reproduction in any medium, provided attribution to the author(s) and the published article's title, journal citation, and DOI are maintained. Please note that some figures may have been included with permission from other third parties. It is your responsibility to obtain the proper permission from the rights holder directly for these figures.

Export citation

Export citation

Choose format for download:

Download Citation
  • Open Access

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

Alice C. Quillen*,†

  • *Contact author: aquillen@ur.rochester.edu
  • †Visitor at the Max Planck Institute for the Physics of Complex Systems, Noethnitzer Str. 38, Dresden 011187, Germany.

Phys. Rev. A 114, 042410 – Published 7 October, 2026

DOI: https://doi.org/10.1103/rmmp-xdqy

Abstract

With a 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.

View figure in article

Physics Subject Headings (PhySH)

Article Text

References (31)

  1. Y. Aharonov, L. Davidovich, and N. Zagury, Quantum random walks, Phys. Rev. A 48, 1687 (1993).
  2. J. Watrous, Quantum simulations of classical random walks and undirected graph connectivity, J. Comput. Syst. Sci. 62, 376 (2001).
  3. J. Kempe, Quantum random walks: An introductory overview, Contemp. Phys. 44, 307 (2003).
  4. A. M. Childs and J. Goldstone, Spatial search by quantum walk, Phys. Rev. A 70, 022314 (2004).
  5. R. Portugal, Quantum Walks and Search Algorithms, 2nd ed., Quantum Science and Technology (Springer Nature Switzerland, Cham, 2018).
  6. A. M. Childs, D. Gosset, and Z. Webb, Universal computation by multiparticle quantum walk, Science 339, 791 (2013).
  7. S. E. Venegas-Andraca, Quantum walks: A comprehensive review, Quantum Info. Proc. 11, 1015 (2012).
  8. S. Attal, N. Guillotin-Plantard, and C. Sabot, Central limit theorems for open quantum random walks and quantum measurement records, Ann. Henri Poincaré 16, 15 (2015).
  9. R. Carbone and Y. Pautrat, Open quantum random walks: Reducibility, period, ergodic properties, Ann. Henri Poincaré 17, 99 (2016).
  10. T. A. Brun, H. A. Carteret, and A. Ambainis, Quantum random walks with decoherent coins, Phys. Rev. A 67, 032304 (2003).
  11. J. Emerson, Y. S. Weinstein, M. Saraceno, S. Lloyd, and D. G. Cory, Pseudo-random unitary operators for quantum information processing, Science 302, 2098 (2003).
  12. M. P. A. Fisher, V. Khemani, A. Nahum, and S. Vijay, Random quantum circuits, Annu. Rev. Condens. Matter Phys. 14, 335 (2023).
  13. R. Movassagh and J. Schenker, Theory of ergodic quantum processes, Phys. Rev. X 11, 041001 (2021).
  14. J.-F. Bougron, A. Joye, and C.-A. Pillet, Markovian repeated interaction quantum systems, Rev. Math. Phys. 34, 2250028 (2022).
  15. D. A. Chisholm, G. García-Pérez, M. A. C. Rossi, G. M. Palma, and S. Maniscalco, Stochastic collision model approach to transport phenomena in quantum networks, New J. Phys. 23, 033031 (2021).
  16. F. Ciccarello, S. Lorenzo, V. Giovannetti, and G. Massimo Palma, Quantum collision models: Open system dynamics from repeated interactions, Phys. Rep. 954, 1 (2022).
  17. V. Stanzione, A. Civolani, J. Y. Malo, and M. L. Chiofalo, Tailoring transport in quantum spin chains via disorder and collisions, Phys. Rev. B 112, 224209 (2025).
  18. M. A. Graydon, J. Skanes-Norman, and J. J. Wallman, Designing stochastic channels, arXiv:2201.07156.
  19. M. Štefaňák, V. Potoček, İ. Yalçınkaya, A. Gábris, and I. Jex, Recurrence in discrete-time quantum stochastic walks, Quantum 10, 1982 (2026).
  20. J. D. Whitfield, C. A. Rodríguez-Rosario, and A. Aspuru-Guzik, Quantum stochastic walks: A generalization of classical random walks and quantum walks, Phys. Rev. A 81, 022323 (2010).
  21. A. Ahlbrecht, H. Vogts, A. H. Werner, and R. F. Werner, Asymptotic evolution of quantum walks with random coin, J. Math. Phys. 52, 042201 (2011).
  22. J. Ghosh, Simulating Anderson localization via a quantum walk on a one-dimensional lattice of superconducting qubits, Phys. Rev. A 89, 022309 (2014).
  23. S. Derevyanko, Anderson localization of a one-dimensional quantum walker, Sci. Rep. 8, 1795 (2018).
  24. D. Aharonov, A. Ambainis, J. Kempe, and U. Vazirani, Quantum walks on graphs, in Proceedings of the 33rd Annual ACM Symposium on Theory of Computing, STOC '01 (Association for Computing Machinery, New York, 2001), pp. 50–59.
  25. T. D. Mackay, S. D. Bartlett, L. T. Stephenson, and B. C. Sanders, Quantum walks in higher dimensions, J. Phys. A: Math. Gen. 35, 2745 (2002).
  26. D. Burgarth, G. Chiribella, V. Giovannetti, P. Perinotti, and K. Yuasa, Ergodic and mixing quantum channels in finite dimensions, New J. Phys. 15, 073045 (2013).
  27. N. Shenvi, J. Kempe, and K. Birgitta Whaley, Quantum random-walk search algorithm, Phys. Rev. A 67, 052307 (2003).
  28. A. A. Mele, Introduction to Haar measure tools in quantum information: A beginner's tutorial, Quantum 8, 1340 (2024).
  29. O. L. Acevedo and T. Gobron, Quantum walks on Cayley graphs, J. Phys. A: Math. Gen. 39, 585 (2006).
  30. T. Audrey, Fourier Analysis on Finite Groups and Applications, London Mathematical Society Student Texts (Cambridge University, Cambridge, 1999), Vol. 43.
  31. T. Prosen, Matrix product solutions of boundary driven quantum chains, J. Phys. A: Math. Theor. 48, 373001 (2015).

Outline

Information

Sign In to Your Journals Account

Filter

Filter

Article Lookup

Enter a citation