Modeling quantum computing in Haskell

The paper develops a model of quantum computing from the perspective of functional programming. The model explains the fundamental ideas of quantum computing at a level of abstraction that is familiar to functional programmers. The model also illustrates some of the inherent difficulties in interpreting quantum mechanics and highlights the differences between quantum computing and traditional (functional or otherwise) computing models.

[1]  Samuel J. Lomonaco,et al.  Quantum Computation: A Grand Mathematical Challenge for the Twenty-First Century and the Millennium: American Mathematical Challenge Society, Short Course, January 17-18, 2000, Washington, DC , 2002 .

[2]  Edsger W. Dijkstra,et al.  A Discipline of Programming , 1976 .

[3]  Charles H. Bennett,et al.  Logical reversibility of computation , 1973 .

[4]  H. Everett.  "Relative State" Formulation of Quantum Mechanics , 1957 .

[5]  Peter W. Shor,et al.  Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer , 1995, SIAM Rev..

[6]  Henry G. Baker,et al.  NREVERSAL of Fortune - The Thermodynamics of Garbage Collection , 1992, IWMM.

[7]  Bernhard Ömer,et al.  A Procedural Formalism for Quantum Computing , 2002 .

[8]  Conor McBride.  Faking it: Simulating dependent types in Haskell , 2002, J. Funct. Program..

[9]  Jr.,et al.  A Rosetta Stone for Quantum Mechanics with an Introduction to Quantum Computation , 2000, quant-ph/0007045.

[10]  Ralph Johnson,et al.  design patterns elements of reusable object oriented software , 2019 .

[11]  A. Zeilinger,et al.  Speakable and Unspeakable in Quantum Mechanics , 1989 .

[12]  Louis H. Kauffman,et al.  Quantum Topology and Quantum Computing , 1999 .

[13]  D. Deutsch.  Quantum theory, the Church–Turing principle and the universal quantum computer , 1985, Proceedings of the Royal Society of London. A. Mathematical and Physical Sciences.

[14]  R. Mcweeny.  On the Einstein-Podolsky-Rosen Paradox , 2000 .

[15]  Peter Selinger,et al.  Towards a quantum programming language , 2004, Mathematical Structures in Computer Science.

[16]  A. Steane.  Quantum Computing , 1997, quant-ph/9708022.

[17]  香川 考司.  Mutable data structures and composable references in a pure functional language , 1996 .

[18]  Werner E. Kluge,et al.  A Reversible SE(M)CD Machine , 1999, IFL.

[19]  H. S. Allen.  The Quantum Theory , 1928, Nature.

[20]  Shirley Dex,et al.  JR 旅客販売総合システム（マルス）における運用及び管理について , 1991 .

[21]  Eleanor G. Rieffel,et al.  J an 2 00 0 An Introduction to Quantum Computing for Non-Physicists , 2002 .

[22]  Albert Einstein,et al.  Can Quantum-Mechanical Description of Physical Reality Be Considered Complete? , 1935 .

[23]  Shin-Cheng Mu,et al.  Functional Quantum Programming , 2001, APLAS.

[24]  Simon L. Peyton Jones,et al.  Template meta-programming for Haskell , 2002, Haskell '02.

[25]  J. Bell,et al.  Speakable and Unspeakable in Quatum Mechanics , 1988 .

[26]  Jerzy Karczmarczuk,et al.  Structure and interpretation of quantum mechanics: a functional framework , 2003, Haskell '03.

[27]  Harry Buhrman,et al.  Time and Space Bounds for Reversible Simulation , 2001, ICALP.

[28]  Michael P. Frank,et al.  Reversibility for efficient computing , 1999 .

[29]  J. Cramer,et al.  The transactional interpretation of quantum mechanics , 1986 .