16 references, page 1 of 2 [1] D. Aharonov, A. Ambainis, J. Kempe and U. Vazirani, Quantum walks on graphs, Proceedings of the 33rd ACM Symposium on Theory of Computing (STOC), 2001, pp. 50-59.

[3] T. Altenkirch, J. Grattage, J. K. Vizzotto and A. Sabry, An algebra of pure quantum programming, Electronic Notes in Theoretical Computer Science, 170(2007)23-47.

[4] A. Ambainis, E. Bach, A. Nayak, A. Vishwanath and J. Watrous, One-dimensional quantum walks, Proceedings of the 33rd ACM Symposium on Theory of Computing (STOC), 2001, pp. 37-49.

[5] E. D'Hondt and P. Panangaden, Quantum weakest preconditions, Mathematical Structures in Computer Science, 16(2006)429-451.

[6] E. W. Dijkstra, Guarded commands, nondeterminacy and formal derivation of programs, Communications of the ACM, 18(1975)453-457.

[7] S. Gay, Quantum programming languages: survey and bibliography, Mathematical Structures in Computer Science, 16(2006)581-600.

[8] E. H. Knill, Conventions for quantum pseudocode, Technical Report LAUR-96-2724, Los Alamos National Laboratory, 1996.

[9] M. Lampis, K. G. Ginis, M. A. Papakyriakou and N. S. Papaspyrou, Quantum data and control made easier, Electronic Notes in Theoretical Computer Science, 210(2008)85- 105.

[10] A. McIver and C. Morgan, Abstraction, Refinement and Proof for Probabilistic Systems, Springer, New York, 2005.

[11] M. A. Nielsen and I. L. Chuang, Quantum Computation and Quantum Information, Cambridge University Press, Cambridge (2000)