51 search results - page 7 / 11 » Quantum lower bounds for the Goldreich-Levin problem |
119
click to vote
CORR
2002
Springer
14 years 9 months ago
2002
Springer
Abstract: Although a quantum state requires exponentially many classical bits to describe, the laws of quantum mechanics impose severe restrictions on how that state can be accesse...
STACS
2009
Springer
15 years 4 months ago
2009
Springer
Motivated by the quantum algorithm for testing commutativity of black-box groups (Magniez and Nayak, 2007), we study the following problem: Given a black-box finite ring by an add...
111
click to vote
FCT
2005
Springer
15 years 3 months ago
2005
Springer
We present several results on the complexity of various forms of Sperner’s Lemma in the black-box model of computing. We give a deterministic algorithm for Sperner problems over ...
JC
2007
14 years 9 months ago
2007
We study the complexity of approximating the smallest eigenvalue of −∆ + q with Dirichlet boundary conditions on the d-dimensional unit cube. Here ∆ is the Laplacian, and th...
STOC
2007
ACM
15 years 9 months ago
2007
ACM
We study properties of quantum strategies, which are complete specifications of a given party's actions in any multiple-round interaction involving the exchange of quantum in...