Efficient distributed quantum computing

Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences

Volumn 469, Issue 2153, 2013, Pages

  Beals, Robert ^a   Brierley, Stephen ^b   Gray, Oliver ^b   Harrow, Aram W ^c   Kutin, Samuel ^a   Linden, Noah ^b   Shepherd, Dan ^b,d   Stather, Mark ^d  

^a CENTER FOR COMMUNICATIONS RESEARCH   (United States)

^b UNIVERSITY OF BRISTOL   (United Kingdom)

^c MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

^d CESG   (United Kingdom)

Author keywords

Distributed quantum computing; Quantum algorithms; Quantum architectures

Indexed keywords

ALGORITHMS; CIRCUIT THEORY; COMPUTER SIMULATION; QUANTUM THEORY;

CIRCUIT MODELS; DISTRIBUTED QUANTUM COMPUTING; LOW OVERHEAD; QUANTUM ALGORITHMS; QUANTUM ARCHITECTURE; QUANTUM MEMORY; QUANTUM SEARCH ALGORITHM; REALISTIC MODEL;

QUANTUM COMPUTERS;

EID: 84877258273     PISSN: 13645021     EISSN: 14712946     Source Type: Journal    
DOI: 10.1098/rspa.2012.0686     Document Type: Article

References (39)

