Sciweavers

65 search results - page 7 / 13
» Quantum Entanglement and Communication Complexity
Sort
View
WISEC
2010
ACM
13 years 11 months ago
Secret keys from entangled sensor motes: implementation and analysis
Key management in wireless sensor networks does not only face typical, but also several new challenges. The scale, resource limitations, and new threats such as node capture and c...
Matthias Wilhelm, Ivan Martinovic, Jens B. Schmitt
CORR
2010
Springer
225views Education» more  CORR 2010»
13 years 6 months ago
Analysis of the Security of BB84 by Model Checking
Quantum Cryptography or Quantum key distribution (QKD) is a technique that allows the secure distribution of a bit string, used as key in cryptographic protocols. When it was note...
Mohamed Elboukhari, Mostafa Azizi, Abdelmalek Aziz...
LOGCOM
2010
120views more  LOGCOM 2010»
13 years 1 months ago
Paraconsistent Machines and their Relation to Quantum Computing
We describe a method to axiomatize computations in deterministic Turing machines (TMs). When applied to computations in non-deterministic TMs, this method may produce contradictor...
Juan C. Agudelo, Walter Alexandre Carnielli
CORR
2002
Springer
166views Education» more  CORR 2002»
13 years 6 months ago
Quantum Time-Space Tradeoffs for Sorting
Abstract: Although a quantum state requires exponentially many classical bits to describe, the laws of quantum mechanics impose severe restrictions on how that state can be accesse...
Hartmut Klauck
CORR
2010
Springer
147views Education» more  CORR 2010»
13 years 5 months ago
Strong direct product theorems for quantum communication and query complexity
A strong direct product theorem (SDPT) states that solving n instances of a problem requires ˝.n/ times the resources for a single instance, even to achieve success probability 2 ...
Alexander A. Sherstov