The Quantum Communication Complexity of Sampling

14 years 4 months ago

Sampling is an important primitive in probabilistic and quantum algorithms. In the spirit of communication complexity, given a function f : X

Andris Ambainis, Leonard J. Schulman, Amnon Ta-Shm

Communication Complexity | FOCS 1998 | Quantum | Quantum Algorithms | Theoretical Computer Science |

claim paper

Added	04 Aug 2010
Updated	04 Aug 2010
Type	Conference
Year	1998
Where	FOCS
Authors	Andris Ambainis, Leonard J. Schulman, Amnon Ta-Shma, Umesh V. Vazirani, Avi Wigderson

Comments (0)