25 citations · 92 across the 16 of their papers we have counts for
3 papers · 2 filters
Quantum algorithms and the power of forgetting
Andrew M. Childs, Matthew Coudron, Amin Shiraz Gilani
The so-called welded tree problem provides an example of a black-box problem that can be solved exponentially faster by a quantum walk than by any classical algorithm. Given the na…
Quantum Depth in the Random Oracle Model
Atul Singh Arora, Andrea Coladangelo, Matthew Coudron +3
We give a comprehensive characterization of the computational power of shallow quantum circuits combined with classical computation. Specifically, for classes of search problems, w…
Approximating Output Probabilities of Shallow Quantum Circuits which are Geometrically-local in any Fixed Dimension
Suchetan Dontha, Shi Jie Samuel Tan, Stephen Smith +2
We present a classical algorithm that, for any -dimensional geometrically-local, quantum circuit of polylogarithmic-depth, and any bit string , can compute th…