arXiv:2609.30406
Planar Contact Structures with Calabi-Yau Fillings and Topological Quantum Computation
Atsuhide Mori
Abstract
We study planar openbooks obtained by lifting braids through branched covers of D^2, together with the quantum operations in the Ising representation. We give a criterion for the Stein fillings to be Calabi-Yau (CY). Among positive factorizations of a fixed monodromy, a CY one has minimal length and its filling minimizes χand b_2. Applied to Baykur's recent examples, this gives a planar contact 3-manifold with infinitely many non-homeomorphic CY fillings, the cover there having degree \ge 6. At degree 4 a single CY filling forces every filling to be CY, and in one case the filling is unique; at degree \le 3 it is unique, and CY under a mild condition. Admissible cuts of D^2 decompose the openbook into subopenbooks. Every positive factorization then localizes, and the CY condition holds exactly when it holds locally. The state space is then a direct sum of tensor products indexed by the compatible parity choices, with at most two qubits per factor when the pieces have degree $\le 4$, the same range in which the CY condition depends only on the monodromy. For one degree 4 cover, the points, lines and flags of the two-qubit doily are realized by its subopenbooks. Fifteen liftable braids there share the same quantum operation and Stein filling, and are separated only by the subopenbook systems they admit. A choice of tensor-product structure is thus carried by the lift, not by the braid group representation, suggesting a link between contact topology and quantum entanglement.
AI Summary
The paper studies how planar contact topology supplements the information retained by Ising braid representations. It considers degree-$d$ simple branched covers of the disk with planar page $\Sigma_{0,d}$, relating positive monodromy factorizations and their Stein fillings to quantum operations on fixed-parity spaces of dimension $2^{d-2}$. For a vanishing-cycle matrix $V$, it characterizes Calabi–Yau fillings, defined here by $c_1(W)=0$, by the integral equation $V^Tu=\mathbf1$. Monodromy-invariant linear and quadratic multiplicities, together with Cauchy–Schwarz, show that a CY factorization has minimal length. Using Wendl’s theorem, this yields minimal Euler characteristic and $b_2$ among Stein fillings of the supported contact manifold. Applying the criterion to existing degree-six examples produces infinitely many pairwise non-homeomorphic CY fillings. At degree at most four, CY status depends only on monodromy. Admissible cuts give boundary-connected-sum decompositions; every positive factorization localizes to the pieces, and CY status is equivalent to CY status on every piece. Quantum state spaces correspondingly split into direct sums of tensor products indexed by compatible parities. For $d=4$, six branch points realize the two-qubit doily: 15 Pauli operators, 15 maximal contexts and 45 flags. Fifteen constructed braids have identical projective quantum operation and lifted factorization but different admissible cut systems. The construction does not canonically fix qubit coordinates or entanglement: cuts specify sectors and block factors, not complete tensor-product identifications. Beyond two qubits, Majorana bilinears and pairings no longer exhaust Paulis and contexts. Whether the quantum and topological degree thresholds coincide, and which admissible decomposition systems occur, remain open.
These tools were employed to assist with literature search, verify computations, facilitate mathematical discussions that helped refine key arguments, and improve stylistic clarity.
Central claim may not hold: The degree-four cuts establish a direct-sum sector structure rather than a two-qubit tensor-product structure on the original four-dimensional space, weakening the abstract's central tensor-product interpretation. The claim that a maximal context with ordered generators supplies qubit coordinates omits joint-eigenvector phase data: controlled-Z preserves those generators and eigenlines while changing separability.
Written by gpt-6.1-sol from the paper's full text. Automated: it can be wrong.
- Comments
- Companion paper: arXiv:2609.34200. 18 pages. Generative AI (ChatGPT, Claude) used for literature search and verification, checking elementary computations, and mathematical discussion; see the declaration before the references