634 citations · 1.8k across the 34 of their papers we have counts for
35 papers
Self-Testing of a Single Quantum System: Theory and Experiment
Xiao-Min Hu, Yi Xie, Atul Singh Arora +13
Certifying individual quantum devices with minimal assumptions is crucial for the development of quantum technologies. Here, we investigate how to leverage single-system contextual…
Quadratic speedup for spatial search by continuous-time quantum walk
Simon Apers, Shantanav Chakraborty, Leonardo Novo +1
Continuous-time quantum walks provide a natural framework to tackle the fundamental problem of finding a node among a set of marked nodes in a graph, known as spatial search. Wheth…
On the optimality of spatial search by continuous-time quantum walk
Shantanav Chakraborty, Leonardo Novo, Jérémie Roland
One of the most important algorithmic applications of quantum walks is to solve spatial search problems. A widely used quantum algorithm for this problem, introduced by Childs and…
How fast do quantum walks mix?
Shantanav Chakraborty, Kyle Luh, Jérémie Roland
The fundamental problem of sampling from the limiting distribution of quantum walks on networks, known as \emph{mixing}, finds widespread applications in several areas of quantum i…
Analytic quantum weak coin flipping protocols with arbitrarily small bias
Atul Singh Arora, Jérémie Roland, Chrysoula Vlachou
Weak coin flipping (WCF) is a fundamental cryptographic primitive for two-party secure computation, where two distrustful parties need to remotely establish a shared random bit whi…
Analog quantum algorithms for the mixing of Markov chains
Shantanav Chakraborty, Kyle Luh, Jérémie Roland
The problem of sampling from the stationary distribution of a Markov chain finds widespread applications in a variety of fields. The time required for a Markov chain to converge to…