Quantum Programming With Mixed States

Electronic Notes in Theoretical Computer Science

Volumn 170, Issue , 2007, Pages 185-199

  Zuliani, Paolo ^a  

^a Princeton University   (United States)

Author keywords

mixed state; probabilistic computation; quantum circuit; Quantum programming

Indexed keywords

COMPUTATIONAL METHODS; NUMERICAL METHODS; PROBABILITY; QUANTUM THEORY;

MIXED STATES; PROBABILISTIC COMPUTATIONS; QUANTUM CIRCUITS; QUANTUM PROGRAMMING;

COMPUTER PROGRAMMING;

EID: 33847266718     PISSN: 15710661     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.entcs.2006.12.017     Document Type: Article

References (10)

1. Aharonov D., Kitaev A., and Nisan N. Quantum circuits with mixed states. STOC '98: Proceedings of the thirtieth annual ACM symposium on Theory of computing (1998), ACM Press 20-30
2. Bennett C.H. Logical reversibility of computation. IBM Journal of Research and Development 17 (1973) 525-532
3. Dijkstra E.W. Guarded commands, nondeterminacy and the formal derivation of programs. CACM 18 (1975) 453-457
4. Kraus K. State, Effects, and Operations. Lecture Notes in Physics volume 190 (1983), Springer-Verlag
5. Morgan C., and McIver A. pGCL: formal reasoning for random algorithms. South African Computer Journal 22 (1999) 14-27
6. Nielsen M.A., and Chuang I.L. Quantum computation and quantum information (2000), Cambridge University Press
7. Peres A. Quantum Theory: Concepts and Methods (1998), Kluwer Academic Publishers
8. Sanders J.W., and Zuliani P. Quantum programming. Mathematics of Program Construction. Springer-Verlag LNCS 1837 (2000) 80-99
9. Wootters W.K., and Zurek W.H. A single quantum cannot be cloned. Nature 299 5886 (1982) 802-803
10. Zuliani P. Logical reversibility. IBM Journal of Research and Development 45 6 (2001) 807-818