508 search results - page 76 / 102 » Quantum Computers |
ICALP
2007
Springer
15 years 3 months ago
2007
Springer
This paper studies the gap between classical one-way communication complexity C(f) and its quantum counterpart Q(f), under the unbounded-error setting, i.e., it is enough that the ...
CDC
2009
IEEE
14 years 7 months ago
2009
IEEE
This paper considers the max-min quantum error recovery problem; the recovery channel to be designed maximizes the fidelity between input and output states of a given noisy channel...
IACR
2011
13 years 9 months ago
2011
We give direct constructions of pseudorandom function (PRF) families based on conjectured hard lattice problems and learning problems. Our constructions are asymptotically effici...
104
click to vote
CORR
2012
Springer
13 years 5 months ago
2012
Springer
A sequence fn(q) is q-holonomic if it satisfies a nontrivial linear recurrence with coefficients polynomials in q and qn . Our main theorem states that q-holonomicity is preserve...
RIVF
2007
14 years 11 months ago
2007
— This paper investigates the problem of secret key transmissions for an arbitrary Alice-Bob pair in Quantum Key Distribution (QKD)-based networks. We develop a realistic QKDbase...