arXiv:2610.06767
Fermions and the Tsirelson Problem in Real Quantum Theory
Timothee Hoffreumon, Mischa P. Woods
Abstract
In a previous work, we showed that real quantum theory (RQT) cannot be experimentally distinguished from ordinary quantum theory (QT). In this paper, we investigate whether this indistinguishability survives two natural extensions of the setting: allowing separated measurements to be represented by commuting rather than tensor-product observables, and imposing superselection rules, as in fermionic information theory. We show that it does in both cases. Our first result is a positive answer to the Tsirelson problem in RQT: commuting and tensor-product measurements generate the same finite-dimensional correlations. This is surprisingly not a trivial consequence of the standard complex proof, as it does not carry over to the reals. The proof obstruction becomes particularly relevant in the presence of superselection rules, which is why we first establish the equivalence in RQT before extending the framework to superselected RQT. Our second result is a local, real quantum formulation of superselected theories. We extend the RQT framework to accommodate a representation of superselection over the reals and show, in particular, that it admits a fermionic version whose predictions are experimentally indistinguishable from those of fermionic information theory. More generally, the construction extends to all superselected QTs.
AI Summary
The paper asks whether finite-dimensional real quantum theory (RQT) reproduces complex quantum predictions when locality is expressed through commuting observables and when superselection rules are imposed. For bipartite Bell scenarios with finite setting and outcome sets, it establishes $\mathcal C_{\mathrm{tensor},\mathbb R}^{\mathrm{fin}}=\mathcal C_{\mathrm{commuting},\mathbb R}^{\mathrm{fin}}=\mathcal C_{\mathrm{tensor},\mathbb C}^{\mathrm{fin}}=\mathcal C_{\mathrm{commuting},\mathbb C}^{\mathrm{fin}}$, allowing arbitrary finite dimensions. The construction treats real commuting matrices as complex matrices, applies the finite-dimensional algebra decomposition into direct sums of tensor-product blocks, realifies each block, and encodes the block label as shared classical randomness. Realification doubles each local block dimension; the result concerns correlation sets, not a tensor-factor decomposition on the original real Hilbert space. For a unitary symmetry representation $U(G)$, standard realification $\Gamma$ identifies invariant complex states and effects with real operators commuting with both $\Gamma(U(G))$ and the encoded complex structure $J$. The latter restriction is expressed as an additional $C_4$ symmetry. Using a previous locality-preserving realification construction, the paper extends this representation to finite protocols with on-site symmetries, preserving probabilities and assigned operational locality. A fermionic example explicitly realifies Fock space, canonical anticommutation relations, and parity restrictions. The results are finite-dimensional; no infinite-dimensional separation is proved. Product initial states need not remain product under the encoding. Fermionic locality is retained algebraically through graded commutation, rather than through a demonstrated ordinary tensor-product-local multipartite construction. Projective and antiunitary symmetries are left for future work.
Central claim may not hold: The claimed isomorphism of superselected theories fails for the defined channel sets because a permitted real orthogonal conjugation induces transposition on encoded complex states, which is not a complex quantum channel. The direct-sum construction enlarges the ambient complex dimension from sum_k n_k m_k to (sum_k n_k)(sum_k m_k), contradicting the paper's dimension-preservation and fourfold-overhead assertions. The finite-protocol proof incorrectly treats the multipartite encoding matrices as an orthogonal C4 representation on the full tensor-product space, although they have the required properties only on the encoded support.
Written by gpt-6.1-sol from the paper's full text. Automated: it can be wrong.
- Comments
- 43 pages plus appendices