Sciweavers

235 search results - page 5 / 47
» Quantum certificate complexity
Sort
View
COCO
1998
Springer
109views Algorithms» more  COCO 1998»
13 years 12 months ago
Complexity Limitations on Quantum Computation
We use the powerful tools of counting complexity and generic oracles to help understand the limitations of the complexity of quantum computation. We show several results for the p...
Lance Fortnow, John D. Rogers
CORR
2010
Springer
108views Education» more  CORR 2010»
13 years 7 months ago
Inverting a permutation is as hard as unordered search
We describe a reduction from the problem of unordered search (with a unique solution) to the problem of inverting a permutation. Since there is a straightforward reduction in the ...
Ashwin Nayak
STOC
2006
ACM
141views Algorithms» more  STOC 2006»
14 years 8 months ago
Zero-knowledge against quantum attacks
It is proved that several interactive proof systems are zero-knowledge against general quantum attacks. This includes the Goldreich?Micali?Wigderson classical zero-knowledge proto...
John Watrous
ECBS
2009
IEEE
114views Hardware» more  ECBS 2009»
13 years 11 months ago
Model-Based Product-Oriented Certification
Future space missions such as the Mars Science Laboratory and Project Constellation suggest the engineering of some of the most complex man-rated software systems. The present pro...
Damian Dechev, Bjarne Stroustrup
IPL
2006
104views more  IPL 2006»
13 years 7 months ago
The communication complexity of the Hamming distance problem
We investigate the randomized and quantum communication complexity of the HAMMING DISTANCE problem, which is to determine if the Hamming distance between two n-bit strings is no l...
Wei Huang, Yaoyun Shi, Shengyu Zhang, Yufan Zhu