Quantum Computing over Finite Fields

In recent work, Benjamin Schumacher and Michael~D. Westmoreland investigate a version of quantum mechanics which they call "modal quantum theory" but which we prefer to call "discrete quantum theory". This theory is obtained by instantiating the mathematical framework of Hilbert spaces with a finite field instead of the field of complex numbers. This instantiation collapses much the structure of actual quantum mechanics but retains several of its distinguishing characteristics including the notions of superposition, interference, and entanglement. Furthermore, discrete quantum theory excludes local hidden variable models, has a no-cloning theorem, and can express natural counterparts of quantum information protocols such as superdense coding and teleportation. Our first result is to distill a model of discrete quantum computing from this quantum theory. The model is expressed using a monadic metalanguage built on top of a universal reversible language for finite computations, and hence is directly implementable in a language like Haskell. In addition to superpositions and invertible linear maps, the model includes conventional programming constructs including pairs, sums, higher-order functions, and recursion. Our second result is to relate this programming model to relational programming, e.g., a pure version of Prolog over finite relations. Surprisingly discrete quantum computing is identical to conventional logic programming except for a small twist that is responsible for all the ``quantum-ness.'' The twist occurs when merging sets of answers computed by several alternatives: the answers are combined using an "exclusive" version of logical disjunction. In other words, the two branches of a choice junction exhibit an "interference" effect: an answer is produced from the junction if it occurs in one or the other branch but not both.

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

[2]  André van Tonder,et al.  A Lambda Calculus for Quantum Computation , 2003, SIAM J. Comput..

[3]  Juliana Kaizer Vizzotto,et al.  Reasoning about General Quantum Programs over Mixed States , 2009, SBMF.

[4]  Juliana Kaizer Vizzotto,et al.  Quantum Arrows in Haskell , 2008, Electron. Notes Theor. Comput. Sci..

[5]  Thorsten Altenkirch,et al.  Structuring quantum effects: superoperators as arrows , 2006, Math. Struct. Comput. Sci..

[6]  Amr Sabry,et al.  Backtracking, interleaving, and terminating monad transformers: (functional pearl) , 2005, ICFP '05.

[7]  Jonathan Grattage.  A functional quantum programming language , 2005, 20th Annual IEEE Symposium on Logic in Computer Science (LICS' 05).

[8]  Thorsten Altenkirch,et al.  An Algebra of Pure Quantum Programming , 2007, Electron. Notes Theor. Comput. Sci..

[9]  Eugenio Moggi,et al.  Computational lambda-calculus and monads , 1989, [1989] Proceedings. Fourth Annual Symposium on Logic in Computer Science.

[10]  Edmund Robinson,et al.  Premonoidal categories and notions of computation , 1997, Mathematical Structures in Computer Science.

[11]  Dov M. Gabbay,et al.  Handbook of Quantum logic and Quantum Structures , 2007 .

[12]  Patrick Lincoln,et al.  Linear logic , 1992, SIGA.

[13]  Ralf Hinze,et al.  Deriving backtracking monad transformers , 2000, ICFP '00.

[14]  Samson Abramsky,et al.  Big toy models - Representing physical systems as Chu spaces , 2012, Synth..

[15]  Thierry Paul,et al.  Quantum computation and quantum information , 2007, Mathematical Structures in Computer Science.

[16]  Marcelo P. Fiore.  Isomorphisms of generic recursive polynomial types , 2004, POPL '04.

[17]  John Hughes,et al.  Generalising monads to arrows , 2000, Sci. Comput. Program..

[18]  Thorsten Altenkirch,et al.  A pr 2 00 5 A functional quantum programming language , 2005 .

[19]  Samson Abramsky.  Big toy models , 2011, Synthese.

[20]  Benjamin Schumacher,et al.  Modal Quantum Theory , 2010, 1204.0701.

[22]  Masahito Hasegawa,et al.  Recursion from Cyclic Sharing: Traced Monoidal Categories and Models of Cyclic Lambda Calculi , 1997, TLCA.

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

[24]  Gordon D. Plotkin,et al.  Algebraic Operations and Generic Effects , 2003, Appl. Categorical Struct..

[25]  Samson Abramsky,et al.  A categorical semantics of quantum protocols , 2004, Proceedings of the 19th Annual IEEE Symposium on Logic in Computer Science, 2004..

[26]  Benoît Valiron,et al.  A lambda calculus for quantum computation with classical control , 2006, Math. Struct. Comput. Sci..

[27]  Ross Duncan,et al.  Types for quantum computing , 2006 .

[28]  Samson Abramsky,et al.  A categorical semantics of quantum protocols , 2004, LICS 2004.

[29]  Peter Selinger,et al.  Dagger Compact Closed Categories and Completely Positive Maps: (Extended Abstract) , 2007, QPL.

[30]  Benoît Valiron,et al.  A lambda calculus for quantum computation with classical control , 2004, Mathematical Structures in Computer Science.