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...

Celý popis

Podrobná bibliografia

Vydané v:	SIAM journal on computing Ročník 41; číslo 5; s. 1122 - 1165
Hlavný autor:	Sherstov, Alexander A.
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Philadelphia Society for Industrial and Applied Mathematics 01.01.2012
Predmet:	Communication Complexity Computation Computer science Lower bounds Probability Query processing Success Theorems
ISSN:	0097-5397, 1095-7111
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!