Sciweavers

1352 search results - page 251 / 271
» Fault-Tolerant Quantum Computation
Sort
View
DAC
2008
ACM
13 years 9 months ago
Technology exploration for graphene nanoribbon FETs
Graphene nanoribbon FETs (GNRFETs) are promising devices for beyond-CMOS nanoelectronics because of their excellent carrier transport properties and potential for large scale proc...
Mihir R. Choudhury, Youngki Yoon, Jing Guo, Kartik...
TIT
2008
105views more  TIT 2008»
13 years 6 months ago
State Discrimination With Post-Measurement Information
We introduce a new state discrimination problem in which we are given additional information about the state after the measurement, or more generally, after a quantum memory bound ...
Manuel A. Ballester, Stephanie Wehner, Andreas Win...
COCO
2003
Springer
118views Algorithms» more  COCO 2003»
14 years 27 days ago
Lower bounds for predecessor searching in the cell probe model
We consider a fundamental problem in data structures, static predecessor searching: Given a subset S of size n from the universe [m], store S so that queries of the form “What i...
Pranab Sen
IMA
2001
Springer
78views Cryptology» more  IMA 2001»
14 years 3 days ago
Unconditionally Secure Key Agreement Protocol
Abstract. The key agreement protocol are either based on some computational infeasability, such as the calculus of the discrete logarithm in [1], or on theoretical impossibility un...
Cyril Prissette
CORR
2010
Springer
109views Education» more  CORR 2010»
13 years 7 months ago
Optimal Direct Sum Results for Deterministic and Randomized Decision Tree Complexity
A Direct Sum Theorem holds in a model of computation, when for every problem solving some k input instances together is k times as expensive as solving one. We show that Direct Su...
Rahul Jain, Hartmut Klauck, Miklos Santha