2 citations · 3 across the 5 of their papers we have counts for
7 papers
Optimal compression with quantum retrieval
Shyam Dhamapurkar, Mohit Garg, Manaswi Paraashar +1
We consider the following data compression problem. Given a string of Hamming weight at most , compress it into a shorter string so that any…
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…
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…
Set membership with two classical and quantum bit probes
Shyam Dhamapurkar, Shubham Vivek Pawar, Jaikumar Radhakrishnan
We consider the following problem: Given a set S of at most n elements from a universe of size m, represent it in memory as a bit string so that membership queries of the form "Is…