44 citations · 44 across the 1 of their papers we have counts for
4 papers
Unstructured Adiabatic Quantum Optimization: Optimality with Limitations
Arthur Braida, Shantanav Chakraborty, Alapan Chaudhuri +4
In the circuit model of quantum computing, amplitude amplification techniques can be used to find solutions to NP-hard problems defined on -bits in time …
Floquet engineering of continuous-time quantum walks: towards the simulation of complex and next-to-nearest neighbor couplings
Leonardo Novo, Sofia Ribeiro
The formalism of continuous-time quantum walks on graphs has been widely used in the study of quantum transport of energy and information, as well as in the development of quantum…
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…
Finding a marked node on any graph by continuous-time quantum walk
Shantanav Chakraborty, Leonardo Novo, Jérémie Roland
Spatial search by discrete-time quantum walk can find a marked node on any ergodic, reversible Markov chain quadratically faster than its classical counterpart, i.e.\ in a time…