2 citations · 3 across the 5 of their papers we have counts for
Showing 2023Show all
3 papers · 1 filter
quant-ph2023
Quantum walks advantage on the dihedral group for uniform sampling problem
Shyam Dhamapurkar, Yuhang Dang, Saniya Wagh +1
Random walk algorithms are crucial for sampling and approximation problems in statistical physics and theoretical computer science. The mixing property is necessary for Markov chai…
quant-ph2023★ 1 cited
Quantum walk mixing is faster than classical on periodic lattices
Shyam Dhamapurkar, Xiu-Hao Deng
This work focuses on the quantum mixing time, which is crucial for efficient quantum sampling and algorithm performance. We extend Richter's previous analysis of continuous time qu…
quant-ph2023★ 2 cited
Quantum walks as thermalizations, with application to fullerene graphs
Shyam Dhamapurkar, Oscar Dahlsten
We consider to what extent quantum walks can constitute models of thermalization, analogously to how classical random walks can be models for classical thermalization. In a quantum…