20831 search results - page 94 / 4167 » Quantum Computation and Information |
157
Voted
TCS
2002
15 years 5 months ago
2002
We discuss several complexity measures for Boolean functions: certi cate complexity, sensitivity, block sensitivity, and the degree of a representing or approximating polynomial. ...
125
Voted
LOGCOM
2010
15 years 4 months ago
2010
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...
131
click to vote
TAMC
2009
Springer
16 years 2 days ago
2009
Springer
Computability concerns information with a causal – typically algorithmic – structure. As such, it provides a schematic analysis of many naturally occurring situations. We look ...
155
click to vote
QI
2009
Springer
16 years 2 days ago
2009
Springer
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...
140
click to vote
ISITA
2010
15 years 3 months ago
2010
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...