Sciweavers

235 search results - page 2 / 47
» Quantum certificate complexity
Sort
View
ALGORITHMICA
2002
121views more  ALGORITHMICA 2002»
13 years 4 months ago
Sharp Quantum versus Classical Query Complexity Separations
We obtain the strongest separation between quantum and classical query complexity known to date--specifically, we define a black-box problem that requires exponentially many querie...
J. Niel de Beaudrap, Richard Cleve, John Watrous
SIAMCOMP
2002
153views more  SIAMCOMP 2002»
13 years 4 months ago
A Decision Procedure for Unitary Linear Quantum Cellular Automata
Linear quantum cellular automata were introduced recently as one of the models of quantum computing. A basic postulate of quantum mechanics imposes a strong constraint on any quan...
Christoph Dürr, Miklos Santha
DAGSTUHL
2006
13 years 6 months ago
Semidefinite programming characterization and spectral adversary method for quantum complexity with noncommuting unitary queries
Generalizing earlier work characterizing the quantum query complexity of computing a function of an unknown classical "black box" function drawn from some set of such bl...
Howard Barnum
SEC
2007
13 years 6 months ago
Ontological Mapping of Common Criteria's Security Assurance Requirements
The Common Criteria (CC) for Information Technology Security Evaluation provides comprehensive guidelines for the evaluation and certification of IT security regarding data securit...
Andreas Ekelhart, Stefan Fenz, Gernot Goluch, Edga...
COCO
2000
Springer
161views Algorithms» more  COCO 2000»
13 years 9 months ago
Characterization of Non-Deterministic Quantum Query and Quantum Communication Complexity
It is known that the classical and quantum query complexities of a total Boolean function f are polynomially related to the degree of its representing polynomial, but the optimal ...
Ronald de Wolf