1352 search results - page 145 / 271 » Fault-Tolerant Quantum Computation |
CRYPTO
2009
Springer
14 years 2 months ago
2009
Springer
We consider two-party quantum protocols starting with a transmission of some random BB84 qubits followed by classical messages. We show a general “compiler” improving the secur...
ICS
2010
Tsinghua U.
14 years 4 days 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...
FOCS
2009
IEEE
13 years 12 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 ...
HPDC
2006
IEEE
14 years 2 months ago
2006
IEEE
Desktop grid (DG) systems use the idle computing power of many volunteered desktop PC’s on the Internet to support large-scale computation and storage. For over a decade, DG sys...
COMPUTER
2002
13 years 7 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...