Computational lambda-calculus and monads
Proceedings of the Fourth Annual Symposium on Logic in computer science
Quantum circuits with mixed states
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Science of Computer Programming - Special issue on mathematics of program construction
Proceedings of the sixth ACM SIGPLAN international conference on Functional programming
Quantum computation and quantum information
Quantum computation and quantum information
Modeling quantum computing in Haskell
Haskell '03 Proceedings of the 2003 ACM SIGPLAN workshop on Haskell
Structure and interpretation of quantum mechanics: a functional framework
Haskell '03 Proceedings of the 2003 ACM SIGPLAN workshop on Haskell
A Lambda Calculus for Quantum Computation
SIAM Journal on Computing
Towards a quantum programming language
Mathematical Structures in Computer Science
A Functional Quantum Programming Language
LICS '05 Proceedings of the 20th Annual IEEE Symposium on Logic in Computer Science
A lambda calculus for quantum computation with classical control
Mathematical Structures in Computer Science
Quantum programming languages: survey and bibliography
Mathematical Structures in Computer Science
From Reversible to Irreversible Computations
Electronic Notes in Theoretical Computer Science (ENTCS)
Electronic Notes in Theoretical Computer Science (ENTCS)
A Symbolic Classical Computer Language for Simulation of Quantum Algorithms
QI '09 Proceedings of the 3rd International Symposium on Quantum Interaction
Categorical semantics for arrows
Journal of Functional Programming
The Arrow Calculus as a Quantum Programming Language
WoLLIC '09 Proceedings of the 16th International Workshop on Logic, Language, Information and Computation
Quantum Circuits: From a Network to a One-Way Model
Electronic Notes in Theoretical Computer Science (ENTCS)
Modelling Parallel Quantum Computing Using Transactional Memory
Electronic Notes in Theoretical Computer Science (ENTCS)
Monads need not be endofunctors
FOSSACS'10 Proceedings of the 13th international conference on Foundations of Software Science and Computational Structures
Proceedings of the 18th ACM SIGPLAN international conference on Functional programming
Hi-index | 0.00 |
We show that the model of quantum computation based on density matrices and superoperators can be decomposed into a pure classical (functional) part and an effectful part modelling probabilities and measurement. The effectful part can be modelled using a generalisation of monads called arrows. We express the resulting executable model of quantum computing in the Haskell programming language using its special syntax for arrow computations. However, the embedding in Haskell is not perfect: a faithful model of quantum computing requires type capabilities that are not directly expressible in Haskell.