Sciweavers

113 search results - page 3 / 23
» Distributed Measurement-based Quantum Computation
Sort
View
CVPR
2007
IEEE
14 years 9 months ago
A Probabilistic Intensity Similarity Measure based on Noise Distributions
We derive a probabilistic similarity measure between two observed image intensities that is based on the noise properties of the camera. In many vision algorithms, the effect of c...
Yasuyuki Matsushita, Stephen Lin
STOC
2002
ACM
130views Algorithms» more  STOC 2002»
14 years 7 months ago
Secure multi-party quantum computation
Secure multi-party computing, also called secure function evaluation, has been extensively studied in classical cryptography. We consider the extension of this task to computation...
Claude Crépeau, Daniel Gottesman, Adam Smit...
STACS
2000
Springer
13 years 11 months ago
Average-Case Quantum Query Complexity
Abstract. We compare classical and quantum query complexities of total Boolean functions. It is known that for worst-case complexity, the gap between quantum and classical can be a...
Andris Ambainis, Ronald de Wolf
EUROCRYPT
2005
Springer
14 years 1 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...
CORR
1999
Springer
138views Education» more  CORR 1999»
13 years 7 months ago
A simple proof of the unconditional security of quantum key distribution
Quantum key distribution is the best known application of quantum cryptography. Previously proposed proofs of security of quantum key distribution contain various technical subtle...
Hoi-Kwong Lo