Strong Direct Product Theorems for Quantum Communication and Query Complexity

A strong direct product theorem (SDPT) states that solving $n$ instances of a problem requires $\Omega(n)$ times the resources for a single instance, even to achieve success probability $2^{-\epsilon n}$ for a small enough constant $\epsilon>0.$ We prove that quantum communication complexity obey...

Full description

Bibliographic Details

Published in:	SIAM journal on computing Vol. 41; no. 5; pp. 1122 - 1165
Main Author:	Sherstov, Alexander A.
Format:	Journal Article
Language:	English
Published:	Philadelphia Society for Industrial and Applied Mathematics 01.01.2012
Subjects:	Communication Complexity Computation Computer science Lower bounds Probability Query processing Success Theorems
ISSN:	0097-5397, 1095-7111
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!