Sciweavers

515 search results - page 83 / 103
» Classically-controlled Quantum Computation
Sort
View
ATS
2005
IEEE
164views Hardware» more  ATS 2005»
13 years 11 months ago
A Family of Logical Fault Models for Reversible Circuits
Reversibility is of interest in achieving extremely low power dissipation; it is also an inherent design requirement of quantum computation. Logical fault models for conventional ...
Ilia Polian, Thomas Fiehn, Bernd Becker, John P. H...
DAC
2008
ACM
13 years 11 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 8 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»
14 years 3 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»
14 years 2 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