4 papers · 1 filter
Localization Without Disorder: Quantum Walks on Structured Graphs
Shyam Dhamapurkar, K. Venkata Subrahmanyam
Continuous-time quantum walks (CTQWs) exhibit localization phenomena that differ fundamentally from their classical counterparts, yet the precise relationship between network struc…
Weaving Complex Graph on simple low-dimensional qubit lattices
Yu-Hang Dang, Shyam Dhamapurkar, Xiao-Long Zhu +3
In quantum computing, the connectivity of qubits placed on two-dimensional chips limits the scalability and functionality of solid-state quantum computers. This paper presents two…
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…
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…