Quantum programming

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1837, Issue , 2000, Pages 80-99

  Sanders, J W ^a   Zuliani, P ^a  

^a UNIVERSITY OF OXFORD   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

CALCULATIONS; QUANTUM COMPUTERS; QUANTUM THEORY; SEMANTICS; SPECIFICATIONS;

FORMAL SEMANTICS; QUANTUM ALGORITHMS; QUANTUM PROGRAMMING; REFINEMENT CALCULI; REPRESENTATIVE SELECTION;

FORMAL METHODS;

EID: 84976488196     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/10722010_6     Document Type: Conference Paper

References (32)

1. Greg Baker. http://www.ics.mq.edu.au/gregb/q-gol.
2. Adriano Barenco et al. Elementary gates of quantum computation. Physical Review A, 52(5): 3457-3467, 1995.
3. Adriano Barenco. A universal two-bit gate for quantum computation. Proc. R. Soc. Lond. A, 449: 679-683, 1995.
4. Michel Boyer, Gilles Brassard, Peter Hoyer and Alain Tapp. Tight bounds on quantum searching. In Fourth Workshop on Physics and Computation, editors T. Toffoli, M. Biaford and J. Lean, pages 36-43. New England Complex System Institute, 1996
5. Michael Butler and Pieter Hartel. Reasoning about Grover’s quantum search algorithm using probabilistic wp. University of Southampton technical report DSSETR-98-10, 1998.
6. R. Cleve, A. Ekert, C. Macchiavello and M. Mosca. Quantum algorithms revisited. Proc. R. Soc. Lond., A. 454: 339-354, 1998.
7. D. Deutsch. Quantum theory, the Church-Turing principle and the universal quantum computer. Proc. R. Soc. Lond. A, 400: 97-117, 1985.
8. D. Deutsch. Quantum computational networks. Proc. R. Soc. Lond. A, 425: 73-90, 1989.
9. David Deutsch, Adriano Barenco and Artur Ekert. Universality in quantum computation. Proc. R. Soc. Lond. A, 449: 669-677, 1995.
10. David Deutsch and Richard Jozsa. Rapid solution of problems by quantum computation. Proc. R. Soc. Lond. A, 439: 553-558, 1992.
11. E.W. Dijkstra. A Discipline of Programming. Prentice-Hall International, 1976.
12. Avshalom C. Elitzur and Lev Vaidman. Quantum mechanical interaction-free measurements. Foundations of Physics, 32(7): 987-997, 1993.
13. R.P. Feynman. The Feynman Lectures on Physics, volume 3. Addison-Wesley, 1964.
14. Lov K. Grover. A fast quantum mechanical algorithm for database search. In Proceedings of the 28th ACM STOC, pages 212-219, 1996.
15. Jozef Gruska. Quantum Computing. McGraw-Hill International (UK), Advanced Topics in Computer Science, 1999.
16. He Jifeng, K. Seidel and A.K. McIver. Probabilistic models for the guarded command language. Science of Computer Programming, 28: 171-192, 1997.
17. C. A. R. Hoare He Jifeng. The weakest prespecification, parts I and II. Fundamenta Informatica, IX, 51-84, 217-252, 1986.
18. Chris J. Isham. Lectures on Quantum Theory. Imperial College Press, 1995.
19. Richard Josza. Characterising classes of functions computable by quantum parallelism. Proc. R. Soc. Lond. A, 435: 563-574, 1991.
20. Carroll Morgan. Programming from Specifications, second edition. Prentice-Hall International, 1994.
21. K. Seidel, C. C. Morgan and A. K. McIver. Probabilistic imperative programming: a rigorous approach. 1996. Available at http//www.comlab.ox.ac.uk/oucl/research/areas/probs/bibliography.html.
22. Carroll Morgan, Annabelle McIver and Karen Seidel. Probabilistic predicate transformers. TOPLAS, 18(3): 325-353, 1996.
23. Carroll Morgan and Annabelle McIver. pGCL: formal reasoning for random algorithms. South African Computer Journal, 22: 14-27, 1999.
24. Carroll Morgan and A. K. McIver. Demonic, angelic and unbounded probabilistic choices in sequential programs. To appear in Acta Informatica; see the site at [23].
25. Michele Mosca and Artur Ekert. The hidden subgroup problem and eigenvalue estimation on a quantum computer. In Proceedings of the 1st NASA Internation Conference on Quantum Compuing and Quantum Communication. LNCS 1509, Springer-Verlag, 1998. 80
26. Bernhard Ömer. http://tph.tuwien.ac.at/oemer.
27. Asher Peres. Quantum Theory: Concepts and Methods. Kluwer Academic Publishers, 1998.
28. Benjamin Schumacher. Quantum coding. Physical Review A, 51(4): 2738-2747, 1995.
29. Peter W. Shor. Algorithms for quantum computation: discrete log and factoring. In Proceedings of the 35th IEEE FOCS, pages 124-134, 1994.
30. Daniel R. Simon. On the power of quantum computation. In Proceedings of the 35th IEEE FOCS, pages 116-123, 1994.
31. Colin P. Williams and Scott H. Clearwater. Explorations in Quantum Computing. Springer-Verlag, New York, 1998.
32. Paolo Zuliani. DPhil Thesis. Oxford University. In preparation.