TY - JOUR
T1 - Distributed quantum computation architecture using semiconductor nanophotonics
AU - Van Meter, Rodney
AU - Ladd, Thaddeus D.
AU - Fowler, Austin G.
AU - Yamamoto, Yoshihisa
N1 - Funding Information:
This work was supported by National Science Foundation CCF0829694, with partial support by MEXT and NICT. We acknowledge the support of the Australian Research Council, the Australian Government, and the US National Security Agency (NSA) and the Army Research O±ce (ARO) under contract number W911NF-08-1-0527. The authors thank Shinichi Koseki for fabricating and photographing the test structure and Shota Nagayama for help with the ¯gures. We thank Jim Harrington, Robert Raussendorf, Ray Beausoliel, Kae Nemoto, Bill Munro, and the QIS groups at HP Labs and NII, for many useful technical discussions. We would also like to thank Skype, Ltd. for providing the classical networking software that enabled the tri-continental writing of this manuscript.
PY - 2010
Y1 - 2010
N2 - In a large-scale quantum computer, the cost of communications will dominate the performance and resource requirements, place many severe demands on the technology, and constrain the architecture. Unfortunately, fault-tolerant computers based entirely on photons with probabilistic gates, though equipped with "built-in" communication, have very large resource overheads; likewise, computers with reliable probabilistic gates between photons or quantum memories may lack sufficient communication resources in the presence of realistic optical losses. Here, we consider a compromise architecture, in which semiconductor spin qubits are coupled by bright laser pulses through nanophotonic waveguides and cavities using a combination of frequent probabilistic and sparse determinstic entanglement mechanisms. The large photonic resource requirements incurred by the use of probabilistic gates for quantum communication are mitigated in part by the potential high-speed operation of the semiconductor nanophotonic hardware. The system employs topological cluster-state quantum error correction for achieving fault-tolerance. Our results suggest that such an architecture/technology combination has the potential to scale to a system capable of attacking classically intractable computational problems.
AB - In a large-scale quantum computer, the cost of communications will dominate the performance and resource requirements, place many severe demands on the technology, and constrain the architecture. Unfortunately, fault-tolerant computers based entirely on photons with probabilistic gates, though equipped with "built-in" communication, have very large resource overheads; likewise, computers with reliable probabilistic gates between photons or quantum memories may lack sufficient communication resources in the presence of realistic optical losses. Here, we consider a compromise architecture, in which semiconductor spin qubits are coupled by bright laser pulses through nanophotonic waveguides and cavities using a combination of frequent probabilistic and sparse determinstic entanglement mechanisms. The large photonic resource requirements incurred by the use of probabilistic gates for quantum communication are mitigated in part by the potential high-speed operation of the semiconductor nanophotonic hardware. The system employs topological cluster-state quantum error correction for achieving fault-tolerance. Our results suggest that such an architecture/technology combination has the potential to scale to a system capable of attacking classically intractable computational problems.
KW - Distributed quantum computation
KW - Nanophotonics
KW - Quantum multicomputer
KW - Topological fault tolerance
UR - http://www.scopus.com/inward/record.url?scp=77952249352&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=77952249352&partnerID=8YFLogxK
U2 - 10.1142/S0219749910006435
DO - 10.1142/S0219749910006435
M3 - Article
AN - SCOPUS:77952249352
SN - 0219-7499
VL - 8
SP - 295
EP - 323
JO - International Journal of Quantum Information
JF - International Journal of Quantum Information
IS - 1-2
ER -