Sciweavers

121 search results - page 24 / 25
» The complexity of the Quantum Adiabatic Algorithm
Sort
View
CN
2010
120views more  CN 2010»
13 years 10 months ago
A survey on bio-inspired networking
The developments in the communication and networking technologies have yielded many existing and envisioned information network architectures such as cognitive radio networks, sen...
Falko Dressler, Özgür B. Akan
ICDT
2007
ACM
126views Database» more  ICDT 2007»
14 years 3 months ago
Combining Incompleteness and Ranking in Tree Queries
Abstract. In many cases, users may want to consider incomplete answers to their queries. Often, however, there is an overwhelming number of such answers, even if subsumed answers a...
Benny Kimelfeld, Yehoshua Sagiv
COCO
2008
Springer
97views Algorithms» more  COCO 2008»
13 years 11 months ago
Generalized Tsirelson Inequalities, Commuting-Operator Provers, and Multi-prover Interactive Proof Systems
A central question in quantum information theory and computational complexity is how powerful nonlocal strategies are in cooperative games with imperfect information, such as mult...
Tsuyoshi Ito, Hirotada Kobayashi, Daniel Preda, Xi...
ECCC
2007
123views more  ECCC 2007»
13 years 9 months ago
Lossy Trapdoor Functions and Their Applications
We propose a general cryptographic primitive called lossy trapdoor functions (lossy TDFs), and use it to develop new approaches for constructing several important cryptographic to...
Chris Peikert, Brent Waters
ISITA
2010
13 years 7 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