Matches in SemOpenAlex for { <https://semopenalex.org/work/W1481496916> ?p ?o ?g. }
Showing items 1 to 63 of
63
with 100 items per page.
- W1481496916 abstract "In a breakthrough result, Razborov (2003) gave optimal lower bounds on the communication complexity of every function f of the form f(x,y)=D(|x AND y|) for some D:{0,1,...,n}->{0,1}, in the bounded-error quantum model with and without prior entanglement. This was proved by the multidimensional discrepancy method. We give an entirely different proof of Razborov's result, using the original, one-dimensional discrepancy method. This refutes the commonly held intuition (Razborov 2003) that the original discrepancy method fails for functions such as DISJOINTNESS. More importantly, our communication lower bounds hold for a much broader class of functions for which no methods were available. Namely, fix an arbitrary function f:{0,1}n/4->{0,1} and let A be the Boolean matrix whose columns are each an application of f to some subset of the variables x1,x2,...,xn. We prove that the communication complexity of A in the bounded-error quantum model with and without prior entanglement is Omega(d), where d is the approximate degree of f. From this result, Razborov's lower bounds follow easily. Our result also establishes a large new class of total Boolean functions whose quantum communication complexity (regardless of prior entanglement) is at best polynomially smaller than their classical complexity. Our proof method is a novel combination of two ingredients. The first is a certain equivalence of approximation and orthogonality in Euclidean n-space, which follows by linear-programming duality. The second is a new construction of suitably structured matrices with low spectral norm, the pattern matrices, which we realize using matrix analysis and the Fourier transform over (Z2)n. The method of this paper has recently inspired important progress in multiparty communication complexity." @default.
- W1481496916 created "2016-06-24" @default.
- W1481496916 creator A5079755716 @default.
- W1481496916 date "2007-01-01" @default.
- W1481496916 modified "2023-09-28" @default.
- W1481496916 title "The Pattern Matrix Method for Lower Bounds on Quantum Communication." @default.
- W1481496916 hasPublicationYear "2007" @default.
- W1481496916 type Work @default.
- W1481496916 sameAs 1481496916 @default.
- W1481496916 citedByCount "8" @default.
- W1481496916 countsByYear W14814969162015 @default.
- W1481496916 crossrefType "journal-article" @default.
- W1481496916 hasAuthorship W1481496916A5079755716 @default.
- W1481496916 hasConcept C114614502 @default.
- W1481496916 hasConcept C118615104 @default.
- W1481496916 hasConcept C121040770 @default.
- W1481496916 hasConcept C121332964 @default.
- W1481496916 hasConcept C134306372 @default.
- W1481496916 hasConcept C179145077 @default.
- W1481496916 hasConcept C187455244 @default.
- W1481496916 hasConcept C33923547 @default.
- W1481496916 hasConcept C34388435 @default.
- W1481496916 hasConcept C62520636 @default.
- W1481496916 hasConcept C84114770 @default.
- W1481496916 hasConceptScore W1481496916C114614502 @default.
- W1481496916 hasConceptScore W1481496916C118615104 @default.
- W1481496916 hasConceptScore W1481496916C121040770 @default.
- W1481496916 hasConceptScore W1481496916C121332964 @default.
- W1481496916 hasConceptScore W1481496916C134306372 @default.
- W1481496916 hasConceptScore W1481496916C179145077 @default.
- W1481496916 hasConceptScore W1481496916C187455244 @default.
- W1481496916 hasConceptScore W1481496916C33923547 @default.
- W1481496916 hasConceptScore W1481496916C34388435 @default.
- W1481496916 hasConceptScore W1481496916C62520636 @default.
- W1481496916 hasConceptScore W1481496916C84114770 @default.
- W1481496916 hasLocation W14814969161 @default.
- W1481496916 hasOpenAccess W1481496916 @default.
- W1481496916 hasPrimaryLocation W14814969161 @default.
- W1481496916 hasRelatedWork W1844039599 @default.
- W1481496916 hasRelatedWork W1980223785 @default.
- W1481496916 hasRelatedWork W1985293484 @default.
- W1481496916 hasRelatedWork W2032758195 @default.
- W1481496916 hasRelatedWork W2053590396 @default.
- W1481496916 hasRelatedWork W2093469244 @default.
- W1481496916 hasRelatedWork W2106343361 @default.
- W1481496916 hasRelatedWork W2114477570 @default.
- W1481496916 hasRelatedWork W2122780600 @default.
- W1481496916 hasRelatedWork W2129275337 @default.
- W1481496916 hasRelatedWork W2145266030 @default.
- W1481496916 hasRelatedWork W2153641021 @default.
- W1481496916 hasRelatedWork W2295580398 @default.
- W1481496916 hasRelatedWork W2340787257 @default.
- W1481496916 hasRelatedWork W2405936819 @default.
- W1481496916 hasRelatedWork W2553219432 @default.
- W1481496916 hasRelatedWork W2553481176 @default.
- W1481496916 hasRelatedWork W2884970704 @default.
- W1481496916 hasRelatedWork W2918185090 @default.
- W1481496916 hasRelatedWork W2949214562 @default.
- W1481496916 hasVolume "14" @default.
- W1481496916 isParatext "false" @default.
- W1481496916 isRetracted "false" @default.
- W1481496916 magId "1481496916" @default.
- W1481496916 workType "article" @default.