Proof rules for the correctness of quantum programs

Theoretical Computer Science

Volumn 386, Issue 1-2, 2007, Pages 151-166

  Feng, Yuan ^a   Duan, Runyao ^a   Ji, Zhengfeng ^a   Ying, Mingsheng ^a  

^a TSINGHUA UNIVERSITY   (China)

Author keywords

Proof rules; Quantum loops; Quantum predicate; Quantum programming language

Indexed keywords

COMPUTER ARCHITECTURE; COMPUTER PROGRAMMING LANGUAGES; LOGIC PROGRAMMING; PROBABILISTIC LOGICS; SEMANTICS;

KNILLS ARCHITECTURES; PROOF RULES; QUANTUM LOOPS; QUANTUM PREDICATES; QUANTUM PROGRAMS;

QUANTUM COMPUTERS;

EID: 34648820090     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.tcs.2007.06.011     Document Type: Article

References (25)

1. Aharonov D., Ambainis A., Kempe J., and Vazirani U. Quantum walks on graphs. Proceedings of the 30th Annual ACM Symposium on Theory of Computation (2001), ACM Press, New York p. 50
2. Bettelli S., Calarco T., and Serafini L. Toward an architecture for quantum programming. European Physical Journal D 25 2 (2003) 181-200
3. Butler M., and Hartel P. Reasoning about grover's quantum search algorithm using probabilistic wp. ACM Transactions on Programming Languages and Systems 21 3 (1999) 417-429
4. E. D'Hondt, P. Panangaden, Quantum weakest preconditions, in: P. Selinger (Ed.), Proceedings of the 2nd Workshop on Quantum Programming Languages, QPL04, Turku Centre for Computer Science, 2004. See also Mathematical Structures in Computer Science, 2006
5. Dijkstra E.W. A Discipline of Programming (1976), Prentice-Hall
6. L.K. Grover, A fast quantum mechanical algorithm for database search, in: Proc. ACM STOC, 1996, pp. 212-219
7. Grover L.K. Quantum mechanics helps in searching for a needle in a haystack. Physical Review Letters 78 2 (1997) 325
8. C. Jones, Probabilistic nondeterminism, Ph.D. Thesis, Edinburgh University, NK, 1990. Monograph ECS-LFCS-90-105
9. C. Jones, G. Plotkin, A probabilistic powerdomain of evalutions, in: Proceeding of the 4th IEEE Annual Symposium on Logic in Computer Science, Los Alamitos, CA, 1989, pp. 186-195
10. Kemeny J., and Snell J. Finite Markov Chains (1983), Springer-Verlag
11. E.H. Knill, Conventions for quantum pseudocode, LANL Report LAUR-96-2724, 1996
12. Kraus K. States, Effects and Operations: Fundamental Notions of Quantum Theory (1983), Springer, Berlin
13. McIver A., and Morgan C. Partial correctness for probabilistic demonic programs. Theoretical Computer Science 266 (2001) 513-541
14. McIver A., and Morgan C. Abstraction, Refinement and Proof for Probabilistic Systems (2005), Springer-Verlag
15. C. Morgan, Proof rules for probabilistic loops, Technical Report PRG-TR-25-95, Programming Research Group, Oxford University, 1995
16. Morgan C., McIver A., and Seidel K. Probabilistic predicate transformers. ACM Transactions on Programming Languages and Systems 18 3 (1996) 325-353
17. B. Ömer, A procedural formalism for quantum computing, Master Thesis, Department of Theoretical Physics, Technical University of Vienna. http://tph.tuwien.ac.at/oemer/qcl.html, 1998
18. B. Ömer, Structured quantum programming, Ph.D. Thesis, Department of Theoretical Physics, Technical University of Vienna, 2003
19. Sanders J.W., and Zuliani P. Quantum programming. Mathematics of Program Construction 1837 (2000) 80-99
20. Selinger P. A brief survey of quantum programming languages. Functional and Logic Programming 2998 (2004) 1-6
21. Selinger P. Towards a quantum programming language. Mathematical Structures in Computer Science 14 4 (2004) 527-586
22. P.W. Shor, Algorithms for quantum computation: Discrete log and factoring, in: Proceedings of the 35th IEEE FOCS, 1994, pp. 124-134
23. M. Ying, Y. Feng, Quantum loop programs, 2006. See http://arxiv.org/abs/quant-ph/0605218 (under review)
24. P. Zuliani, Quantum programming, Ph.D. Thesis, Oxford University, 2001
25. P. Zuliani, Non-deterministic quantum programming, in: Proc. QPL 2004, 2004, pp. 179-195