Quantum Arrows in Haskell

Authors:
Juliana Kaizer Vizzotto;Antônio Carlos da Rocha Costa;Amr Sabry
Affiliations:
Federal University of Rio Grande do Sul, Brazil, Catholic University of Pelotas, Brazil;Federal University of Rio Grande do Sul, Brazil, Catholic University of Pelotas, Brazil;Indiana University, USA
Venue:
Electronic Notes in Theoretical Computer Science (ENTCS)
Year:
2008

Citing 8
Cited 0

Computational lambda-calculus and monads

Proceedings of the Fourth Annual Symposium on Logic in computer science
Notions of computation and monads

Information and Computation
Generalising monads to arrows

Science of Computer Programming - Special issue on mathematics of program construction
A new notation for arrows

Proceedings of the sixth ACM SIGPLAN international conference on Functional programming
Communicating quantum processes

Proceedings of the 32nd ACM SIGPLAN-SIGACT symposium on Principles of programming languages
A Functional Quantum Programming Language

LICS '05 Proceedings of the 20th Annual IEEE Symposium on Logic in Computer Science
Structuring quantum effects: superoperators as arrows

Mathematical Structures in Computer Science
Quantum Programs With Classical Output Streams

Electronic Notes in Theoretical Computer Science (ENTCS)

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.