Average mixing in quantum walks of reversible Markov chains
From MaRDI portal
Publication:6635077
DOI10.1016/j.disc.2024.114196MaRDI QIDQ6635077
Publication date: 9 November 2024
Published in: Discrete Mathematics (Search for Journal in Brave)
Markov chains (discrete-time Markov processes on discrete state spaces) (60J10) Stochastic mechanics (including stochastic electrodynamics) (81P20)
Cites Work
- Unnamed Item
- State transfer on graphs
- Approximate counting, uniform generation and rapidly mixing Markov chains
- Discrete-time quantum walks and graph structures
- Average mixing of continuous quantum walks
- Approximating the Permanent
- NON-UNIFORM MIXING OF QUANTUM WALK ON CYCLES
- On the Digraph of a Unitary Matrix
- Average mixing matrix of trees
- Random Walks on Truncated Cubes and Sampling 0-1 Knapsack Solutions
- A very simple algorithm for estimating the number of k‐colorings of a low‐degree graph
- On Markov Chains for Independent Sets
- Quantum walks on graphs
- Pretty good state transfer in discrete-time quantum walks
This page was built for publication: Average mixing in quantum walks of reversible Markov chains