Online ISSN:1349-8606
Progress in Informatics  
No.8 March 2011  
Page 65-79  
Recursive quantum repeater networks

LINK [1] C. E. Shannon,“A mathematical theory of communication,”Bell System Technical Journal,vol.27, pp.379-423 and pp.623-656, 1948.

LINK [2] A. S. Tanenbaum,Computer Networks,Prentice-Hall, 4 ed., 2002.

LINK [3] S. Tani, H. Kobayashi, and K. Matsumoto,“Exact quantum algorithms for the leader election problem,”In Proc. STACS 2005: 22nd Annual Symposium on Theoretical Aspects of Computer Science, vol.3404 ofLecture Notes in Computer Science, pp.581-592, 2005.

LINK [4] M. Ben-Or and A. Hassidim,“Fast quantum Byzantine agreement,”In Proceedings of the thirty-seventh annual ACM symposium on Theory of computing, pp.481-485, ACM, 2005.

LINK [5] S. Gaertner, M. Bourennane, C. Kurtsiefer, A. Cabello, and H. Weinfurter,“Experimental demonstration of a quantum protocol for byzantineagreement and liar detection,”Phys. Rev. Lett., vol.100, no.7, p.070504, 2008.

LINK [6] A. K. Ekert,“Quantum cryptography based on Bell's theorem,”Phys. Rev. Lett., vol.67, no.6, pp.661-663, 1991.

LINK [7] D. Markham and B.C. Sanders,“Graph states for quantum secret sharing,”Phys. Rev. A, vol.78, no.4,p.42309, 2008.

LINK [8] R. Van. Meter, W. J. Munro, K. Nemoto, and K. M. Itoh,“Arithmetic on a distributed-memory quantum multicomputer,”ACM Journal of Emerging Technologies in Computing Systems,vol.3, no.4, p.17, Jan. 2008.

LINK [9] C. Crepeau, D. Gottesman, and A. Smith,“Secure multi-party quantum computation,”In Proc. Symposium on Theory of Computing. ACM, 2002.

LINK [10] M. Hein, W. Dür, J. Eisert, R. Raussendorf, M. Van den Nest, and H.J.Briegel,“Entanglement in graph states and its applications,”Arxiv preprint quant-ph/0602096, 2006,Presented at 173rd International School of Physics “Enrico Fermi” :Quantum Computers, Algorithms and Chaos, Varenna, Italy, 5-15 Jul 2005.

LINK [11] I. L. Chuang,“Quantum algorithm for distributed clock synchronization,”Phys. Rev. Lett., vol.85, no.9, pp.2006-2009, 2000.

LINK [12] H. Buhrman and H. Röhrig,Mathematical Foundations of Computer Science 2003, chapter Distributed Quantum Computing, pp.1-20,Springer-Verlag, 2003.

LINK [13] E. D'Hondt,Distributed quantum computation: A measurement-based approach.PhD thesis, Vrije Universiteit Brussel, July 2005.

LINK [14] M. Lalire and P. Jorrand,“A process algebraic approach to concurrent and distributed quantumcomputation: operational semantics,”Proc. QPL, pp.109-126, 2004.

LINK [15] R. Van. Meter and B.-S. Choi,“Applications of an entangled quantum Internet,”In Proc. 3rd International Conference on Future Internet Technologies, pp.51-55, June 2008.

LINK [16] H. J. Kimble,“The quantum Internet,”Nature, vol.453, pp.1023-1030, June 2008.

LINK [17] S. Lloyd, J. H. Shapiro, F. N. C. Wong, P. Kumar, S. M. Shahriar, and H. P. Yuen,“Infrastructure for the quantum Internet,”ACM SIGCOMM Computer Communication Review,vol.34, no.5, pp.9-20, 2004.

LINK [18] J. Day,Patterns in Network Architecture: A Return to Fundamentals.Prentice Hall, 2008.

LINK [19] D. Meyer,“The locator identifier separation protocol (LISP),”The Internet Protocol Journal, vol.11, no.1, pp.23-36, 2008.

