activity
20052013
most citedA limit on nonlocality in any world in which communication complexity is not trivial

409 citations · 547 across the 9 of their papers we have counts for

collaborators

10 papers

quant-ph2013

Noisy Interactive Quantum Communication

Gilles Brassard, Ashwin Nayak, Alain Tapp +2

We study the problem of simulating protocols in a quantum communication setting over noisy channels. This problem falls at the intersection of quantum information theory and quantu…

quant-ph2012★ 15 cited

Classical command of quantum systems via rigidity of CHSH games

Ben W. Reichardt, Falk Unger, Umesh Vazirani

Can a classical system command a general adversarial quantum system to realize arbitrary quantum dynamics? If so, then we could realize the dream of device-independent quantum cryp…

quant-ph2012★ 26 cited

A classical leash for a quantum system: Command of quantum systems via rigidity of CHSH games

Ben W. Reichardt, Falk Unger, Umesh Vazirani

Can a classical system command a general adversarial quantum system to realize arbitrary quantum dynamics? If so, then we could realize the dream of device-independent quantum cryp…

math.PR2009★ 6 cited

Stability of a spatial polling system with greedy myopic service

Lasse Leskelä, Falk Unger

This paper studies a spatial queueing system on a circle, polled at random locations by a myopic server that can only observe customers in a bounded neighborhood. The server operat…

quant-ph2008

Upper Bounds on the Noise Threshold for Fault-tolerant Quantum Computing

Julia Kempe, Oded Regev, Falk Unger +1

We prove new upper bounds on the tolerable level of noise in a quantum circuit. We consider circuits consisting of unitary k-qubit gates each of whose input wires is subject to dep…

cs.IT2007

Noise threshold for universality of 2-input gates

Falk Unger

Evans and Pippenger showed in 1998 that noisy gates with 2 inputs are universal for arbitrary computation (i.e. can compute any function with bounded error), if all gates fail inde…