508 search results - page 75 / 102 » Quantum Computers |
FOCS
2000
IEEE
15 years 2 months ago
2000
IEEE
Shannon [Sha48, Sha49] in celebrated works had shown that n bits of shared key is necessary and sufficient to transmit n-bit classical information in an information-theoretically ...
FOCS
2003
IEEE
15 years 3 months ago
2003
IEEE
: Can Grover’s algorithm speed up search of a physical region—for example a 2-D grid of size √ n × √ n? The problem is that √ n time seems to be needed for each query, j...
UC
2005
Springer
15 years 3 months ago
2005
Springer
Consider a database most of whose entries are marked but the precise fraction of marked entries is not known. What is known is that the fraction of marked entries is 1 − , where ...
IACR
2011
13 years 9 months ago
2011
We present new candidates for quantum-resistant public-key cryptosystems based on the conjectured difficulty of finding isogenies between supersingular elliptic curves. The main t...
DAC
2004
ACM
15 years 10 months ago
2004
ACM
This paper presents the Quantum-Dot Cellular Automata (QCA) physical design problem, in the context of the VLSI physical design problem. The problem is divided into three subprobl...