1.2k citations · 3.7k across the 62 of their papers we have counts for
Showing 2003 · quant-phShow all
2 papers · 2 filters
quant-ph2003
Robust Polynomials and Quantum Algorithms
Harry Buhrman, Ilan Newman, Hein Roehrig +1
We define and study the complexity of robust polynomials for Boolean functions and the related fault-tolerant quantum decision trees, where input bits are perturbed by noise. We co…
quant-ph2003★ 48 cited
Multiparty Quantum Coin Flipping
Andris Ambainis, Harry Buhrman, Yevgeniy Dodis +1
We investigate coin-flipping protocols for multiple parties in a quantum broadcast setting: (1) We propose and motivate a definition for quantum broadcast. Our model of quantum bro…