Sciweavers

700 search results - page 31 / 140
» An Introduction to Quantum Computing
Sort
View
FOCS
2009
IEEE
13 years 11 months ago
Optimal Quantum Strong Coin Flipping
Coin flipping is a fundamental cryptographic primitive that enables two distrustful and far apart parties to create a uniformly random bit [Blu81]. Quantum information allows for ...
André Chailloux, Iordanis Kerenidis
COMPUTER
2002
79views more  COMPUTER 2002»
13 years 7 months ago
A Practical Architecture for Reliable Quantum Computers
wever, by using a simple model of abstract building blocks: quantum bits, gates, and algorithms, and the available implementation technologies--in all their imperfections.7 The bas...
Mark Oskin, Frederic T. Chong, Isaac L. Chuang
TCC
2004
Springer
147views Cryptology» more  TCC 2004»
14 years 1 months ago
Computational Collapse of Quantum State with Application to Oblivious Transfer
Quantum 2-party cryptography differs from its classical counterpart in at least one important way: Given blak-box access to a perfect commitment scheme there exists a secure 1−2...
Claude Crépeau, Paul Dumais, Dominic Mayers...
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