Sciweavers

508 search results - page 30 / 102
» Quantum Computers
Sort
View
FOCS
2009
IEEE
15 years 3 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
COCO
2005
Springer
110views Algorithms» more  COCO 2005»
15 years 5 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
PROCEDIA
2010
97views more  PROCEDIA 2010»
14 years 10 months ago
Ontological musings on how nature computes
Modern physical theory and modern computational techniques are used to provide conjecture on how nature computes. I utilize time-domain simulation of physical phenomena and build ...
J. F. Nystrom
STOC
2007
ACM
101views Algorithms» more  STOC 2007»
16 years 3 days ago
Toward a general theory of quantum games
We study properties of quantum strategies, which are complete specifications of a given party's actions in any multiple-round interaction involving the exchange of quantum in...
Gus Gutoski, John Watrous
IPL
2000
74views more  IPL 2000»
14 years 11 months ago
A new universal and fault-tolerant quantum basis
A novel universal and fault-tolerant basis (set of gates) for quantum computation is described. Such a set is necessary to perform quantum computation in a realistic noisy environ...
P. Oscar Boykin, Tal Mor, Matthew Pulver, Vwani P....