Sciweavers

1352 search results - page 249 / 271
» Fault-Tolerant Quantum Computation
Sort
View
FCT
2005
Springer
15 years 11 months ago
On the Black-Box Complexity of Sperner's Lemma
We present several results on the complexity of various forms of Sperner’s Lemma in the black-box model of computing. We give a deterministic algorithm for Sperner problems over ...
Katalin Friedl, Gábor Ivanyos, Miklos Santh...
CRYPTO
2011
Springer
179views Cryptology» more  CRYPTO 2011»
14 years 5 months ago
Smaller Decoding Exponents: Ball-Collision Decoding
Very few public-key cryptosystems are known that can encrypt and decrypt in time b2+o(1) with conjectured security level 2b against conventional computers and quantum computers. Th...
Daniel J. Bernstein, Tanja Lange, Christiane Peter...
ISAAC
2009
Springer
98views Algorithms» more  ISAAC 2009»
15 years 12 months ago
On the Tightness of the Buhrman-Cleve-Wigderson Simulation
Abstract. Buhrman, Cleve and Wigderson gave a general communication protocol for block-composed functions f(g1(x1 , y1 ), · · · , gn(xn , yn )) by simulating a decision tree com...
Shengyu Zhang
PPOPP
2005
ACM
15 years 11 months ago
Performance modeling and optimization of parallel out-of-core tensor contractions
The Tensor Contraction Engine (TCE) is a domain-specific compiler for implementing complex tensor contraction expressions arising in quantum chemistry applications modeling elect...
Xiaoyang Gao, Swarup Kumar Sahoo, Chi-Chung Lam, J...
SOFSEM
2005
Springer
15 years 11 months ago
On the Security and Composability of the One Time Pad
Motivated by a potentially flawed deployment of the one time pad in a recent quantum cryptographic application securing a bank transfer [12], we show how to implement a statistica...
Dominik Raub, Rainer Steinwandt, Jörn Mü...