LINK [20] J. Touch, Y. Wang, and V. Pingali,“A recursive network architecture,”ISI Technical Report ISI-TR-2006-626, 2006,Presented at the IEEE Workshop on Computer Communications (CCW),Pittsburgh PA, Feb. 2007.

LINK [21] R. Perlman,“Rbridges: transparent routing,”In Proceedings of INFOCOM 2004, pp.1211-1218. IEEE, 2004.

LINK [22] S. J. Devitt, K. Nemoto, and W. J. Munro,“The idiots guide to quantum error correction,”arXiv:0905.2794v2 [quant-ph], 2009.

LINK [23] M. A. Nielsen and Isaac L. Chuang,Quantum Computation and Quantum Information.Cambridge University Press, 2000.

LINK [24] V. Vedral, A. Barenco, and A. Ekert,“Quantum networks for elementary arithmetic operations,”Phys. Rev. A, vol.54, pp.147-153, 1996.

LINK [25] D. Beckman, A. N. Chari, S. Devabhaktuni, and J. Preskill,“Efficient networks for quantum factoring,”Phys. Rev. A, vol.54, pp.1034-1063, 1996.

LINK [26] R. P. Feynman,Feynman Lectures on Computation.Addison Wesley, 1996.

LINK [27] Rodney Van Meter and Kohei M. Itoh.Fast quantum modular exponentiation,Phys. Rev. A, vol.71, no.5, p.052320, 2005.

LINK [28] 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, no.4&5, pp.351-369,2006.

LINK [29] R. Van. Meter, T. D. Ladd, W. J. Munro, and K. Nemoto,“System design for a long-line quantum repeater,”IEEE/ACM Transactions on Networking,vol.17, no.3, pp.1002-1013,2009.

LINK [30] W. Dür, H.-J. Briegel, J. I. Cirac, and P. Zoller,“Quantum repeaters based on entanglement purification,”Phys. Rev. A, vol.59, no.1, pp.169-181, 1999.

LINK [31] S. C. Benjamin, J. Eisert, and T. M. Stace,“Optical generation of matter qubit graph states,”New Journal of Physics, vol.7, no.1, p.194, 2005.

LINK [32] W. J. Munro, K. Nemoto, and T. P. Spiller,“Weak nonlinearities: a new route to optical quantum computation,”New Journal of Physics, vol.7, p.137, 2005.

LINK [33] D. Gottesman and I. L. Chuang,“Demonstrating the viability of universal quantum computation usingteleportation and single-qubit operations,”Nature, vol.402, pp.390-393, 1999.

LINK [34] 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,”Phys. Rev. Lett., vol.70, pp.1895-1899, 1993.

LINK [35] 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.

LINK [36] S. Olmschenk, D. N. Matsukevich, P. Maunz, D. Hayes, L.-M. Duan,and C. Monroe,“Quantum Teleportation Between Distant Matter Qubits,”Science, vol.323, no.5913, pp.486-489, 2009.

LINK [37] T. Satoh and R. Van. Meter,“Path selection in heterogeneous quantum networks,”In Asian Conference on Quantum Information Science (AQIS),Aug. 2010.

LINK [38] L. Aparicio and R. Van. Meter,“Multiplexing in quantum repeater networks,”In Asian Conference on Quantum Information Science (AQIS),Aug. 2010.

LINK [39] L. Childress, J. M. Taylor, A. S. Sørensen, and M. D. Lukin,“Fault-tolerant quantum repeaters with minimal physical resources andimplementations based on single-photon emitters,”Phys. Rev. A, vol.72, no.5, p.52330, 2005.

LINK [40] T. D. Ladd, P. van Loock, K. Nemoto, W. J. Munro, and Y. Yamamoto,“Hybrid quantum repeater based on dispersive CQED interactionbetween matter qubits and bright coherent light,”New Journal of Physics, vol.8, p.184, 2006.

