Quantum weakest preconditions

Mathematical Structures in Computer Science

Volumn 16, Issue 3, 2006, Pages 429-451

  D'Hondt, Ellie ^a   Panangaden, Prakash ^b  

^a VRIJE UNIVERSITEIT BRUSSEL   (Belgium)

^b MCGILL UNIVERSITY   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 33750713342     PISSN: 09601295     EISSN: None     Source Type: Journal    
DOI: 10.1017/S0960129506005251     Document Type: Conference Paper

References (26)

1. Beltag, A. and Smets, S. (2006) LQP: The dynamic logic of quantum information. Mathematical Structures in Computer Science 16 (3) 491-525.
2. Butler, M.J. and Hartel, P.H. (1999) Reasoning about Graver's quantum search algorithm using probabilistic wp. ACM transactions on programming languages and systems 21 (3) 417-430.
3. Danos, V., Kashefi, E. and Panangaden, P. (2004) The measurement calculus, quant-ph/0412135.
4. Deutsch, D. (1985) Quantum theory, the Church-Turing principle and the universal quantum computer. Proc. R. Soc. Land. A400 97-117.
5. Deutsch, D. and Jozsa, R. (1992) Rapid solution of problems by quantum computation. Proc. R. Soc. Lond. A 439-553.
6. Dijkstra, E.W. (1976) A Discipline of Programming, Prentice-Hall.
7. Edalat, A. (2004) An extension of Gleason's theorem for quantum computation. Int. J. of Theor. Phys. (to appear).
8. Gottesman, D. (1999) The Heisenberg representation of quantum computers. In : Corney, S. P., Delbourgo, R. and Jarvis, P.D. (eds.) Proceedings of the XXII International Colloquium on Group Theoretical Methods in Physics, International Press 32-43.
9. Gries, D. (1981) The Science of Programming, Springer-Verlag.
10. Grover, L. K. (1996) A fast quantum mechanical algorithm for database search. In: ACM Symposium on Theory of Computing 212-219.
11. Hoare, C. (1969) An axiomatic basis for computer programming. Communications of the ACM 12 (10) 576-580.
12. Johnstone, P. (1982) Stone Spaces, Cambridge Studies in Advanced Mathematics 3, Cambridge University Press.
13. Kozen, D. (1981) Semantics of probabilistic programs. Journal of Computer and Systems Sciences 22 328-350.
14. Kozen, D. (1985) A probabilistic PDL. Journal of Computer and Systems Sciences 30 (2) 162-178.
15. Löwner, K. (1934) Uber monotone matrixfunktionen. Mathematische Zeitschrift 38 177-216.
16. Morgan, C. and McIver, A. (2004) Abstraction, refinement and proof for probabilistic systems, Springer-Verlag.
17. Nielsen, M. A. and Chuang, I. (2000) Quantum computation and quantum information, Cambridge University Press.
18. Peres, A. (1995) Quantum Theory: Concepts and Methods, Kluwer Academic Publishers.
19. Plotkin, G. D. (1983) Lecture notes on domain theory.
20. Raussendorf, R. and Briegel, H. J. (2001) A one-way quantum computer. Phys. Rev. Lett. 86 (22) 5188-5191.
21. Raussendorf, R., Browne, D. E. and Briegel, H. J. (2003) Measurement-based quantum computation on cluster states. Phys. Rev. A 68 (2) 022312.
22. Sanders, J.W. and Zuliani, P. (2000) Quantum programming. In: Mathematics of Program Construction. Springer-Verlag Lecture Notes in Computer Science 1837 80-99.
23. Selinger, P. (2004) Towards a quantum programming language. Mathematical Structures in Computer Science 14 527-586.
24. Shaji, A. and Sudarshan, E. (2005) Who's afraid of not completely positive maps? Phys. Lett. A 341 48-54.
25. Shor, P.W. (1994) Algorithms for quantum computation: Discrete logarithms and factoring. In: IEEE Symposium on Foundations of Computer Science 124-134.
26. Smyth, M. (1983) Powerdomains and predicate transformers. In: Diaz, J. (ed.) Proceedings of the International Colloquium On Automata Languages And Programming. Springer-Verlag Lecture Notes in Computer Science 154 662-676.