%0 Journal Article
%@holdercode {isadg {BR SPINPE} ibi 8JMKD3MGPCW/3DT298S}
%@nexthigherunit 8JMKD3MGPCW/3EUFCFP
%@archivingpolicy denypublisher allowfinaldraft
%@issn 1571-0661
%@usergroup administrator
%@usergroup seeger05
%3 Quantum Arrows in Haskell Vizzotto_2008_Electronic-Notes-in-Theoretical-Computer-Science.pdf
%X We argue that a realistic model for quantum computations should be general with respect to measurements, and complete with respect to the information flow between the quantum and classical worlds. We discuss two alternative models for general and complete quantum computations based on probability distributions of quantum state vectors and on density matrices with classical outputs. We show that both models can be structured using a generalization of monads called arrows.
%8 July
%N 11
%T Quantum Arrows in Haskell
%@electronicmailaddress juvizzotto@gmail.com
%@secondarytype PRE PI
%K Quantum programming, density matrices, probabilities.
%@visibility shown
%@group RSU-CIE-INPE-MCT-BR
%@secondarykey INPE--PRE/
%2 sid.inpe.br/mtc-m17@80/2008/01.15.23.36.36
%@affiliation Instituto Nacional de Pesquisas Espaciais (INPE)
%B Electronic Notes in Theoretical Computer Science
%P 139-152
%4 sid.inpe.br/mtc-m17@80/2008/01.15.23.36
%D 2008
%V V. 210
%@doi 10.1016/j.entcs.2008.04.023
%A Vizzotto, Juliana Kaizer,
%@area CEA