Sciweavers

107 search results - page 2 / 22
» Comparison of two bounds of the quantum correlation set
Sort
View
TCC
2007
Springer
104views Cryptology» more  TCC 2007»
13 years 11 months ago
Unifying Classical and Quantum Key Distillation
Assume that two distant parties, Alice and Bob, as well as an adversary, Eve, have access to (quantum) systems prepared jointly according to a tripartite state ρABE. In addition, ...
Matthias Christandl, Artur Ekert, Michal Horodecki...
STOC
2002
ACM
107views Algorithms» more  STOC 2002»
14 years 5 months ago
Quantum lower bound for the collision problem
The collision problem is to decide whether a function X : {1, . . . , n} {1, . . . , n} is one-to-one or two-to-one, given that one of these is the case. We show a lower bound of...
Scott Aaronson
APPROX
2010
Springer
139views Algorithms» more  APPROX 2010»
13 years 6 months ago
Two-Source Extractors Secure against Quantum Adversaries
We initiate the study of multi-source extractors in the quantum world. In this setting, our goal is to extract random bits from two independent weak random sources, on which two q...
Roy Kasher, Julia Kempe
CORR
2002
Springer
102views Education» more  CORR 2002»
13 years 5 months ago
Quantum Lower Bound for Recursive Fourier Sampling
One of the earliest quantum algorithms was discovered by Bernstein and Vazirani, for a problem called Recursive Fourier Sampling. This paper shows that the Bernstein-Vazirani algo...
Scott Aaronson
CORR
2008
Springer
111views Education» more  CORR 2008»
13 years 5 months ago
New Sequences Design from Weil Representation with Low Two-Dimensional Correlation in Both Time and Phase Shifts
For a given prime p, a new construction of families of the complex valued sequences of period p with efficient implementation is given by applying both multiplicative characters a...
Zilong Wang, Guang Gong