Sciweavers

7486 search results - page 142 / 1498
» The Limits of Quantum Computers
Sort
View
TIT
1998
127views more  TIT 1998»
15 years 5 months ago
The Art of Signaling: Fifty Years of Coding Theory
—In 1948 Shannon developed fundamental limits on the efficiency of communication over noisy channels. The coding theorem asserts that there are block codes with code rates arbit...
A. Robert Calderbank
TIT
2008
105views more  TIT 2008»
15 years 4 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...
EH
2005
IEEE
119views Hardware» more  EH 2005»
15 years 11 months ago
Survivability of Embryonic Memories: Analysis and Design Principles
This paper proposes an original approach to the reliability analysis for Embryonics [4], by introducing the accuracy threshold measure, borrowed from fault-tolerant quantum comput...
Lucian Prodan, Mihai Udrescu, Mircea Vladutiu
COCO
2003
Springer
118views Algorithms» more  COCO 2003»
15 years 11 months 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»
15 years 10 months 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