1. Cirac J, Zoller P, Kimble H, Mabuchi H. 1997 Quantum state transfer and entanglement distribution among distant nodes in a quantum network. Phys. Rev. Lett. 78, 3221-3224. (doi:10.1103/PhysRevLett.78.3221).
2. Monroe C, Raussendorf R, Ruthven A, Brown KR, Maunz P, Duan L-M, Kim J. Submitted. Large scale modular quantum computer architecture with atomic memory and photonic interconnects. (http://arxiv.org/abs/1208.0391).
3. Ritter S et al. 2012 An elementary quantum network of single atoms in optical cavities. Nature 484, 195-200. (doi:10.1038/nature11023).
4. Blais A, Huang R-S, Wallraff A, Girvin S, Schoelkopf R. 2004 Cavity quantum electrodynamics for superconducting electrical circuits: an architecture for quantum computation. Phys. Rev. A 69, 062320. (doi:10.1103/PhysRevA.69. 062320).
5. Wallraff A, Schuster DI, Blais A, Frunzio L, Huang R-S, Majer J, Kumar S, Girvin SM, Schoelkopf RJ. 2004 Strong coupling of a single photon to a superconducting qubit using circuit quantum electrodynamics. Nature 431, 162-167. (doi:10.1038/nature02851).
6. Van Meter R, Ladd T, Fowler A, Yamamoto Y. 2010 Distributed quantum computation architecture using semiconductor nanophotonics. Int. J. Quantum Inform. 8, 295-323. (doi:10.1142/S0219749910006435).
7. Hirata Y, Nakanishi M, Yamashita S, Nakashima Y. 2011 An efficient conversion of quantum circuits to a linear nearest neighbor architecture. Quantum Inform. Comput. 11, 142-166.
8. Van Meter R, MunroW, Nemoto K, Itoh K. 2009 Arithmetic on a distributed-memory quantum multicomputer. ACM J. Emerg. Technol. Comp. Syst., 3, 2. (doi:10.1145/1324177.1324179).
9. Van Meter R, Oskin M. 2006 Architectural implications of quantum computing technologies. ACM J. Emerg. Technol. Comp. Syst. 2, 31-63. (doi:10.1145/1126257.1126259).
10. Jones N, Van Meter R, Fowler A, McMahon P, Kim J, Ladd T, Yamamoto Y. 2012 Layered architecture for quantum computing. Phys. Rev. X 2, 031007. (doi:10.1103/PhysRevX.2.031007).
11. Kitaev A. 1997 Quantum computations: algorithms and error correction. Russ. Math. Surv. 52, 1191-1249. (doi:10.1070/RM1997v052n06ABEH002155).
12. Knuth D. 1998 The art of computer programming, vol. 3. Reading, MA: Addison-Wesley.
13. Ajtai M, Komlos J, Szemeredi E. 1983 An O(n log n) sorting network. In Proc. 15th Annual ACM STOC, Boston, MA, 25-27 April 1983, pp. 1-9. New York, NY: ACM.
14. Grover L. 1996 A fast quantummechanical algorithm for database search. In Proc. 28th Annual ACM STOC, Philadelphia, PA, p. 212. (doi:10.1145/237814. 237866).
15. Ambainis A. 2007 Quantum walk algorithm for element distinctness. SIAM J. Comput. 37, 210-239. (doi:10.1137/S0097539705447311).
16. Grover L, Rudolph T. 2004 How significant are the known collision and element distinctness quantum algorithms? Quantum Inform. Comp. 4, 201. (http://arxiv.org/abs/quant-ph/0309123).
17. Cleve R, Buhrman H. 1997 Substituting quantum entanglement for communication. Phys. Rev. A 56, 1201-1204. (doi:10.1103/PhysRevA.56.1201).
18. Valiant LG. 1988 Optimally universal parallel computers. Phil. Trans. R. Soc. Lond. A 326, 373- 376. (doi:10.1098/rsta.1988.0093).
19. Valiant LG. 1990 A bridging model for parallel computation. Commun. ACM 33, 103-111. (doi:10.1145/79173.79181).
20. Leighton FT. 1992 Introduction to parallel algorithms and architectures. San Mateo, CA: Morgan Kauffman Publishers.
21. Thapliyal H, Ranganathan N, Ferreira R. 2010 Design of a comparator tree based on reversible logic. In Proc. 10th IEEE Conf. on Nanotechnology (IEEE-NANO), Seoul, pp. 1113-1116. IEEE. (doi:10.1109/NANO.2010.5697872).
22. Aharonov D, Ben-Or M, Impagliazzo R, Nisan N. 1996 Limitations of noisy reversible computation. (http://arxiv.org/abs/quant-ph/9611028).
23. Paterson M. 1990 Improved sorting networks with O(logN) depth. Algorithmica 5, 75-92. (doi:10.1007/BF01840378).
24. Choi B-S, Van Meter R. 2011 On the effect of quantum interaction distance on quantum addition circuits. ACM J. Emerg. Technol. Comput. Syst. 7, 11. (doi:10.1145/2000502.2000504).
25. Bernstein DJ. 2009 Cost analysis of hash collisions: will quantum computers make SHARCS obsolete? In SHARCS '09: Special-purpose Hardware for Attacking Cryptographic Systems, Lausanne, 9-10 September 2009.
26. Giovannetti V, Lloyd S, Maccone L. 2008 Quantum random access memory. Phys. Rev. Lett. 100, 160501. (doi:10.1103/PhysRevLett.100.160501).
27. Giovannetti V, Lloyd S, Maccone L. 2008 Architectures for a quantum random access memory. Phys. Rev. A 78, 052310. (doi:10.1103/PhysRevA.78.052310).
28. Brassard G, Hoyer P. 1997 An exact quantum mechanical polynomial time algorithm for Simon's problem. In Proc. ISTCS '97, vol. 12. (http://arxiv.org/ abs/quant-ph/9704027).
29. Brassard G, Hoyer P, Mosca M, Tapp A. 2000 Quantum amplitude amplification and estimation. In Quantum computation and quantum information science (eds SJ Lomonca, HE Brandt). AMS Contemporary Math series. (http://arxiv.org/abs/quant-ph/0005055).
30. Buhrman H, Durr C, Heiligman M, Hoyer P, Magniez F, Santha M, de Wolf R. 2005 Quantum algorithms for element distinctness. SIAM J. Comp. 34, 1324-1330. (doi:10.1137/S0097539702402780).
31. Brassard G, Hoyer P, Tapp A. 1997 Cryptology column-quantum algorithm for the collision problem. ACM SIGACT News 28, 14-19. (doi:10.1145/261342.261346).
32. Belovs A. 2012 Span programs for functions with constant-sized 1-certificates. In Proc. 44th Annual ACM STOC, p. 77. (http://arxiv.org/abs/ 1105.4024).
33. Magniez F, Santha M, Szegedy M. 2007 Quantum algorithms for the triangle finding problem. SIAM J. Comp. 37, 413-424. (doi:10.1137/050643684).
34. Ambainis A. 2004 Quantum search algorithms. SIGACT News 35, 22-35. (doi:10.1145/992287. 992296).
35. Cerf N, Grover L, Williams C. 2000 Nested quantum search and NP-hard problems. Applicable Algebra Eng. Commun. Comput. 10, 311-338. (doi:10.1007/s002000050134).
36. Nielsen M, Chuang I. 2000 Quantum computation and quantum information. Cambridge, UK: Cambridge University Press.
37. Maslov D, Falconer SM, Mosca M. 2008 Quantum circuit placement. IEEE Trans. Comp. Aided Des. Integr. Circuits Syst. 27, 752-763. (doi:10.1109/TCAD. 2008.917562).
38. Fowler A, Devitt S. A bridge to lower overhead quantum computation. (http://arxiv.org/abs/1209.0510).
39. Maslov D, Saeedi M. 2011 Reversible circuit optimization via leaving the Boolean domain. IEEE Trans. Comp. Aided Des. Integr. Circuits Syst. 30 806-816. (doi:10.1109/TCAD.2011. 2105555).