94 search results - page 2 / 19 » On Classical, Fuzzy Classical, Quantum and Fuzzy Quantum Sys... |
FOCS
2009
IEEE
13 years 11 months ago
2009
IEEE
— We study the complexity of a class of problems involving satisfying constraints which remain the same under translations in one or more spatial directions. In this paper, we sh...
TLCA
2005
Springer
13 years 10 months ago
2005
Springer
The objective of this paper is to develop a functional programming language for quantum computers. We develop a lambda calculus for the classical control model, following the firs...
AIEDAM
2008
13 years 5 months ago
2008
Although it is known that quantum computers can solve certain computational problems exponentially faster than classical computers, only a small number of quantum algorithms have ...
COCO
2005
Springer
13 years 10 months ago
2005
Springer
Refereed games are interactive proof systems with two competing provers: one that tries to convince the verifier to accept and another that tries to convince the verifier to rej...
STOC
2006
ACM
14 years 5 months ago
2006
ACM
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...