131
click to vote
COCO
15 years 4 months ago
2004 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...
123
Voted
COCO
15 years 6 months ago
2004 Springer
We study the power of quantum proofs, or more precisely, the power of Quantum MerlinArthur (QMA) protocols, in two well studied models of quantum computation: the black box model ...
119
click to vote
COCO
15 years 4 months ago
2004 Springer 
Based on the framework of parameterized complexity theory, we derive tight lower bounds on the computational complexity for a number of well-known NP-hard problems. We start by pr...
116
click to vote
COCO
15 years 4 months ago
2004 Springer 
We initiate the study of the computational complexity of the covering radius problem for point lattices, and approximation versions of the problem for both lattices and linear cod...
112
click to vote
COCO
15 years 6 months ago
2004 Springer 
We prove a very general lower bound technique for quantum and randomized query complexity, that is easy to prove as well as to apply. To achieve this, we introduce the use of Kolm...
|
Algorithms