Sciweavers

34 search results - page 3 / 7
» Quantum vs. Classical Communication and Computation
Sort
View
EUROCRYPT
2000
Springer
13 years 11 months ago
Perfectly Concealing Quantum Bit Commitment from any Quantum One-Way Permutation
We show that although unconditionally secure quantum bit commitment is impossible, it can be based upon any family of quantum one-way permutations. The resulting scheme is uncondit...
Paul Dumais, Dominic Mayers, Louis Salvail
COCO
2004
Springer
118views Algorithms» more  COCO 2004»
14 years 25 days 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
ISCA
2003
IEEE
114views Hardware» more  ISCA 2003»
14 years 22 days ago
Building Quantum Wires: The Long and the Short of It
As quantum computing moves closer to reality the need for basic architectural studies becomes more pressing. Quantum wires, which transport quantum data, will be a fundamental com...
Mark Oskin, Frederic T. Chong, Isaac L. Chuang, Jo...
ASPLOS
2006
ACM
14 years 1 months ago
A program transformation and architecture support for quantum uncomputation
  Quantum  computing’s  power  comes  from  new  algorithms  that exploit quantum mechanical phenomena for computation. Quantum algorithms  are  different  from...
Ethan Schuchman, T. N. Vijaykumar
COCO
2005
Springer
110views Algorithms» more  COCO 2005»
14 years 1 months ago
Prior Entanglement, Message Compression and Privacy in Quantum Communication
Consider a two-party quantum communication protocol for computing some function f : {0, 1}n × {0, 1}n → Z. We show that the first message of P can be compressed to O(k) classi...
Rahul Jain, Jaikumar Radhakrishnan, Pranab Sen