Sciweavers

587 search results - page 56 / 118
» Quantum computation and quantum information
Sort
View
ICALP
2003
Springer
14 years 3 months ago
A Direct Sum Theorem in Communication Complexity via Message Compression
We prove lower bounds for the direct sum problem for two-party bounded error randomised multipleround communication protocols. Our proofs use the notion of information cost of a p...
Rahul Jain, Jaikumar Radhakrishnan, Pranab Sen
PPL
2010
97views more  PPL 2010»
13 years 8 months ago
On the Importance of Being Quantum
Game playing is commonly cited in debates concerning human versus machine intelligence, and Chess is often at the center of such debates. However, the role of Chess in delineating...
Selim G. Akl
FCT
2007
Springer
14 years 1 months ago
Product Rules in Semidefinite Programming
Abstract. In recent years we have witnessed the proliferation of semidefinite programming bounds in combinatorial optimization [1,5,8], quantum computing [9,2,3,6,4,16] and even in...
Rajat Mittal, Mario Szegedy
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
ICIC
2007
Springer
14 years 4 months ago
Quantum Integration Error on Some Classes of Multivariate Functions
Abstract. We study the approximation of the integration of multivariate functions classes in the quantum model of computation. We first obtain a lower bound of the n-th minimal qu...
Peixin Ye, Qing He