The measurement calculus

Journal of the ACM

Volumn 54, Issue 2, 2007, Pages

  Danos, Vincent ^a   Kashefi, Elham ^b   Panangaden, Prakash ^c  

^a UNIVERSITÉ PARIS DESCARTES   (France)

^b UNIVERSITY OF OXFORD   (United Kingdom)

^c MCGILL UNIVERSITY   (Canada)

Author keywords

Measurement based quantum computing; Models for quantum computing; Normalization; Quantum programming languages; Teleportation based quantum computing; Term rewriting

Indexed keywords

ALGEBRA; COMPUTATION THEORY; MATHEMATICAL MODELS; SEMANTICS; STANDARDIZATION; THEOREM PROVING;

MEASUREMENT-BASED QUANTUM COMPUTING; MODELS FOR QUANTUM COMPUTING; QUANTUM PROGRAMMING LANGUAGES; TELEPORTATION-BASED QUANTUM COMPUTING; TERM REWRITING;

QUANTUM COMPUTERS;

EID: 34247194662     PISSN: 00045411     EISSN: 1557735X     Source Type: Journal    
DOI: 10.1145/1219092.1219096     Document Type: Article

References (79)

1. ABRAMSKY, S., AND COECKE, B. 2004. A categorical semantics of quantum protocols. In Proceedings of the 19th Annual IEEE Symposium on Logic in Computer Science (LiCS). IEEE Computer Society Press, Los Alamitos, CA.
2. ABRAMSKY, S., AND DUNCAN, R. 2004. A categorical quantum logic. In Proceedings of the 2nd International Workshop on Quantum Programming Languages, P. Selinger, Ed. TUCS General Publications.
3. ALIFERIS, P., AND LEUNG D. W. 2004. Computation by measurements: A unifying picture. Phys. Rev. A, 70 (quant-ph/0404082).
4. ALTENKIRCH, T., AND GRATTAGE, J. 2005. A functional quantum programming language. In Proceedings of the 20th Annual IEEE Symposium on Logic in Computer Science (LiCS). IEEE Computer Society Press, Los Alamitos, CA.
5. BARENDREGT, H. P. 1984. The Lambda Calculus, Its Syntax and Semantics. Studies in Logic. North-Holland, Amsterdam, The Netherlands.
6. BENJAMIN, S. C., BROWNE, D. E., FITZSMONS, J., AND MORTON, J. J. L. 2006. Brokered graph state quantum computing. New J. Phys. 8 (quant-ph/0509209).
7. BENJAMIN, S. C., EISERT, J., AND STACE, T. M. 2005. Optical generation of matter qubit graph states. New J. Phys. 7 (quant-ph/0506110).
8. BENNETT, C., BRASSARD, G., CREPEAU, C., JOZSA, R., PERES, A., AND WOOTTERS, W. 1993. Teleporting an unknown quantum state via dual classical and EPR channels. Phys. Rev. Lett..
9. BERNSTEIN, E., AND VAZIRANI, U. 1997. Quantum complexity theory. SIAM J. Comput. 5, 26.
10. BRASSARD, G., AND BENNETT, C. H. 1984. Public key distribution and coin tossing. In Proceedings of IEEE International Conference on Computers, Systems and Signal Processing. IEEE Computer Society Press, Los Alamitos, CA.
11. BRAVYI, S., AND KITAEV, A. 2005. Universal quantum computation with ideal Clifford gates and noisy ancillas. Phys. Rev. A 71 (quant-ph/0403025).
12. BROADBENT, A., AND KASHEFI, E. 2007. On parallelizing quantum circuits. Accepted to the International Workshop on Measurement-Based Quantum Computing (Oxford UK, March).
13. BROWNE, D. E., AND RUDOLPH, T. 2005 Resource-efficient linear optical quantum computation. Phys. Rev. Lett. 95 (quant-ph/0405157).
14. CHEN, Q., CHENG, J., WANG, K. L., AND DU, J. 2006. Efficient construction of two-dimensional cluster states with probabilistic quantum gates. Phys. Rev. A 73 (quant-ph/0507066).
15. CHOI, M. D. 1975. Completely positive linear maps on complex matrices. Lin. Algebra Appl. 10.
16. CHILDS, A. M., LEUNG, D. W., AND NIELSEN, M. A. 2005. Unified derivations of measurement-based schemes for quantum computation. Phys. Rev. A 71 (quant-ph/0404132).
17. CLARK, S. R., MOURA ALVES, C., AND JAKSCH, D. 2005. Efficient generation of graph states for quantum computation. New J. Phys. 7 (quant-ph/0406150).
18. COECKE, B. 2004. The logic of entanglement (quant-ph/0402014).
19. DANOS, V., D'HONDT, E., KASHEFI, E., AND PANANGADEN, P. 2005a. Distributed measurement-based quantum computation. In Proceedings of the 3rd International Workshop on Quantum Programming Languages. Electronic Notes in Theoretical Computer Science (quant-ph/0506070).
20. DANOS, V., AND KASHEFI, E. 2006. Determinism in the one-way model. Phys. Rev. A 74 (quant-ph/0506062).
21. DANOS, V., AND KASHEFI, E. 2005. Pauli measurements are universal. In Proceedings of the 3rd International Workshop on Quantum Programming Languages. Electronic Notes in Theoretical Computer Science.
22. DANOS, V., KASHEFI, E., AND PANANGADEN, P. 2005b. Parsimonious and robust realizations of unitary maps in the one-way model. Phys. Rev. A 72 (quant-ph/0411071).
23. DAWSON, C. M., HASELGROVE, H. L., AND NIELSEN, M. A. 2006. Noise thresholds for optical cluster-state quantum computation. Phys. Rev. A 73 (quant-ph/0601066).
24. DE BEAUDRAP, N., DANOS, V., AND KASHEFI, E. 2006. Phase map decomposition for unitaries (quant-ph/0603266).
25. DEUTSCH, D. 1985. Quantum theory, the Church-Turing principle and the universal quantum computer. Proc. Roy. Soc. London, vol. A 400. Royal Society of London, London, England.
26. DEUTSCH, D. 1987. Quantum computers. Comput. Bull. 3, 2.
27. DEUTSCH, D. 1989. Quantum computational networks. Proc. Roy. Soc. Lond A, 425.
28. DEUTSCH, D., AND JOZSA, R. 1992. Rapid solution of problems by quantum computation. Proc. Roy. Soc. Lond A 439.
29. D'HONDT, E., AND PANANGADEN, P. 2004. Quantum weakest preconditions. In Proceedings of the 3rd International Workshop on Quantum Programming Languages. Electronic Notes in Theoretical Computer Science (quant-ph/0501157).
30. D'HONDT, E., AND PANANGADEN, P. 2005. Reasoning about quantum knowledge. In Proceedings of the 25th Conference on Foundations of Software Technology and Theoretical Computer Science.
31. DUNCAN, R. 2005. An abstract approach to entanglement. In Proceedings of Mathematical Structures In Quantum Informatics (QDay II).
32. DÜR, W., ASCHAUER, H., AND BRIEGEL, H. J. 2003. Multiparticle entanglement purification for graph state. Phys. Rev. Lett. 91 (quant-ph/0303087).
33. DÜRR, C., AND SANTHA, M. 1996. A decision procedure for unitary linear quantum cellular automata. In Proceedings of FOCS'96 - Symposium on Foundations of Computer Science. IEEE Computer Society Press, Los Alamitos, CA.
34. EKERT, A. 1991. Quantum cryptography based on bell's theorem. Phys. Rev. Lett. 67.
35. GAY, S. J. 2005. Quantum programming languages: Survey and bibliography. Bull. EATCS 86.
36. GAY, S. J., AND NAGARAJAN, R. 2005. Communicating quantum processes. In Proceedings of the 32nd ACM SIGACT-SIGPLAN Symposium on Principles of Programming Languages (POPL). ACM, New York (quant-ph/0409052).
37. GILBERT, G. HAMRICK, M., AND WEINSTEIN, Y. S. 2006. Efficient construction of photonic quantum-computational clusters. Phys. Rev. A 73 (quant-ph/0512110).
38. GOTTESMAN, D. 1997. Stabilizer codes and quantum error correction. Ph.D. dissertation, California Institute of Technology.
39. GOTTESMAN, D. AND CHUANG, I. L. 1999. Quantum teleportation is a universal computational primitive. Nature 402 (quant-ph/9908010).
40. GROVER, L. K. 1998. A framework for fast quantum mechanical algorithms. In Proceedings of STOC'98 - Symposium on Theory of Computing. ACM, New York (quant-ph/9711043).
41. HARTMANN, L., DÜR, W., AND BRIEGEL, H. J. 2006. Steady state entanglement in open and noisy quantum systems at high temperature. Phys. Rev. A. 74 (quant-ph/0512219).
42. HEIN, M., EISERT, J., AND BRIEGEL, H. J. 2004. Multi-party entanglement in graph states. Phys. Rev. A 69 (quant-ph/0307130).
43. JORRAND, P., AND LALIRE, M. 2004. Toward a quantum process algebra. In Proceedings of the 1st ACM Conference on Computing Frontiers. ACM, New York (quant-ph/0312067).
44. JORRAND, P., AND PERDRIX, S. 2005. Unifying quantum computation with projective measurements only and one-way quantum computation. In Quantum Informatics 2004, volume 5833 of SPIE Proceedings, Yuri I. Ozhigov, Ed (quant-ph/0404125).
45. KAY, A., PACHOS, J. K., AND ADAMS, C. S. 2006. Graph-state preparation and quantum computation with global addressing of optical lattices. Phys. Rev. A 73.
46. LEUNG, D. W. 2004. Quantum computation by measurements. Int. J. Quant. Info. 2, 1 (quant-ph/0310189).
47. MHALLA, M., AND PERDRIX, S. 2004. Complexity of graph state preparation (full text available from http://arxiv.org/abs/quant- ph/0412071).
48. NIELSEN, M. A. 2003. Universal quantum computation using only projective measurement, quantum memory, and preparation of the 0 state. Phys. Rev. A 308 (quant-ph/0108020).
49. NIELSEN, M. A. 2004. Optical quantum computation using cluster states. Phys. Rev. Lett. 93 (quant-ph/0402005).
50. NIELSEN, M. A., AND CHUANG, I. L. 2000. Quantum Computation and Quantum Information. Cambridge University Press, Cambridge, UK.
51. ÖMER, B. 2001. Procedural quantum programming. In Proceedings of the AIP Conference on Computing Anticipatory Systems (AIP Conference Proceedings 627). American Institute of Physics.
52. PERDRIX, S. 2003. State transfer instead of teleportation in measurement-based quantum computation. Int. J. Quant. Inf. 3, 1 (quant-ph/0402204).
53. PERDRIX, S., AND JORRAND, P. 2004. Measurement-based quantum Turing machines and their universality (full text available from http://arxiv.org/abs/quant-ph/0404146).
54. PERES, A. 1995. Quantum Theory: Concepts and Methods. Kluwer Academic.
55. PRESKILL, J. 1998. Fault-tolerant quantum computation. In Introduction to Quantum Computation and Information. H. K. Lo, S. Popescu, and T. P. Spiller, Eds, World Scientific.
56. RAUSSENDORF, R., ANDERS, S., AND BRIEGEL, H. J. 2004. Fault-tolerant quantum computation using graph states. Communication to the Quantum Information and Quantum Control Conference. Fields Institute, Toronto. http://atlas-conferences.com/c/a/n/n/ 80.htm.
57. RAUSSENDORF, R., AND BRIEGEL, H. J. 2001. A one-way quantum computer. Phys. Rev. Lett. 86.
58. RAUSSENDORF, R., AND BRIEGEL, H. J. 2002. Computational model underlying the one-way quantum computer. Quant. Inf. Comput. 2 (quant-ph/0108067).
59. RAUSSENDORF, R., BROWNE, D. E., AND BRIEGEL, H. J. 2003. Measurement-based quantum computation on cluster states. Phys. Rev. A 68.
60. SANDERS, J. W., AND ZULIANI, P. 2000. Quantum programming. In Mathematics of Program Construction, Lecture Notes in Computer Science, vol. 1837. Springer-verlag. New York.
61. SCHLINGEMANN, D. 2004. Cluster states, algorithms and graphs. Quant. Int. Comput. 4, 4 (quant-ph/0305170).
62. SCHUMACHER, B., AND WERNER, R. F. 2004. Reversible quantum cellular automata (quant-ph/0405174).
63. SELINGER, P. 2004a. Proceedings of the 2nd International Workshop on Quantum Programming Languages. TUCS General Publications.
64. SELINGER, P. 2004b. Towards a quantum programming language. Math. Struct. Comput. Sci. 14, 4.
65. SELINGER, P. 2004c. Towards a semantics for higher-order quantum computation. In Proceedings of the 2nd International Workshop on Quantum Programming Languages. TUCS General Publication
66. SELINGER, P. 2005a. Dagger compact closed categories and completely positive maps. In Proceedings of the 3nd International Workshop on Quantum Programming Languages. Electronic Notes in Theoretical Computer Science.
67. SELINGER, P., Ed. 2005b. Proceedings of the 3nd International Workshop on Quantum Programming Languages. Electronic Notes in Theoretical Computer Science.
68. SELINGER, P., AND VALIRON, B. 2005. Alambda calculus for quantum computation with classical control. In Proceedings of the 7th International Conference on Typed Lambda Calculi and Applications (TLCA). Lecture Notes in Computer Science, vol. 3461. Springer-verlag, New York.
69. SHOR, P. W. 1994. Algorithms for quantum computation: Discrete logarithms and factoring. In Proceedings of FOCS'94 - Symposium on Foundations of Computer Science. IEEE Computer Society press, Los Alamitos, CA.
70. SILVA, M., DANOS, V., KASHEFL, AND OLIVIER, H. 2006. A direct approach to fault-tolerance in measurement-based quantum computation via teleportation. New J. Phys., Submitted for publication. (Full text available from http://arxiv.org/abs/quant- ph/0611273.)
71. TAME, M. S., PATERNOSTRO, M., KIM, M. S., AND VEDRAL, V. 2006a. Toward a more economical cluster state quantum computation. Int. J. Quant. Int. 4, 4 (quant-ph/0412156).
72. TAME, M. S., PATERNOSTRO, M., KIM, M. S., AND VEDRAL, V. 2006b. Natural three-qubit interactions in one-way quantum computing. Phys. Rev. A 73 (quant-ph/0507173).
73. UNRUH, D. 2005. Quantum programs with classical output streams. In Proceedings of the 3rd International Workshop on Quantum Programming Languages. Electronic Notes in Theoretical Computer Science.
74. VAN DAM, W. 1996. Quantum cellular automata. Master's dissertation, Computer Science Nijmegen.
75. VAN DEN NEST, M., DEHAENE, J., AND DE MOOR, B. 2004a. An efficient algorithm to recognize local Clifford equivalence of graph states. Phys. Rev. A 70 (quant-ph/0405023).
76. VAN DEN NEST, M., DEHAENE, J., AND DE MOOR, B. 2004b. Graphical description of the action of local Clifford transformations on graph states. Phys. Rev. A 69 (quant-ph/0308151).
77. VAN TONDER, A. 2004. A lambda calculus for quantum computation. SIAM J. Comput. 33, 5 (quant-ph/0307150).
78. WATROUS, J. 1995. On one-dimensional quantum cellular automata. In Proceedings of FOCS'95 - Symposium on Foundations of Computer Science. LNCS.
79. WALTHER, P., RESCH, K. J., RUDOLPH, T., SCHENCK, E., WEINFURTER, H., VEDRAL, V., ASPELMEYER, M., AND ZEILINGER, A. 2005. Experimental one-way quantum computing. Nature 434 (quant-ph/0503126).