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.
In the tradition of toy models of quantum mechanics in vector spaces over finite fields (e.g., Schumacher and Westmoreland's "modal quantum theory"), one finite field stands out, 2, since vectors over 2 have an interpretation as natural mathematical objects, i.e., sets. This engages a sets-to-vector-spaces bridge that is part of the mathematical folklore to translate both ways between set concepts and vector space concepts. Using that bridge, the mathematical framework of (finite-dimensional) quantum mechanics can be transported down to sets resulting in quantum mechanics over sets or QM/sets. This approach leads to a different treatment of Dirac's brackets than in "modal quantum theory" (MQT), and that gives a full probability calculus (unlike MQT that only has zero-one modalities of impossible and possible). That, in turn, leads to a rather fulsome theory of QM over sets that includes "logical" models of the double-slit experiment, Bell's Theorem, quantum information theory, quantum computing, and much else. Indeed, QM/sets is proposed as the "logic" of QM in the old-fashioned sense of "logic" as giving the simplified essentials of a theory. QM/sets is also a key part of a broader research program to provide an interpretation of QM based on the notion of "objective indefiniteness," a program that grew out the recent development of the logic of partitions mathematically dual to the usual Boolean logic of subsets.
Modal quantum theory (MQT) is a simplified cousin of ordinary Hilbert space quantum theory. We show that two important theorems of actual quantum theory, the Kochen-Specker theorem excluding non-contextual hidden variables and the Conway-Kochen "free will theorem" about entangled systems, have direct analogues in MQT. The structure of possible measurement results for an entangled system in MQT cannot be represented by probability assignments satisfying the no-signaling principle, such as those given by ordinary quantum theory.
We examine the toy model of modal quantum theory (MQT), an analogue of actual quantum theory based on finite fields. In particular, we investigate how several essential ``no-go'' results (for cloning, deleting and hiding processes) work in MQT. Cloning and deleting are still forbidden in MQT, though the details of these results are somewhat different in the new context. However, the information of a modal qubit can be completely hidden in the correlations between two entangled modal qubits.
Inspired by classical ("actual") Quantum Theory over
C and Modal Quantum Theory (MQT), which is a model of Quantum Theory over certain finite fields, we introduce General Quantum Theory as a Quantum Theory -- in the København interpretation -- over general division rings with involution, in which the inner product "is" a
(σ,1)-Hermitian form
φ. This unites all known such approaches in one and the same theory, and we show that many of the known results such as no-cloning, no-deleting, quantum teleportation and super-dense quantum coding, which are known in classical Quantum Theory over
C and in some MQTs, hold for any General Quantum Theory. On the other hand, in many General Quantum Theories, a geometrical object which we call "quantum kernel" arises, which is invariant under the unitary group
U(V,φ), and which carries the geometry of a so-called polar space. We use this object to construct new quantum (teleportation) coding schemes, which mix quantum theory with the geometry of the quantum kernel (and the action of the unitary group). We also show that in characteristic
0, every General Quantum Theory over an algebraically closed field behaves like classical Quantum Theory over
C at many levels, and that all such theories share one model, which we pin down as the "minimal model," which is countable and defined over
Q. Moreover, to make the analogy with classical Quantum Theory even more striking, we show that Born's rule holds in any such theory. So all such theories are not modal at all. Finally, we obtain an extension theory for General Quantum Theories in characteristic
0 which allows one to extend any such theory over algebraically closed fields (such as classical complex Quantum Theory) to larger theories in which a quantum kernel is present.