Quantum programming languages: Survey and bibliography

Mathematical Structures in Computer Science

Volumn 16, Issue 4, 2006, Pages 581-600

  Gay, Simon J ^a  

^a UNIVERSITY OF GLASGOW   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 33750710445     PISSN: 09601295     EISSN: None     Source Type: Journal    
DOI: 10.1017/S0960129506005378     Document Type: Conference Paper

References (111)

1. Abramsky, S. (2004) High-level methods for quantum computation and information. In: Proceedings of the 19th Annual IEEE Symposium on Logic in Computer Science, IEEE Computer Society.
2. Abramsky, S. (2005) Abstract scalars, loops and free traced and strongly compact closed categories. In: Proceedings of the First Conference on Algebra and Coalgebra in Computer Science. Springer-Verlag Lecture Notes in Computer Science 3629 1-31.
3. Abramsky, S. and Coecke, B. (2003) Physical traces : Quantum vs. classical information processing. In: Proceedings of the 9th Conference on Category Theory and Computer Science (CTCS 2002). Electronic Notes in Theoretical Computer Science 69. (Also available as arXiv:cs.CG/0207057.)
4. 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, IEEE Computer Society. (Also available as arXiv:quant-ph/ 0402130.)
5. Abramsky, S. and Coecke, B. (2005) Abstract physical traces. Theory and Applications of Categories 14(6) 111-124.
6. Abramsky, S. and Duncan, R. (2006) A categorical quantum logic. Mathematical Structures in Computer Science 16 (3) 469-489. (Preliminary version in Selinger (2004b).)
7. Adão, P. and Mateus, P. (2005) A process algebra for reasoning about quantum security. In: Selinger (2005b).
8. Aho, A. and Svore, K. (2003) Compiling quantum circuits using the palindrome transform. arXiv:quant-ph/0311008.
9. Albert, D.Z. (1983) On quantum-mechanical automata. Physics Letters A 98 (5-6) 249-252.
10. Altenkirch, T. and Grattage, J. (2005a) A functional quantum programming language. In: Proceedings of the 20th Annual IEEE Symposium on Logic in Computer Science, IEEE Computer Society. (Also available as arXiv:quant-ph/0409065.)
11. Altenkirch, T. and Grattage, J. (2005b) QML: Quantum data and control. Manuscript.
12. Altenkirch, T., Grattage, J., Vizzotto, J. K. and Sabry, A. (2006) An algebra of pure quantum programming. Submitted to Mathematical Structures in Computer Science. (Preliminary version in Selinger (2005b); also available as arXiv:quant-ph/0506012.)
13. Arrighi, P. (2003) Quantum computation explained to my mother. Bulletin of the EATCS 80. (Also available as arXiv:quant-ph/0305045.)
14. Arrighi, P. and Dowek, G. (2004) Operational semantics for formal tensorial calculus. In: Selinger (2004b).
15. Arrighi, P. and Dowek, G. (2005) Linear-algebraic λ-calculus. arXiv:quant-ph/0501150.
16. Baker, G. (1996) Qgol: a system for simulating quantum computations: theory, implementation and insight. Honours thesis, Macquarie University; available as www.ifost.org.au/~gregb/q-gol/QgolThesis.pdf.
17. Baltag, A. and Smets, S. (2006) LQP: the dynamic logic of quantum information. Mathematical Structures in Computer Science 16 (3) 491-525. (Preliminary version in Selinger (2004b).)
18. Benioff, P. (1980) The computer as a physical system: A microscopic quantum mechanical Hamiltonian model of computers as represented by Turing machines. Journal of Statistical Physics 22 (5) 563-591.
19. Bennett, C. H. and Brassard, G. (1984) Quantum Cryptography: Public-key Distribution and Coin Tossing. In: Proceedings of the IEEE International Conference on Computer Systems and Signal Processing 175-179.
20. Bernstein, E. and Vazirani, U. (1993) Quantum complexity theory. In: Proceedings of the ACM Symposium on Theory of Computing, ACM Press.
21. Bernstein, E. and Vazirani, U. (1997) Quantum complexity theory. SIAM Journal on Computing 26 (5) 1411-1473.
22. Bettelli, S., Calarco, T. and Serafini, L. (2003) Toward an architecture for quantum programming. The European Physical Journal D 25 181-200.
23. Blute, R. F., Ivanov, I. T. and Panangaden, P. (2003) Discrete quantum causal dynamics. International Journal of Theoretical Physics 42 2025-2041. (Also available as arXiv:gr-qc/0109053.)
24. Brunet, O. and Jorrand, P. (2004) Dynamic quantum logic for quantum programs. International Journal of Quantum Information 2 (1) 45-54. (Also available as arXiv:quant-ph/0311143.)
25. Coecke, B. (2004a) The logic of entanglement. arXiv:quant-ph/0402014.
26. Coecke, B. (2004b) Quantum information-flow, concretely, abstractly. In: Selinger (2004b).
27. Coecke, B. (2005) De-linearizing linearity I: Projective quantum axiomatics from strong compact closure. In: Selinger (2005b). (Also available as arXiv:quant-ph/0506134.)
28. Danos, V., D'Hondt, E., Kashefi, E. and Panangaden, P. (2005a) Distributed measurement-based quantum computation. In: Selinger (2005b). (Also available as arXiv:quant-ph/0506070.)
29. Danos, V. and Kashefi, E. (2005a) Determinism in the one-way model. arXiv:quant-ph/0506062.
30. Danos, V. and Kashefi, E. (2005b) Pauli measurements are universal. In: Selinger (2005b).
31. Danos, V., Kashefi, E. and Panangaden, P. (2004) The measurement calculus. arXiv:quant-ph/0412135.
32. Danos, V., Kashefi, E. and Panangaden, P. (2005b) 1-qubit versus 2-qubit measurement-based quantum computation. Manuscript.
33. Danos, V., Kashefi, E. and Panangaden, P. (2005c) Parsimonious and robust realisations of unitary maps in the one-way model. Physical Review A 72 (064301). (Also available as arXiv:quant-ph/0411071.)
34. Deutsch, D. (1985) Quantum theory, the Church-Turing principle and the universal quantum computer. Proceedings of the Royal Society of London A 400 97-117.
35. D'Hondt, E. (2005) Distributed quantum computation: a measurement-based approach, Ph.D. thesis, Vrije Universiteit Brussel.
36. D'Hondt, E. and Panangaden, P. (2006) Quantum weakest preconditions. Mathematical Structures in Computer Science 16 (3) 429-451. (Preliminary version in Selinger (2004b); also available as arXiv:quant-ph/0501157.)
37. Di Pierro, A. and Wiklicky, H. (2001) Quantum constraint programming. In: Proceedings of the APPSIA-GULP-PRODE Joint Conference on Declarative Programming. Online proceedings at http://www.di.uevora.pt/~agp01/accepted.html.
38. Duncan, R. (2004) Believe it or not, Bell states are a model of multiplicative linear logic. Technical Report PRG-RR-04-18, Programming Research Group, Oxford University Computing Laboratory.
39. Edalat, A. (2004) An extension of Gleason's theorem for quantum computation. International Journal of Theoretical Physics 43 (7-8) 1827-1840. (Also available as arXiv:quant-ph/0311070.)
40. Feng, Y., Duan, R., Ji, Z. and Ying, M. (2005) Semantics of a purely quantum programming language. arXiv:cs.PL/0507043.
41. Feynman, R. P. (1982) Simulating physics with computers. International Journal of Theoretical Physics 21 (6-7) 467-488.
42. Gay, S. J. and Nagarajan, R. (2005) Communicating quantum processes. In: Proceedings of the 32nd ACM SIGACT-SIGPLAN Symposium on Principles of Programming Languages, ACM Press. (Preliminary version in Selinger (2004b); also available as arXiv:quant-ph/0409052.)
43. Gay, S. J. and Nagarajan, R. (2006) Types and typechecking for Communicating Quantum Processes. Mathematical Structures in Computer Science 16 (3) 375-406.
44. Girard, J.-Y. (2004) Between logic and quantic: a tract. In: Linear Logic in Computer Science. London Mathematical Society Lecture Notes 316 346-381.
45. Glendinning, I. (2005) Quantum programming languages and tools. Online catalogue at www.vcpc.univie.ac.at/~ian/hotlist/qc/programming.shtml.
46. Grädel, E. and Nowack, A. (2003) Quantum computing and abstract state machines. In: Abstract State Machines - Advances in Theory and Applications. Springer-Verlag Lecture Notes in Computer Science 2589 309-323.
47. Grattage, J. and Altenkirch, T. (2005) A compiler for a functional quantum programming language. Manuscript.
48. Grover, L. (1996) A fast quantum mechanical algorithm for database search. In: Proceedings of the 28th Annual ACM Symposium on the Theory of Computation, ACM Press 212-219. (Also available as arXiv:quant-ph/9605043.)
49. Gruska, J. (1999) Quantum Computing, McGraw-Hill.
50. Heller, K., Svore, K. and Kamvar, M. (2002) Q-HSK: a quantum simulation language. Manuscript available as www.es.columbia.edu/~mkamvar/prev_work/cs4115/ PLT_final_writeup.ps.
51. Iriyama, S., Ohya, M. and Volovich, I. (2004) Generalized quantum Turing machine and its application to the SAT chaos algorithm. arXiv:quant-ph/0405191.
52. Jorrand, P. and Lalire, M. (2004) Toward a quantum process algebra. In: Proceedings of the 1st ACM Conference on Computing Frontiers, ACM Press. (Also available as arXiv:quant-ph/0312067.)
53. Karczmarczuk, J. (2003) Structure and interpretation of quantum mechanics - a functional framework. In: Proceedings of the ACM SIGPLAN Workshop on Haskell, ACM Press.
54. Kashefi, E. (2003a) Complexity Analysis and Semantics for Quantum Computing, Ph.D. thesis, Imperial College London.
55. Kashefi, E. (2003b) Quantum domain theory - definitions and applications. In: Proceedings of the International Conference on Computability and Complexity in Analysis, Fernuniversität Hagen Informatik Berichte 302 8/2003. (Also available as arXiv:quant-ph/0306077.)
56. Knill, E. (1996) Conventions for quantum pseudocode. Technical Report LAUR-96-2724, Los Alamos National Laboratory.
57. Lalire, M. (2005) A probabilistic branching bisimulation for quantum processes. arXiv:quant-ph/0508116.
58. Lalire, M. (2006) Relations among quantum processes: bisimilarity and congruence. Mathematical Structures in Computer Science 16 (3) 407-428.
59. Lalire, M. and Jorrand, P. (2004) A process algebraic approach to concurrent and distributed computation: operational semantics. In: Selinger (2004b). (Also available as arXiv:quant-ph/0407005.)
60. Mateus, P. and Sernadas, A. (2006) Weakly complete axiomatization of exogenous quantum propositional logic. To appear in Information and Computation. (Also available as arXiv:math.LO/0503453.)
61. Mauerer, W. (2005) Semantics and Simulation of Communication in Quantum Computing. Master's thesis, University Erlangen-Nuremberg.
62. Maymin, P. (1996) Extending the lambda calculus to express randomized and quantumized algorithms. arXiv:quant-ph/9612052.
63. Maymin, P. (1997) The lambda-q calculus can efficiently simulate quantum computers. arXiv:quant-ph/9702057.
64. Mu, S.-C. and Bird, R. (2001) Functional quantum programming. In: Proceedings of the 2nd Asian Workshop on Programming Languages and Systems.
65. Nagarajan, R., Papanikolaou, N. and Williams, D. (2005) Simulating and compiling code for the sequential quantum random access machine. In: Selinger (2005b).
66. Nielsen, M. A. and Chuang, I. L. (2000) Quantum Computation and Quantum Information, Cambridge University Press.
67. Ömer, B. (1998) A Procedural Formalism for Quantum Computing. Master's thesis, Department of Theoretical Physics, Technical University of Vienna.
68. Ömer, B. (2000) Quantum Programming in QCL. Master's thesis, Institute of Information Systems, Technical University of Vienna.
69. Ömer, B. (2001) Procedural quantum programming. In: Proceedings of the AIP Conference on Computing Anticipatory Systems, American Institute of Physics.
70. Ömer, B. (2002) Classical concepts in quantum programming. arXiv:quant-ph/0211100.
71. Ömer, B. (2003) Structured Quantum Programming, Ph.D. thesis, Technical University of Vienna.
72. Papanikolaou, N. K. (2004) Techniques for Design and Validation of Quantum Protocols. Master's thesis, University of Warwick.
73. Perdrix, S. (2005) Quantum patterns and types for entanglement and separability. In: Selinger (2005b).
74. Perdrix, S. and Jorrand, P. (2004a) Classically-controlled quantum computation. arXiv:quant-ph/0407008.
75. Perdrix, S. and Jorrand, P. (2004b) Measurement-based quantum Turing machines and questions of universalities. arXiv:quant-ph/0402156.
76. Perdrix, S. and Jorrand, P. (2004c) Measurement-based quantum Turing machines and their universality. arXiv:quant-ph/0404146.
77. Petersen, A. and Oskin, M. (2003) A new algebraic foundation for quantum programming languages. In: Proceedings of the 2nd Workshop on Non-Silicon Computing.
78. Pratt, V. (1992) Linear logic for generalized quantum mechanics. In: Proceedings of the IEEE Workshop on Physics and Computation.
79. Preskill, J. (1998) Lecture notes for physics 219: Quantum information and computation. Available from www.theory.caltech.edu/people/preskill/ph219.
80. Rieffel, E. G. and Polak, W. (2000) An introduction to quantum computing for non-physicists. ACM Computing Surveys 32 (3) 300-335. (Also available as arXiv:quant-ph/9809016.)
81. Sabry, A. (2003) Modelling quantum computing in Haskell. In: Proceedings of the ACM SIGPLAN Workshop on Haskell, ACM Press.
82. Sanders, J.W. and Zuliani, P. (2000) Quantum programming. In: Mathematics of Program Construction. Springer-Verlag Lecture Notes in Computer Science 1837.
83. Selinger, P. (2004a) A brief survey of quantum programming languages. In: Proceedings of the 7th International Symposium on Functional and Logic Programming. Springer-Verlag Lecture Notes in Computer Science 2998.
84. Selinger, P. (ed.) (2004b) Proceedings of the 2nd International Workshop on Quantum Programming Languages, TUCS General Publications 33, Turku Centre for Computer Science.
85. Selinger, P. (2004c) Towards a quantum programming language. Mathematical Structures in Computer Science 14 (4) 527-586.
86. Selinger, P. (2004d) Towards a semantics for higher-order quantum computation. In: Selinger (2004b).
87. Selinger, P. (2005a) Dagger compact closed categories and completely positive maps. In: Selinger (2005b).
88. Selinger, P. (ed.) (2005b) Proceedings of the 3rd International Workshop on Quantum Programming Languages. Electronic Notes in Theoretical Computer Science.
89. Selinger, P. and Valiron, B. (2005) A lambda calculus for quantum computation with classical control. In: Proceedings of the 7th International Conference on Typed Lambda Calculi and Applications (TLCA). Springer-Verlag Lecture Notes in Computer Science 3461. (Also available as arXiv:cs.LO/0404056.)
90. Selinger, P. and Valiron, B. (2006) A lambda calculus for quantum computation with classical control. Mathematical Structures in Computer Science 16 (3) 527-552.
91. Shor, P.W. (1994) Algorithms for quantum computation: discrete logarithms and factoring. In: Proceedings of the 35th Annual IEEE Symposium on Foundations of Computer Science, IEEE Press 124-134.
92. Skibiński, J. (2001) Haskell simulator of quantum computer. Available from web.archive.org/web/20010630025035/www.numeric-quest.com/haskell.
93. Svore, K., Aho, A., Cross, A., Chuang, I. and Markov, I. (2006) A layered software architecture for quantum computing design tools. Computer 39 (1) 74-83.
94. Svore, K., Cross, A., Aho, A., Chuang, I. and Markov, I. (2004) Toward a software architecture for quantum computing design tools. In: Selinger (2004b).
95. Tafliovich, A. (2004) Quantum Programming. Master's thesis, University of Toronto.
96. Udrescu, M., Prodan, L. and Vlǎduţiu, M. (2004) Using HDLs for describing quantum circuits: a framework for efficient quantum algorithm simulation. In: Proceedings of the 1st ACM Conference on Computing Frontiers, ACM Press.
97. Unruh, D. (2005) Quantum programs with classical output streams. In: Selinger (2005b).
98. Valiron, B. (2004a) A functional programming language for quantum computation with classical control. Master's thesis, University of Ottawa.
99. Valiron, B. (2004b) Quantum typing. In: Selinger (2004b).
100. van Tonder, A. (2003) Quantum computation, categorical semantics and linear logic. arXiv:quant-ph/0312174.
101. van Tonder, A. (2004) A lambda calculus for quantum computation. SIAM Journal on Computing 33 (5) 1109-1135. (Also available as arXiv:quant-ph/ 0307150.)
102. Vizzotto, J.K., Altenkirch, T. and Sabry, A. (2006) Structuring quantum effects: Superoperators as arrows. Mathematical Structures in Computer Science 16 (3) 453-468. (Also available as arXiv:quant-ph/0501151.)
103. Vizzotto, J. K. and da Rocha Costa, A. C. (2005) Concurrent quantum programming in Haskell. In: VII Congresso Brasileiro de Redes Neurais, Sessão de Computação Quântica.
104. Wehr, M. (1996) Quantum computing: a new paradigm and its type theory. Lecture given at the Quantum Computing Seminar, Lehrstuhl Prof. Beth, Universität Karlsruhe.
105. Wiesner, S. (1983) Conjugate coding. SIGACT News 15 (1) 78-88. (Original manuscript written circa 1970.)
106. Williams, D. (2004) Quantum Computer Architecture, Assembly Language and Compilation. Master's thesis, University of Warwick.
107. Yao, A.C. (1993) Quantum circuit complexity. In: Proceedings of the 34th Annual IEEE Symposium on Foundations of Computer Science, IEEE Press 352-361.
108. Zuliani, P. (2001) Quantum Programming, U.Phil, thesis, University of Oxford.
109. Zuliani, P. (2004) Non-deterministic quantum programming. In: Selinger (2004b).
110. Zuliani, P. (2005a) Compiling quantum programs. Acta Informatica 41 (7-8) 435-474.
111. Zuliani, P. (2005b) Quantum programming with mixed states. In: Selinger (2005b).