TY - JOUR
T1 - Communication links for distributed quantum computation
AU - Van Meter, Rodney
AU - Nemoto, Kae
AU - Munro, William J.
PY - 2007/12
Y1 - 2007/12
N2 - Distributed quantum computation requires quantum operations that act over a distance on error correction-encoded states of logical qubits, such as the transfer of qubits via teleportation. We evaluate the performance of several quantum error correction codes, and find that teleportation failure rates of one percent or more are tolerable when two levels of the [23,1,7] code are used. We present an analysis of performing quantum error correction (QEC) on QEC-encoded states that span two quantum computers, including the creation of distributed logical zeroes. The transfer of the individual qubits of a logical state may be multiplexed in time or space, moving serially across a single link, or in parallel across multiple links. We show that the performance and reliability penalty for using serial links is small for a broad range of physical parameters, making serial links preferable for a large, distributed quantum multicomputer when engineering difficulties are considered. Such a multicomputer will be able to factor a 1,024-bit number using Shor's algorithm with a high probability of success.
AB - Distributed quantum computation requires quantum operations that act over a distance on error correction-encoded states of logical qubits, such as the transfer of qubits via teleportation. We evaluate the performance of several quantum error correction codes, and find that teleportation failure rates of one percent or more are tolerable when two levels of the [23,1,7] code are used. We present an analysis of performing quantum error correction (QEC) on QEC-encoded states that span two quantum computers, including the creation of distributed logical zeroes. The transfer of the individual qubits of a logical state may be multiplexed in time or space, moving serially across a single link, or in parallel across multiple links. We show that the performance and reliability penalty for using serial links is small for a broad range of physical parameters, making serial links preferable for a large, distributed quantum multicomputer when engineering difficulties are considered. Such a multicomputer will be able to factor a 1,024-bit number using Shor's algorithm with a high probability of success.
KW - Communication/networking and information technology
KW - Computer systems organization
KW - Data communications
KW - Emerging tehnologies
KW - Error-checking
KW - Fault tolerance
KW - Hardware
KW - Interconnection architectures
KW - Interconnections (subsystems)
KW - Multiple data stream architectures (multiprocessors)
KW - Processor architectures
KW - Reliability
KW - Testing
UR - http://www.scopus.com/inward/record.url?scp=36348960296&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=36348960296&partnerID=8YFLogxK
U2 - 10.1109/TC.2007.70775
DO - 10.1109/TC.2007.70775
M3 - Article
AN - SCOPUS:36348960296
VL - 56
SP - 1643
EP - 1653
JO - IEEE Transactions on Computers
JF - IEEE Transactions on Computers
SN - 0018-9340
IS - 12
ER -