LINK [41] W. J. Munro, R. Van Meter, Sebastien G. R. Louis, and K. Nemoto,“High-bandwidth hybrid quantum repeater,”Phys. Rev. Lett., vol.101, no.4, p.040502, 2008.

LINK [42] 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,”Phys. Rev. Lett., vol.96, p.240501, 2006.

LINK [43] H.-J. Briegel, W. Dür, J.I. Cirac, and P. Zoller,“Quantum repeaters: the role of imperfect local operations in quantumcommunication,”Phys. Rev. Lett., vol.81, pp.5932-5935, 1998.

LINK [44] W. Dür and H. J. Briegel,“Entanglement purification and quantum error correction,”Rep. Prog. Phys., vol.70, pp.1381-1424, 2007.

LINK [45] C. H. Bennett, G. Brassard, S. Popescu, B. Schumacher, J. A. Smolin,and W. K. Wootters,“Purification of noisy entanglement and faithful teleportation vianoisy channels,”Phys. Rev. Lett., vol.76, no.5, pp.722-725, 1996.

LINK [46] D. Deutsch, A. Ekert, R. Jozsa, C. Macchiavello, S. Popescu,and A. Sanpera,“Quantum privacy amplification and the security of quantumcryptography over noisy channels,”Phys. Rev. Lett., vol.77, no.13, pp.2818-2821, 1996.

LINK [47] W. Dür, H. Aschauer, and H. J. Briegel,“Multiparticle entanglement purification for graph states,”Phys. Rev. Lett., vol.91, no.10, p.107903, 2003.

LINK [48] C. Kruszynska, A. Miyake, H. J. Briegel, and W. Dür,“Entanglement purification protocols for all graph states,”Phys. Rev. A, vol.74, no.5, p.52316, 2006.

LINK [49] L. Childress, J. M. Taylor, A. S. Sørensen, and M. D. Lukin,“Fault-tolerant quantum communication based on solid-state photonemitters,”Phys. Rev. Lett., vol.96, no.7, p.70504, 2006.

LINK [50] L. Hartmann, B. Kraus, H.-J. Briegel, and W. Dür,“On the role of memory errors in quantum repeaters,”Phys. Rev. A, vol.75, p.032310, 2007.

LINK [51] L. Jiang, J. M. Taylor, K. Nemoto, W. J. Munro, R. Van. Meter, and M. D. Lukin,“Quantum repeater with encoding,”Phys. Rev. A, vol.79, no.3, p.032325, 2009.

LINK [52] A. G. Fowler, A. M. Stephens, and P. Groszkowski,“High threshold universal quantum computation on the surface code,”Phys. Rev. A, vol.80, p.052312, 2009.

LINK [53] W. J. Munro, K. A. Harrison, A. M. Stephens, S. J. Devitt, and K. Nemoto,“From quantum multiplexing to high-performance quantum networking,”Nature Photonics, 2010.

LINK [54] R. Raussendorf and J. Harrington,“Fault-tolerant quantum computation with high threshold in twodimensions,”Phys. Rev. Lett., vol.98, p.190504, 2007.

LINK [55] R. Raussendorf, J. Harrington, and K. Goyal,“Topological fault-tolerance in cluster state quantum computation,”New Journal of Physics, vol.9, p.199, 2007.

LINK [56] D. S. Wang, A. G. Fowler, A. M. Stephens, and L. C. L. Hollenberg,“Threshold error rates for the toric and surface codes,”Quantum Information and Computation, vol.10, p.456, 2010.

LINK [57] A. R. Calderbank and P. W. Shor,“Good quantum error-correcting codes exist,”Phys. Rev. A, vol.54, pp.1098-1105, 1996.

LINK [58] A. Steane,“Error correcting codes in quantum theory,”Phys. Rev. Lett., vol.77, pp.793-797, 1996.

LINK [59] A. G. Fowler, D. S. Wang, C. D. Hill, T. D. Ladd, R. Van. Meter, and L. C. L. Hollenberg,“Surface code quantum communication,”Phys. Rev. Lett., vol.104, no.18, p.180503, 2010.

