Sciweavers

109 search results - page 4 / 22
» Interaction in quantum communication and the complexity of s...
Sort
View
COCOON
2005
Springer
14 years 1 months ago
Promised and Distributed Quantum Search
This paper gives a quantum algorithm to search in an set S for a k-tuple satisfying some predefined relation, with the promise that some components of a desired k-tuple are in som...
Shengyu Zhang
CORR
2002
Springer
166views Education» more  CORR 2002»
13 years 7 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
STOC
2007
ACM
136views Algorithms» more  STOC 2007»
14 years 7 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, ...
FC
2005
Springer
142views Cryptology» more  FC 2005»
14 years 1 months ago
Testing Disjointness of Private Datasets
Two parties, say Alice and Bob, possess two sets of elements that belong to a universe of possible values and wish to test whether these sets are disjoint or not. In this paper we ...
Aggelos Kiayias, Antonina Mitrofanova
ACNS
2006
Springer
138views Cryptology» more  ACNS 2006»
13 years 11 months ago
Syntax-Driven Private Evaluation of Quantified Membership Queries
Abstract. Membership queries are basic predicate operations that apply to datasets. Quantifications of such queries express global properties between datasets, including subset inc...
Aggelos Kiayias, Antonina Mitrofanova