508 search results - page 28 / 102 » Poly-locality in quantum computing |
157
click to vote
ICS
2010
Tsinghua U.
15 years 10 months ago
2010
Tsinghua U.
Quantum k-SAT is the problem of deciding whether there is a n-qubit state which is perpendicular to a set of vectors, each of which lies in the Hilbert space of k qubits. Equivale...
156
click to vote
FOCS
2009
IEEE
15 years 9 months ago
2009
IEEE
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 ...
155
click to vote
COMPUTER
2002
15 years 5 months ago
2002
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...
172
click to vote
TCC
2004
Springer
15 years 11 months ago
2004
Springer
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...
196
click to vote
COCO
2005
Springer
15 years 11 months ago
2005
Springer
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...