Szegedy Walk Unitaries for Quantum Maps
Not on the map. Why?
Abstract (arXiv)
Szegedy developed a generic method for quantizing classical algorithms based on random walks [Proceedings of FOCS, 2004, pp. 32-41]. A major contribution of his work was the construction of a walk unitary for any reversible random walk. Such unitary posses two crucial properties: its eigenvector with eigenphase 0 is a quantum sample of the limiting distribution of the random walk and its eigenphase gap is quadratically larger than the spectral gap of the random walk. It was an open question if it is possible to generalize Szegedy's quantization method for stochastic maps to quantum maps. We answer this in the affirmative by presenting an explicit construction of a Szegedy walk unitary for detailed balanced Lindbladians -- generators of quantum Markov semigroups -- and detailed balanced quantum channels. We prove that our Szegedy walk unitary has a purification of the fixed point of the Lindbladian as eigenvector with eigenphase 0 and that its eigenphase gap is quadratically larger than the spectral gap of the Lindbladian. To construct the walk unitary we leverage a canonical form for detailed balanced Lindbladians showing that they are structurally related to Davies generators. We also explain how the quantization method for Lindbladians can be applied to quantum channels. We give an efficient quantum algorithm for quantizing Davies generators that describe many important open-system dynamics, for instance, the relaxation of a quantum system coupled to a bath. Our algorithm extends known techniques for simulating quantum systems on a quantum computer.
Key facts. Cited by 1 paper in the map (data through 14 Oct 2026). First posted on arXiv 15 Jul 2021.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2022: 1.
1 paper.
- 2022Quantum-enhanced Markov chain Monte Carlocited by 6
- 2022Quantum-enhanced Markov chain Monte Carlo23 Mar 2022
Similar, not cited
Close in wording, no citation either way
- 2023Stochastic Quantum Sampling for Non-Logconcave Distributions and Estimating Partition Functions
- 2026Practical advantage beyond the quadratic speedup limit with fully-quantum walks
- 2025Wavefunction Flows: Efficient Quantum Simulation of Continuous Flow Models
- 2021Quantum algorithms for group convolution, cross-correlation, and equivariant transformations
- 2024Even-Cycle Detection in the Randomized and Quantum CONGEST Model ↗
- 2023QonFusion -- Quantum Approaches to Gaussian Random Variables: Applications in Stable Diffusion and Brownian Motion
- 2024Quantum Channel Learning
- 2024Mixed-State Quantum Denoising Diffusion Probabilistic Model