A lambda calculus for quantum computation

SIAM Journal on Computing

Volumn 33, Issue 5, 2004, Pages 1109-1135

  Van Tonder, André ^a  

^a BROWN UNIVERSITY   (United States)

Author keywords

Lambda calculus; Linear logic; Models of computation; Quantum computation

Indexed keywords

LAMBDA CALCULUS; LINEAR LOGIC (LL); MODELS OF COMPUTATION (MOC); QUANTUM COMPUTATION (QC);

ALGEBRA; ALGORITHMS; COMPUTER PROGRAMMING LANGUAGES; COMPUTER SIMULATION; MANIPULATORS; MATHEMATICAL MODELS; NETWORKS (CIRCUITS); SEMANTICS; SOFTWARE PROTOTYPING;

QUANTUM THEORY;

EID: 8344245281     PISSN: 00975397     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0097539703432165     Document Type: Article

References (62)

1. P. BENIOFF, The computer as a physical system: A microscopic quantum mechanical Hamiltonian model of computers as represented by Turing machines, J. Stat. Phys., 22 (1980), pp. 563-591.
2. D. DEUTSCH, Quantum theory, the Church-Turing principle and the universal quantum computer, Proc. Roy. Soc. London A, 400 (1985), pp. 97-117.
3. D. DEUTSCH, Quantum computational networks, Proc. Roy. Soc. London A, 439 (1989), pp. 553-558.
4. A. YAO, Quantum circuit complexity, in Proceedings of the 34th Annual Symposium on the Foundations of Computer Science, IEEE Computer Society Press, Los Alamitos, CA, 1993, pp. 352-361.
5. M. A. NIELSEN AND I. L. CHUANG, Quantum Computation and Quantum Information, Cambridge University Press, Cambridge, UK, 2000.
6. H. P. BARENDREGT, The Lambda Calculus, North-Holland, Dordrecht, Netherlands, 1984.
7. J. C. MITCHELL, Foundations of Programming Languages, MIT Press, Cambridge, MA, 1996.
8. B. C. PIERCE, Types and Programming Languages, MIT Press, Cambridge, MA, 2002.
9. R. E. DAVIS, Truth, Deduction, and Computation: Logic and Semantics for Computer Science, Computer Science Press, New York, 1989.
10. C. A. GUNTER, Semantics of Programming Languages: Structures and Techniques, MIT Press, Cambridge, MA, 1992.
11. J. MCCARTHY, Recursive functions of symbolic expressions and their computation by machine, Part I, Commun. ACM, 3 (1960), pp. 184-195.
12. D. P. FRIEDMAN, M. WAND, AND C. T. HAYNES, Essentials of Programming Languages, MIT Press, Cambridge, MA, 1992.
13. L. C. PAULSON, ML for the Working Programmer, Cambridge University Press, Cambridge, UK, 1996.
14. P. HUDAK, The Haskell School of Expression, Cambridge University Press, Cambridge, UK, 2000.
15. J. BACKUS, Can programming be liberated from the Von Neumann style? A functional style and its algebra of programs, Commun. ACM, 21, 1978.
16. A. VAN TONDER, Quantum computation, categorical semantics, and linear logic, ArXiv.org e-print archive: arXiv:quant-ph/0312174 (2003).
17. A. CHURCH, An unsolvable problem in elementary number theory, Amer. J. Math., 58 (1936), pp. 354-363.
18. A. CHURCH, The Calculi of Lambda Vonversion, Princeton University Press, Princeton, NJ, 1941.
19. A. M. TURING, On computable numbers, with an application to the Entscheidungsproblem, Proc. London Math. Soc., 42 (1936), pp. 230-265; corrections in Proc. London Math. Soc., 43 (1937), pp. 544-546.
20. G. PLOTKIN, Call-by-name, call-by-value and the λ-calculus, Theoret. Comput. Sci., 1 (1976), pp. 125-159.
21. M. FELLEISEN AND R. HIEB, A revised report on the syntactic theories of sequential control and state, Theoret. Comput. Sci., 103 (1992), pp. 235-271.
22. O. KISELYOV, Many Faces of the Fixed-Point Combinator, http://okmij.org/ftp/Computation/fixed-point-combinators.html (Oct. 1999).
23. C. H. BENNETT, Logical reversibility of computation, IBM J. Res. Develop., 17 (1973), pp. 525-532.
24. A. BARENCO, C. H. BENNETT, R. CLEVE, D.P. DIVINCENZO, N. MARGOLUS, P. SCHOR, T. SLEATOR, J. SMOLIN, AND H. WEINFURTER, Elementary gates for quantum computation, Phys. Rev. A, 52 (1995), pp. 3457-3467.
25. P. O. BOYKIN, T. MOR, M. PULVER, V. ROYCHOWDHURY, AND F. VATAN, On Universal and Fault-Tolerant Quantum Computing, arXiv:quant-ph/9906054 (1999), http://www.arXiv.org.
26. S. ABRAMSKY, Computational interpretations of linear logic, Theoret. Comput. Sci., 111 (1993), pp. 3-57.
27. P. WADLER, A syntax for linear logic, in Mathematical Foundations of Programming Semantics: 9th International Conference, New Orleans, Proceedings 802, Springer-Verlag, New York, 1993, pp. 513-529.
28. J. MARAIST, M. ODERSKY, D. TURNER, AND P. WADLER, Call-by-name, call-by-value, call-by-need, and the linear lambda calculus, in 11th International Conference on the Mathematical Foundations of Programming Semantics, New Orleans, 1995.
29. R. A. G. SEELY, Linear logic, *-autonomous categories, and cofree coalgebras, in Categories in Computer Science and Logic, AMS Contemporary Mathematics 92, AMS, Providence, RI, 1989.
30. J.-Y. GIRARD, Linear logic, Theoret. Comput. Sci., 50 (1987), pp. 1-102.
31. P. WADLER, A taste of linear logic, in Proceedings of the 18th International Symposium on Mathematical Foundations of Computer Science, Gdánsk, Springer-Verlag, New York, 1993.
32. D. N. TURNER AND P. WADLER, Operational interpretations of linear logic, Theoret. Comput. Sci., 227 (1999), pp. 231-248.
33. J. CHIRIMAR, C. A. GUNTER, AND J. G. RIECKE, Reference counting as a computational interpretation of linear logic, J. Funct. Programming, 6 (1996), pp. 195-244.
34. C. H. BENNETT, G. BRASSARD, C. CRÉPEAU, R. JOZSA, A. PERES, AND W. WOOTTERS, Teleporting an unknown quantum state via dual classical and EPR channels, Phys. Rev. Lett., 70 (1993), pp. 1895-1899.
35. D. COPPERSMITH, An Approximate Fourier Transform Useful in Quantum Factoring, IBM Research Report RC 19642, IBM, White Plains, NY, 1994.
36. A. EKERT AND R. JOZSA, Shor's quantum algorithm for factorizing numbers, Rev. Mod. Phys., 68 (1996), pp. 733-753.
37. P. W. SHOR, Algorithms for quantum computation: Discrete log and factoring, in Proceedings of the 35th IEEE FOCS, 1994, pp. 124-134.
38. P. W. SHOR, Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer, SIAM J. Comput., 26 (1997), pp. 1484-1509.
39. E. BERNSTEIN AND U. VAZIRANI, Quantum complexity theory, SIAM J. Comput., 26 (1997), pp. 1411-1473.
40. C. H. BENNETT, E. BERNSTEIN, G. BRASSARD, AND U. VAZIRANI, Strengths and weaknesses of quantum computing, SIAM J. Comput., 26 (1997), pp. 1510-1523.
41. H. G. BAKER, Lively linear Lisp - Look Ma, no garbage!, ACM Sigplan Notices, 27 (1992), pp. 89-98.
42. H. G. BAKER, A Linear Logic quicksort, ACM Sigplan Notices, 29 (1994), pp. 13-18.
43. H. G. BAKER, Use-once variables and linear objects - storage management, reflection and multi-threading, ACM Sigplan Notices, 30 (1995), pp. 45-52.
44. S. ABRAMSKY, A Structural Approach to Reversible Computation, Research Report RR-01-09, Programming Research Group, Oxford University, Oxford, UK, 2001.
45. G. D. BAKER, Qgol: A System for Simulating Quantum Computations: Theory, Implementation, and Insights, Honors thesis, Macquarie University, New South Wales, Australia, 1996.
46. E. BARENDSEN AND S. SMETSERS, Conventional and Uniqueness Typing in Graph Rewrite Systems, Technical report CSI-R9328, Computing Science Institute, University of Nijmegen, Nijmegen, The Netherlands, 1993.
47. B. ÖMER, A Procedural Formalism for Quantum Computing, M.S. thesis, Technical University, Vienna, 1998; also available online from http://tph.tuwien.ac.at/~oemer/qcl.html.
48. B. ÖMER, Classical Concepts in Quantum Programming, arXiv:quant-ph/0211100 (2002), http://www.arXiv.org.
49. S. BETTELLI, T. CALARCO, AND L. SERAFINI, Towards an architecture for quantum programming, Eur. Phys. J. D, 25 (2003), pp. 181-200.
50. P. SELINGER, Towards a quantum programming language, Math. Structures Comput. Sci., to appear.
51. J. W. SANDERS AND P. ZULIANI, Quantum programming, in Mathematics of Program Construction, Lecture Notes in Comput. Sci. 1837, Springer, New York, 2000.
52. P. MAYMIN, Extending the Lambda Calculus to Express Randomized and Quantumized Algorithms, arXiv:quant-ph/9612052 (1996), http://www.arXiv.org.
53. P. MAYMIN, The Lambda-q Calculus Can Efficiently Simulate Quantum Computers, arXiv:quant-ph/9702057 (1997), http://www.arXiv.org.
54. M. WEHR, Quantum computing: A new paradigm and its type theory, Presented at Quantum Computing Seminar, Universität Karlsruhe, Germany, 1996.
55. S. ABRAMSKY AND B. COECKE, Physical traces: Quantum vs. classical information processing, Electron. Notes Theoret. Comput. Sci., 69, (2003).
56. E. KASHEFI, Quantum Domain Theory - Definitions and Applications, arXiv:quant-ph/0306077 (2003), http://www.arXiv.org.
57. D. DIEKS, Communication by EPR devices, Phys. Lett. A., 92 (1982), pp. 271-272.
58. W. K. WOOTTERS AND W. H. ZUREK, A single quantum cannot be cloned, Nature, 299 (1982), pp. 802-803.
59. H. B. CURRY AND R. FEYS, Combinatory Logic, vol. 1, North-Holland, Dordrecht, Netherlands, 1985.
60. W. A. HOWARD, The formulas-as-types notion of construction, in To H. B. Curry: Essays on Combinatory Logic, Lambda Calculus, and Formalism, J. P. Seldin and J. R. Hindley, eds., Academic Press, New York, 1980, pp. 479-490.
61. V. PRATT, Linear logic for generalized quantum mechanics, in Proceedings of Workshop on Physics and Computation, IEEE, Dallas, 1992, pp. 166-180.
62. S. SMETS, What has operational quantum logic to do with linear logic?, presented at Logic and Interaction Week 3, Marseilles, France, 2002.