3 citations · 3 across the 1 of their papers we have counts for
Showing quant-phShow all
2 papers · 1 filter
quant-ph2013★ 5 cited
A Time-Efficient Quantum Walk for 3-Distinctness Using Nested Updates
Andrew M. Childs, Stacey Jeffery, Robin Kothari +1
We present an extension to the quantum walk search framework that facilitates quantum walks with nested updates. We apply it to give a quantum walk algorithm for 3-Distinctness wit…
quant-ph2010★ 3 cited
Quantum query complexity of minor-closed graph properties
Andrew M. Childs, Robin Kothari
We study the quantum query complexity of minor-closed graph properties, which include such problems as determining whether an -vertex graph is planar, is a forest, or does not c…