11547 search results - page 3 / 2310 » Quantum computing and communication |
DATE
2004
IEEE
15 years 1 months ago
2004
IEEE
We show how to implement an arbitrary two-qubit unitary operation using any of several quantum gate libraries with small a priori upper bounds on gate counts. In analogy to librar...
72
Voted
IPL
2006
14 years 9 months ago
2006
We investigate the randomized and quantum communication complexity of the HAMMING DISTANCE problem, which is to determine if the Hamming distance between two n-bit strings is no l...
108
Voted
COCO
2005
Springer
15 years 3 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...
79
Voted
ISCA
2006
IEEE
15 years 3 months ago
2006
IEEE
We show that the problem of communication in a quantum computer reduces to constructing reliable quantum channels by distributing high-fidelity EPR pairs. We develop analytical m...
CCR
2004
14 years 9 months ago
2004
A team of researchers from the Massachusetts Institute of Technology (MIT) and Northwestern University (NU) is developing a system for long-distance, high-fidelity qubit teleporta...