Sciweavers

4 search results - page 1 / 1
» Quantum t-designs: t-wise Independence in the Quantum World
Sort
View
COCO
2007
Springer
142views Algorithms» more  COCO 2007»
13 years 11 months ago
Quantum t-designs: t-wise Independence in the Quantum World
A t-design for quantum states is a finite set of quantum states with the property of simulating the Haar-measure on quantum states w.r.t. any test that uses at most t copies of a...
Andris Ambainis, Joseph Emerson
DAGSTUHL
2006
13 years 6 months ago
Using Quantum Oblivious Transfer to Cheat Sensitive Quantum Bit Commitment
It is well known that unconditionally secure bit commitment is impossible even in the quantum world. In this paper a weak variant of quantum bit commitment, introduced independent...
Andreas Jakoby, Maciej Liskiewicz, Aleksander Madr...
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
COCO
2004
Springer
118views Algorithms» more  COCO 2004»
13 years 10 months ago
Towards the Classical Communication Complexity of Entanglement Distillation Protocols with Incomplete Information
Entanglement is an essential resource for quantum communication and quantum computation, similar to shared random bits in the classical world. Entanglement distillation extracts n...
Andris Ambainis, Ke Yang