100 citations · 215 across the 14 of their papers we have counts for
4 papers · 2 filters
Quantum walk search algorithms and effective resistance
Stephen Piddock
We consider the problem of finding a marked vertex in a graph from an arbitrary starting distribution, using a quantum walk based algorithm. We work in the framework introduced by…
Oracle complexity classes and local measurements on physical Hamiltonians
Sevag Gharibian, Stephen Piddock, Justin Yirka
The canonical problem for the class Quantum Merlin-Arthur (QMA) is that of estimating ground state energies of local Hamiltonians. Perhaps surprisingly, [Ambainis, CCC 2014] showed…
A Quantum Search Decoder for Natural Language Processing
Johannes Bausch, Sathyawageeswar Subramanian, Stephen Piddock
Probabilistic language models, e.g. those based on an LSTM, often face the problem of finding a high probability prediction from a sequence of random variables over a set of tokens…
Hardness and Ease of Curing the Sign Problem for Two-Local Qubit Hamiltonians
Joel Klassen, Milad Marvian, Stephen Piddock +3
We examine the problem of determining whether a multi-qubit two-local Hamiltonian can be made stoquastic by single-qubit unitary transformations. We prove that when such a Hamilton…