Compiling quantamorphisms for the IBM Q Experience
Ana Neri, Rui Soares Barbosa, Jos\'e N. Oliveira

TL;DR
This paper introduces 'quantamorphisms', a category-theoretic approach to constructing correct quantum circuits for IBM Q devices, leveraging Haskell and Quipper to automate quantum program generation and execution.
Contribution
It extends classical program algebra to quantum programming by defining quantamorphisms, enabling correct-by-construction quantum circuits with recursive reversibility and quantum cycle implementation.
Findings
Quantum programs exhibit expected quantum effects.
Large quantum circuits can be generated and tested.
Error rates are high but expected to improve with device evolution.
Abstract
Based on the connection between the categorical derivation of classical programs from specifications and the category-theoretic approach to quantum physics, this paper contributes to extending the laws of classical program algebra to quantum programming. This aims at building correct-by-construction quantum circuits to be deployed on quantum devices such as those available at the IBM Q Experience. Quantum circuit reversibility is ensured by minimal complements, extended recursively. Measurements are postponed to the end of such recursive computations, termed "quantamorphisms", thus maximising the quantum effect. Quantamorphisms are classical catamorphisms which, extended to ensure quantum reversibility, implement quantum cycles (vulg. for-loops) and quantum folds on lists. By Kleisli correspondence, quantamorphisms can be written as monadic functional programs with quantum parameters.…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