LINK [60] R. Raussendorf, D. E. Browne, and H. J. Briegel,“Measurement-based quantum computation on cluster states,”Phys. Rev. A, vol.68, p.022312, 2003.

LINK [61] W. J. Munro et al.unpublished.

LINK [62] D. Kielpinski, C. Monroe, and D. J. Wineland,“Architecture for a large-scale ion-trap quantum computer,”Nature, vol.417, pp.709-711, 2002.

LINK [63] T. D. Ladd, F. Jelezko, R. Laflamme, Y. Nakamura, C. Monroe, and J. L. O'Brien,“Quantum computers,”Nature, vol.464, pp.45-53, 2010.

LINK [64] T. P. Spiller, K. Nemoto, S. L. Braunstein, W. J. Munro, P. van Loock, and G. J. Milburn,“Quantum computation by communication,”New Journal of Physics, vol.8, p.30, 2006.

LINK [65] A. Steane,“The ion trap quantum information processor,”Appl. Phys. B, vol.64, pp.623-642, 1997.

LINK [66] R. Van. Meter, T. D. Ladd, A. G. Fowler, and Y. Yamamoto,“Distributed quantum computation architecture using semiconductornanophotonics,”International Journal of Quantum Information, vol.8, pp.295-323, 2010.preprint available as arXiv:0906.2686v2 [quant-ph].

LINK [67] D. M. Greenberger, M. A. Horne, and A. Zeilinger,“Going beyond bell's theorem,”In M. Kafatos, editor, Bell's Theorem, Quantum Theory, and Conceptions of the Universe, pp.69-72. Kluwer, 1989.available as arXiv:0712.0921v1 [quant-ph].

LINK [68] P. Høyer and R. Špalek,“Quantum circuits with unbounded fan-out,”Lecture Notes in Computer Science,2607/2003, pp.234-246, 2003.

LINK [69] F. Yamaguchi, K. Nemoto, and W. J. Munro,“Quantum error correction via robust probe modes,”Phys. Rev. A, vol.73, p.060302, 2006.

LINK [70] K. S. Choi, A. Goban, S. B. Papp, S. J. van Enk, and H. J. Kimble,“Entanglement of spin waves among four quantum memories,”Nature, vol.468, pp.412-416, 2010.

LINK [71] J. Touch,“Dynamic Internet overlay deployment and management using the X-bone,”Computer Networks, pp.117-135, 2001.A previous version appeared in Proc. ICNP 2000, pp.59-68.

LINK [72] J. Day, I. Matta, and K. Mattar,“Networking is IPC: A guiding principle to a better Internet,”In Proc. ACM SIGCOMM CoNext ReArch'08 Workshop, 2008.

LINK [73] J. Touch, I. Baldine, R. Dutta, B. Ford G. Finn, S. Jordan, D. Massey,A. Matta, C. Papadopoulos, P. Reiher, and G. Rouskas,A dynamic recursive unified internet design (DRUID), appear in Computer Networks (Elsevier).

LINK [74] J. Touch and V. Pingali,“The RNA metaprotocol,”In Proc. IEEE International Conf. on Computer Comm. (ICCCN),2008.

LINK [75] G. L. Steele,“Debunking the 'expensive procedure call' myth, or, procedure callimplementations considered harmful, or, Lambda: The ultimate GOTO,”In Proceedings of the 1977 ACM national conference. ACM,1977.available as

LINK [76] G. Coulouris, J. Dollimore, and T. Kindberg,“Distributed Systems: Concepts and Design,”Addison-Wesley, 4th edition, 2005.

LINK [77] S. C. Benjamin, D. E. Browne, J. Fitzsimons, and J. J. L.Morton,“Brokered graph-state quantum computation,”New Journal of Physics, vol.8, no.8, p.141, 2006.

LINK [78] E. W. Dijkstra,“A note on two problems in connexion with graphs,”Numerische Mathematik, vol.1, no.1, pp.269-271, 1959.

LINK [79] J. Moy,“OSPF version 2,”RFC 2178, July 1997.