| | This Article | |
| |
| |
| | Share | |
| |
| |
| | Bibliographic References | |
| |
| |
| | Add to: | |
| |
 Digg
 Furl
 Spurl
 Blink
 Simpy
 Google
 Del.icio.us
 Y!MyWeb
| |
| | Search | |
| |
| |
| | |
Communication Links for Distributed Quantum Computation
December 2007 (vol. 56 no. 12)
pp. 1643-1653
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.
[1] R.D. Van Meter III, “Architecture of a Quantum Multicomputer Optimized for Shor's Factoring Algorithm,” PhD dissertation, Keio Univ., 2006.
[2] R. Van Meter, K. Nemoto, and W.J. Munro, “Serial Links for Distributed Quantum Computation,” Proc. Eighth Int'l Conf. Quantum Comm., Measurement and Computing, 2007.
[3] L.K. Grover, “Quantum Telecomputation,” http://arXiv.org/quant-ph9704012, Apr. 1997.
[4] R. Cleve and H. Buhrman, “Substituting Quantum Entanglement for Communication,” Physical Rev. A, vol. 56, no. 2, pp. 1201-1204, 1997.
[5] J.I. Cirac, A. Ekert, S.F. Huelga, and C. Macchiavello, “Distributed Quantum Computation over Noisy Channels,” Physical Rev. A, vol. 59, p. 4249, 1999.
[6] E. D'Hondt, “Distributed Quantum Computation: A Measurement-Based Approach,” PhD dissertation, Vrije Universiteit, Brussel, July 2005.
[7] D.K.L. Oi, S.J. Devitt, and L.C.L. Hollenberg, “Scalable Error Correction in Distributed Ion Trap Computers,” Physical Rev. A, vol. 74, p. 052313, 2006.
[8] A.M. Steane and D.M. Lucas, “Quantum Computing with Trapped Ions, Atoms, and Light,” Fortschritte der Physik, http://arXiv.org/quant-ph0004053, Apr. 2000.
[9] R. Van Meter and M. Oskin, “Architectural Implications of Quantum Computing Technologies,” ACM J. Emerging Technologies in Computing Systems, vol. 2, no. 1, pp. 31-63, Jan. 2006.
[10] R. Van Meter, W.J. Munro, K. Nemoto, and K.M. Itoh, “Distributed Arithmetic on a Quantum Multicomputer,” Computer Architecture News, Proc. 33rd Ann. Int'l Symp. Computer Architecture, pp. 354-365, June 2006.
[11] C. Elliott, D. Pearson, and G. Troxel, “Quantum Cryptography in Practice,” Proc. SIGCOMM '03, Aug. 2003.
[12] D. Felinto, C.W. Chou, J. Laurat, H. Schomburg, E.W. de Riedmatten, and H.J. Kimble, “Conditional Control of the Quantum States of Remote Atomic Memories for Quantum Networking,” Nature Physics, 2006.
[13] M.A. Nielsen and I.L. Chuang, Quantum Computation and Quantum Information. Cambridge Univ. Press, 2000.
[14] T.P. Spiller, W.J. Munro, S.D. Barrett, and P. Kok, “An Introduction to Quantum Information Processing: Applications and Realisations,” Contemporary Physics, vol. 46, p. 406, 2005.
[15] P.W. Shor, “Algorithms for Quantum Computation: Discrete Logarithms and Factoring,” Proc. 35th Symp. Foundations of Computer Science, pp. 124-134, 1994.
[16] L. Grover, “A Fast Quantum-Mechanical Algorithm for Database Search,” Proc. 28th Ann. ACM Symp. Theory of Computation, pp.212-219, http://arXiv.org/quant-ph9605043, 1996.
[17] D. Deutsch and R. Jozsa, “Rapid Solution of Problems by Quantum Computation,” Proc. Royal Soc. of London, Series A, vol. 439, p. 553, 1992.
[18] I.L. Chuang, L.M.K. Vandersypen, X. Zhou, D.W. Leung, and S. Lloyd, “Experimental Realization of a Quantum Algorithm,” Nature, vol. 393, pp. 143-146, 1998.
[19] I.L. Chuang, N. Gershenfeld, and M. Kubinec, “Experimental Implementation of Fast Quantum Searching,” Physical Rev. Letters, vol. 80, pp. 2408-3411, 1998.
[20] L.M.K. Vandersypen, M. Steffen, G. Breyta, C.S. Yannoni, M.H. Sherwood, and I.L. Chuang, “Experimental Realization of Shor's Quantum Factoring Algorithm Using Nuclear Magnetic Resonance,” Nature, vol. 414, pp. 883-887, Dec. 2001.
[21] C.H. Bennett, G. Brassard, C. Crépeau, R. Josza, A. Peres, and W. Wootters, “Teleporting an Unknown Quantum State via Dual Classical and EPR Channels,” Physical Rev. Letters, vol. 70, pp.1895-1899, 1993.
[22] A. Furusawa, J.L. Sørensen, S.L. Braunstein, C.A. Fuchs, H.J. Kimble, and E.S. Polzik, “Unconditional Quantum Teleportation,” Science, vol. 282, no. 5389, pp. 706-709, 1998.
[23] P.W. Shor, “Fault-Tolerant Quantum Computation,” Proc. 37th Symp. Foundations of Computer Science, pp. 56-65, 1996.
[24] A. Steane, “Error Correcting Codes in Quantum Theory,” Physical Rev. Letters, vol. 77, pp. 793-797, 1996.
[25] A.R. Calderbank and P.W. Shor, “Good Quantum Error-Correcting Codes Exist,” Physical Rev. A, vol. 54, pp. 1098-1105, 1996.
[26] C.H. Bennett, D.P. DiVincenzo, J.A. Smolin, and W.K. Wootters, “Mixed-State Entanglement and Quantum Error Correction,” Physical Rev. A, vol. 54, pp. 3824-3851, 1996.
[27] R. Laflamme, C. Miquel, J.P. Paz, and W.H. Zurek, “Perfect Quantum Error Correcting Code,” Physical Rev. Letters, vol. 77, pp.198-201, 1996.
[28] A.M. Steane, “Overhead and Noise Threshold of Fault-Tolerant Quantum Error Correction,” Physical Rev. A, vol. 68, p. 042322, 2003.
[29] D.J.C. MacKay, G. Mitchison, and P.L. McFadden, “Sparse-Graph Codes for Quantum Error Correction,” IEEE Trans. Information Theory, vol. 50, no. 10, p. 2315, 2004.
[30] T. Brun, I. Devetak, and M.-H. Hsieh, “Correcting Quantum Errors with Entanglement,” Science, vol. 314, no. 5798, pp. 436-439, 2006.
[31] R. Jozsa and N. Linden, “On the Role of Entanglement in Quantum Computational Speedup,” Proc. Royal Soc. of London A, vol. 459, pp. 2011-2032, http://arXiv.org/quant-ph0201143, 2003.
[32] P.J. Love and B.M. Boghosian, “Type II Quantum Algorithms,” Physica A: Statistical Mechanics and Its Applications, vol. 362, no. 1, pp. 210-214, 2006.
[33] J. Yepez, “Type-II Quantum Computers,” Int'l J. Modern Physics C, vol. 12, no. 9, pp. 1273-1284, 2001.
[34] A. Yimsiriwattana and S.J. Lomonaco Jr., “Distributed Quantum Computing: A Distributed Shor Algorithm,” http://arxiv.org/quant-ph0403146, Mar. 2004.
[35] D. Gottesman and I.L. Chuang, “Demonstrating the Viability of Universal Quantum Computation Using Teleportation and Single-Qubit Operations,” Nature, vol. 402, pp. 390-393, 1999.
[36] J. Eisert, K. Jacobs, P. Papadopoulos, and M.B. Plenio, “Optimal Local Implementation of Nonlocal Quantum Gates,” Physical Rev.A, vol. 62, no. 5, p. 52317, 2000.
[37] S.F. Huelga, J.A. Vaccaro, A. Chefles, and M.B. Plenio, “Quantum Remote Control: Teleportation of Unitary Operations,” Physical Rev. A, vol. 63, no. 4, p. 42303, 2001.
[38] W.J. Munro, K. Nemoto, and T.P. Spiller, “Weak Nonlinearities: A New Route to Optical Quantum Computation,” New J. Physics, vol. 7, p. 137, May 2005.
[39] T.P. Spiller, K. Nemoto, S.L. Braunstein, W.J. Munro, P. van Loock, and G.J. Milburn, “Quantum Computation by Communication,” New J. Physics, vol. 8, p. 30, Feb. 2006.
[40] K. Nemoto and W.J. Munro, “Universal Quantum Computation on the Power of Quantum Non-Demolition Measurements,” Physics Letters A, vol. 344, p. 104, 2005.
[41] H.-J. Briegel, W. Dür, J.I. Cirac, and P. Zoller, “Quantum Repeaters: The Role of Imperfect Local Operations in Quantum Communication,” Physical Rev. Letters, vol. 81, pp. 5932-5935, 1998.
[42] L. Childress, J.M. Taylor, A.S. Sørensen, and M.D. Lukin, “Fault-Tolerant Quantum Repeaters with Minimal Physical Resources and Implementations Based on Single-Photon Emitters,” Physical Rev. A, vol. 72, no. 5, p. 52330, 2005.
[43] L. Childress, J.M. Taylor, A.S. Sørensen, and M.D. Lukin, “Fault-Tolerant Quantum Communication Based on Solid-State Photon Emitters,” Physical Rev. Letters, vol. 96, no. 7, p. 70504, 2006.
[44] S.J. van Enk, J.I. Cirac, and P. Zoller, “Photonic Channels for Quantum Communication,” Science, vol. 279, no. 5348, pp. 205-208, 1998.
[45] J.I. Cirac, P. Zoller, H.J. Kimble, and H. Mabuchi, “Quantum State Transfer and Entanglement Distribution among Distant Nodes in a Quantum Network,” Physical Rev. Letters, vol. 78, no. 16, pp.3221-3224, 1997.
[46] S. Mancini and S. Bose, “Engineering an Interaction and Entanglement between Distant Atoms,” Physical Rev. A, vol. 70, no. 2, p. 22307, 2004.
[47] L.-M. Duan, B.B. Blinov, D.L. Moehring, and C. Monroe, “Scalable Trapped Ion Quantum Computation with a Probabilistic Ion-Photon Mapping,” Quantum Information and Computation, vol. 4, pp. 165-173, 2004.
[48] L.M. Duan, B. Wang, and H.J. Kimble, “Robust Quantum Gates on Neutral Atoms with Cavity-Assisted Photon Scattering,” Physical Rev. A, vol. 72, no. 3, p. 32333, 2005.
[49] S.J. van Enk, J.I. Cirac, and P. Zoller, “Ideal Quantum Communication over Noisy Channels: A Quantum Optical Implementation,” Physical Rev. Letters, vol. 78, no. 22, pp. 4293-4296, June 1997.
[50] E. Waks and J. Vuckovic, “Dipole Induced Transparency in Drop-Filter Cavity-Waveguide Systems,” Physical Rev. Letters, vol. 96, no. 15, p. 153601, 2006.
[51] W. Yao, R.-B. Liu, and L.J. Sham, “Theory of Control of the Spin-Photon Interface for Quantum Networks,” Physical Rev. Letters, vol. 95, 2005.
[52] W. Dür, H.-J. Briegel, J.I. Cirac, and P. Zoller, “Quantum Repeaters Based on Entanglement Purification,” Physical Rev. A, vol. 59, no. 1, pp. 169-181, Jan. 1999.
[53] Z.-B. Chen, B. Zhao, J. Schmiedmayer, and J.-W. Pan, “Fault-Tolerant Quantum Repeater with Atomic Ensembles and Linear Optics,” quant-ph/0609151, Sept. 2006.
[54] L.M. Duan, M.D. Lukin, J.I. Cirac, and P. Zoller, “Long-Distance Quantum Communication with Atomic Ensembles and Linear Optics,” Nature, vol. 414, pp. 413-418, 2001.
[55] B. Zhao, Z.-B. Chen, Y.-A. Chen, J. Schmiedmayer, and J.-W. Pan, “Robust Long-Distance Quantum Communication with Atomic Ensembles and Linear Optics,” quant-ph/0609154, Sept. 2006.
[56] L. Jiang, J.M. Taylor, and M.D. Lukin, “A Fast and Robust Approach to Long-Distance Quantum Communication with Atomic Ensembles,” quant-ph/0609236, Sept. 2006.
[57] T. Pellizzari, “Quantum Networking with Optical Fibres,” Physical Rev. Letters, vol. 79, no. 26, pp. 5242-5245, 1997.
[58] A. Serafini, S. Mancini, and S. Bose, “Distributed Quantum Computation via Optical Fibers,” Physical Rev. Letters, vol. 96, no. 1, p. 010503, 2006.
[59] P. van Loock, T.D. Ladd, K. Sanaka, F. Yamaguchi, K. Nemoto, W.J. Munro, and Y. Yamamoto, “Hybrid Quantum Repeater Using Bright Coherent Light,” Physical Rev. Letters, vol. 96, 2006.
[60] T.D. Ladd, P. van Loock, K. Nemoto, W.J. Munro, and Y. Yamamoto, “Hybrid Quantum Repeater Based on Dispersive CQED Interaction between Matter Qubits and Bright Coherent Light,” New J. Physics, vol. 8, p. 184, 2006.
[61] R. Van Meter and K.M. Itoh, “Fast Quantum Modular Exponentiation,” Physical Rev. A, vol. 71, no. 5, May 2005.
[62] D. Beckman, A.N. Chari, S. Devabhaktuni, and J. Preskill, “Efficient Networks for Quantum Factoring,” Physical Rev. A, vol. 54, pp. 1034-1063, , 1996.
[63] V. Vedral, A. Barenco, and A. Ekert, “Quantum Networks for Elementary Arithmetic Operations,” Physical Rev. A, vol. 54, pp.147-153, http://arXiv.org/quant-ph/9602016http:// arXiv.org/quant-ph9511018, 1996.
[64] T.G. Draper, S.A. Kutin, E.M. Rains, and K.M. Svore, “A Logarithmic-Depth Quantum Carry-Lookahead Adder,” Quantum Information and Computation, vol. 6, nos. 4 and 5, pp. 351-369, July 2006.
[65] S.A. Cuccaro, T.G. Draper, S.A. Kutin, and D.P. Moulton, “A New Quantum Ripple-Carry Addition Circuit,” http://arXiv.org/quant-ph0410184, Oct. 2004.
[66] F. Yamaguchi, K. Nemoto, and W.J. Munro, “Quantum Error Correction via Robust Probe Modes,” Physical Rev. A, vol. 73, p.060302, June 2006.
[67] D. Bacon, “Operator Quantum Error-Correcting Subsystems for Self-Correcting Quantum Memories,” Physical Rev. A, vol. 73, no. 1, 2006.
[68] D.D. Thaker, T. Metodi, A. Cross, I. Chuang, and F.T. Chong, “CQLA: Matching Density to Exploitable Parallelism in Quantum Computing,” Computer Architecture News, Proc. 33rd Ann. Int'l Symp. Computer Architecture, June 2006.
[69] D. Bacon and A. Casaccino, “Quantum Error Correcting Subsystem Codes from Two Classical Linear Codes,” quant-ph/0610088, Oct. 2006.
[70] R. Van Meter, K. Nemoto, and W.J. Munro, ”Communication Links for Distributed Quantum Computation,” http://arxiv.org/quant-ph0701043, Jan. 2007.
[71] L. Jiang, J.M. Taylor, A.S. Sorensen, and M.D. Lukin, “Scalable Quantum Networks Based on Few-Qubit Registers,” quant-ph/0703029, 2007.
[72] D. Aharonov and M. Ben-Or, “Fault-Tolerant Quantum Computation with Constant Error Rate,” http://arXiv.org/quant-ph9906129, extended version of STOC 1997 paper, June 1999.
[73] J. Preskill, “Reliable Quantum Computers,” Proc. Royal Soc. of London A, vol. 454, pp. 385-410, 1998.
[74] C.H. Bennett, H.J. Bernstein, S. Popescu, and B. Schumacher, “Concentrating Partial Entanglement by Local Operations,” Physical Rev. A, vol. 53, p. 2046, 1996.
[75] L. Hartmann, B. Kraus, H.-J. Briegel, and W. Dür, “On the Role of Memory Errors in Quantum Repeaters,” Physical Rev. A, vol. 75, p.032310, 2007.
[76] G. Amdahl, “Validity of the Single Processor Approach to Achieving Large-Scale Computing Capabilities,” Proc. Am. Federation Information Processing Societies Conf., pp. 483-485, 1967.
[77] ACM, Computer Architecture News, Proc. 33rd Ann. Int'l Symp. Computer Architecture, June 2006.
Index Terms:
Emerging technologies, Emerging technologies, Interconnection architectures, Interconnections (Subsystems), Error-checking
Citation:
Rod Van Meter, Kae Nemoto, W. Munro, "Communication Links for Distributed Quantum Computation," IEEE Transactions on Computers, vol. 56, no. 12, pp. 1643-1653, July 2007, doi:10.1109/TC.2007.70775
