Modeling Quantum Computing in Haskell

Proceedings of the 2003 ACM SIGPLAN Haskell Workshop

Volumn , Issue , 2003, Pages 39-49

  Sabry, Amr ^a  

^a INDIANA UNIVERSITY   (United States)

Author keywords

Adaptor; Entanglement; Haskell; Quantum Computing; Qubit; Virtual Value

Indexed keywords

ABSTRACTING; BOOLEAN ALGEBRA; COMPUTATION THEORY; COMPUTER SYSTEMS; DATA STRUCTURES; MATHEMATICAL MODELS; MATHEMATICAL OPERATORS; VECTORS; FUNCTIONAL PROGRAMMING; QUANTUM COMPUTERS;

ADAPTORS; ENTANGLEMENT; HASKELL; QUANTUM COMPUTING; QUBIT; VIRTUAL VALUE; COMPUTING MODEL; LEVEL OF ABSTRACTION; QUANTUM MECHANICS;

QUANTUM THEORY; QUANTUM ENTANGLEMENT;

EID: 1542642873     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/871895.871900     Document Type: Conference Paper

References (29)

1. H. G. Baker. NREVERSAL of fortune - the thermodynamics of garbage collection. In Y. Bekkers and J. Cohen, editors, Memory Management; International Workshop IWMM 92; Proceedings, pages 507-524, Berlin, Germany, 1992. Springer-Verlag.
2. J. S. Bell. On the Einstein-Podolsky-Rosen paradox. In [3], pages 14-21. Cambridge University Press, 1987.
3. J. S. Bell. Speakable and Unspeakable in Quantum Mechanics. Cambridge University Press, 1987.
4. C. H. Bennett. Logical reversibility of computation. IBM Journal of Research and Development, 17(6):525-532, Nov. 1973.
5. H. Buhrman, J. Tromp, and P. Vitányi. Time and space bounds for reversible simulation. Lecture Notes in Computer Science, 2076:1017-1027, 2001.
6. J. G. Cramer. The transactional interpretation of quantum mechanics. Modern Physics, 58:647-688, 1986.
7. D. Deutsch. Quantum theory, the Church-Turing principle and the universal quantum computer. Proc. Roy. Soc. London, Ser. A, 400:97-117, 1985.
8. E. W. Dijkstra. A Discipline of Programming, chapter 14. Prentice-Hall, Englewood Cliffs, N. J., 1976.
9. A. Einstein, B. Podolsky, and N. Rosen. Can quantum-mechanical description of physical reality be considered complete? Phys. Rev., 47:777-780, 1935.
10. H. Everett, III. "Relative state" formulation of quantum mechanics. Reviews of Modern Physics, 29:454, 1957.
11. M. P. Frank. Reversibility for Efficient Computing. PhD thesis, MIT, 1999.
12. E. Gamma, R. Helm, R. Johnson, and J. Vlissides. Design Patterns: Elements of Reusable Object-Oriented Software. Professional Computing Series. Addison-Wesley, 1995.
13. R. Hinze. Haskell does it with class. Slides of a talk given at the Generic Haskell meeting, May 2001.
14. K. Kagawa. Mutable data structures and composable references in a pure functional language. In State in Programming Languages (SIPL'95), pages 79-94, Jan. 1995.
15. J. Karczmarczuk. Structure and interpretation of quantum mechanics - a functional framework. In ACM SIGPLAN Haskell Workshop, 2003.
16. L. H. Kauffman. Quantum Topology and Quantum Computing, chapter IV of [18]. American Mathematical Society, 2002.
17. W. Kluge. A reversible SE(M)CD machine. In 11th International Workshop on the Implementation of Functional Languages, Lochem, The Netherlands, September 7-10, 1999, number 1868 in Lecture Notes in Computer Science, pages 95-113. Springer-Verlag, Sept. 2000.
18. S. J. Lomonaco, Jr., editor. Quantum Computation: A Grand Mathematical Challenge for the Twenty-First Century and the Millennium, volume 58 of Proceedings of Symposia in Applied Mathematics, American Mathematical Society, Mar. 2002.
19. S. J. Lomonaco, Jr. A Rosetta Stone for Quantum Mechanics with an Introduction to Quantum Computation, chapter I of [18]. American Mathematical Society, 2002.
20. C. MCBride. Faking it - simulating dependent types in Haskell. Journal of Functional Programming, 12(4&5):375-392, July 2002.
21. S.-C. Mu and R. Bird. Functional quantum programming. In Second Asian Workshop on Programming Languages and Systems, KAIST, Korea, Dec. 2001.
22. B. Ömer. A procedural formalism for quantum computing. Master's thesis, Department of Theoretical Physics, Technical University of Vienna, 1998.
23. E. Rieffel and W. Polak. An introduction to quantum computing for non-physicists. ACM Computing Surveys, 32(3):300-335, Sept. 2000.
24. P. Selinger. Towards a quantum programming language. Unpublished, 2002.
25. T. Sheard and S. Peyton-Jones. Template meta-programming for Haskell. In Proc. of the workshop on Haskell, pages 1-16. ACM, 2002.
26. P. W. Shor. Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer. SIAM Journal on Computing, 26(5):1484-1509, 1997.
27. J. Skibiński. Collection of Haskell modules. Available at http://web.archive.org/web/20010415043244/www.numeric-quest.com/haskell/index. html, Initialized: 1998-09-18, last modified: 2001-04-02.
28. J. Skibiński. Haskell simulator of quantum computer. Available at http://web.archive.org/web/20010630025035/www.numeric-quest.com/haskell/ QuantumComputer.html, Initialized: 2001-05-02, last modified: 2001-05-05.
29. A. Steane. Quantum computing. Reports on Progress in Physics, 61:117-173, 1998.