Sciweavers

169 search results - page 5 / 34
» Experimental Quantum Cryptography
Sort
View
EUROCRYPT
2005
Springer
14 years 2 months ago
Computational Indistinguishability Between Quantum States and Its Cryptographic Application
We introduce a computational problem of distinguishing between two specific quantum states as a new cryptographic problem to design a quantum cryptographic scheme that is “secu...
Akinori Kawachi, Takeshi Koshiba, Harumichi Nishim...
STOC
2005
ACM
198views Algorithms» more  STOC 2005»
14 years 9 months ago
On lattices, learning with errors, random linear codes, and cryptography
Our main result is a reduction from worst-case lattice problems such as GAPSVP and SIVP to a certain learning problem. This learning problem is a natural extension of the `learnin...
Oded Regev
ECCC
2006
87views more  ECCC 2006»
13 years 9 months ago
The Learnability of Quantum States
Traditional quantum state tomography requires a number of measurements that grows exponentially with the number of qubits n. But using ideas from computational learning theory, we...
Scott Aaronson
ICC
2007
IEEE
108views Communications» more  ICC 2007»
14 years 3 months ago
Quantum Cryptography For Secure Optical Networks
Dense Wavelength Division Multiplexing optical networks transport a huge aggregate traffic exceeding Tbps per single fiber, and passive optical network technology has been extended...
Stamatios V. Kartalopoulos
STOC
2007
ACM
136views Algorithms» more  STOC 2007»
14 years 9 months ago
Exponential separations for one-way quantum communication complexity, with applications to cryptography
We give an exponential separation between one-way quantum and classical communication protocols for two partial Boolean functions, both of which are variants of the Boolean Hidden...
Dmitry Gavinsky, Julia Kempe, Iordanis Kerenidis, ...