Sciweavers

20831 search results - page 94 / 4167
» Quantum Computation and Information
Sort
View
TCS
2002
13 years 8 months ago
Complexity measures and decision tree complexity: a survey
We discuss several complexity measures for Boolean functions: certi cate complexity, sensitivity, block sensitivity, and the degree of a representing or approximating polynomial. ...
Harry Buhrman, Ronald de Wolf
LOGCOM
2010
85views more  LOGCOM 2010»
13 years 7 months ago
The Logic of Quasi-MV Algebras
The algebraic theory of quasi-MV algebras, generalisations of MV algebras arising in quantum computation, is by now rather well-developed. Although it is possible to define sever...
Félix Bou, Francesco Paoli, Antonio Ledda, ...
TAMC
2009
Springer
14 years 3 months ago
The Extended Turing Model as Contextual Tool
Computability concerns information with a causal – typically algorithmic – structure. As such, it provides a schematic analysis of many naturally occurring situations. We look ...
S. Barry Cooper
QI
2009
Springer
190views Physics» more  QI 2009»
14 years 3 months ago
Characterizing Pure High-Order Entanglements in Lexical Semantic Spaces via Information Geometry
An emerging topic in Quantuam Interaction is the use of lexical semantic spaces, as Hilbert spaces, to capture the meaning of words. There has been some initial evidence that the p...
Yuexian Hou, Dawei Song
ISITA
2010
13 years 6 months ago
Information reconciliation for QKD with rate-compatible non-binary LDPC codes
We study information reconciliation (IR) scheme for the quantum key distribution (QKD) protocols. The IR for the QKD can be considered as the asymmetric Slepian-Wolf problem, which...
Kenta Kasai, Ryutaroh Matsumoto, Kohichi Sakaniwa