56 citations · 167 across the 10 of their papers we have counts for
Showing 2002 · quant-phShow all
3 papers · 2 filters
quant-ph2002
Quantum Zero-Error Algorithms Cannot be Composed
Harry Buhrman, Ronald de Wolf
We exhibit two black-box problems, both of which have an efficient quantum algorithm with zero-error, yet whose composition does not have an efficient quantum algorithm with zero-e…
quant-ph2002★ 40 cited
Combinatorics and Quantum Nonlocality
Harry Buhrman, Peter Hoyer, Serge Massar +1
We use techniques for lower bounds on communication to derive necessary conditions (in terms of detector efficiency or amount of super-luminal communication) for being able to repr…
quant-ph2002
Quantum Property Testing
H. Buhrman, L. Fortnow, I. Newman +1
A language L has a property tester if there exists a probabilistic algorithm that given an input x only asks a small number of bits of x and distinguishes the cases as to whether x…