53 search results - page 4 / 11 » Distinguishing Short Quantum Computations |
JSSPP
2009
Springer
15 years 4 months ago
2009
Springer
In this paper, we examine the concept of giving every job a trial run before committing it to run until completion. Trial runs allow immediate job failures to be detected shortly a...
COCO
2004
Springer
15 years 3 months ago
2004
Springer
A source is compressible if we can efficiently compute short descriptions of strings in the support and efficiently recover the strings from the descriptions. A source has high ps...
IACR
2011
13 years 9 months ago
2011
The McEliece cryptosystem is one of the few systems to be considered secure against attacks by Quantum computers. The original scheme is built upon Goppa codes and produces very l...
JCC
2007
14 years 9 months ago
2007
: This paper first comments on the surprisingly poor status that Quantum Chemistry has offered to the fantastic intuition of Lewis concerning the distribution of the electrons in ...
FOCS
1991
IEEE
15 years 1 months ago
1991
IEEE
A polygon with two distinguished vertices, s and g, is called a street iff the two boundary chains from s to g are mutually weakly visible. For a mobile robot with on-board vision...