Skip to content
DraconiticResearch
Search Sources API
186,631 studies31 sourcesUpdated 40 min ago
PreprintCC BY-NC-SA 4.0arXiv

Non-planar contact structures with Calabi-Yau Fillings and topological quantum computation

Abstract

This paper is a non-planar counterpart of the author's earlier work on planar contact structures and topological quantum computation. On a planar page every branch point is paired by a liftable arc, and the pairing matches the Ising representation exactly, in that fixing the channels of the pairs already fixes the state. Here the page has genus g and connected binding, presented as a simple degree-three cover of the disk. Every maximal system of disjoint liftable arcs then has exactly g members and leaves two branch points unused, and the half-twist interchanging the two points is not liftable, although its cube is and lifts to the identity. Ising fusion does not see that leftover pair, determining its channel from the other g and acting there only by scalars, whereas Fibonacci fusion can leave the channel undetermined. The powers of the cube then act by ten distinct relative phases on a single joint eigenspace, while the Calabi-Yau Stein filling stays fixed. An integral residue criterion supplies the Calabi-Yau test, a factorization localized on a contact connected sum is automatically Calabi-Yau, and, unlike in the planar case, a Calabi-Yau factorization need not be the shortest.

Related

  1. Planar Contact Structures with Calabi-Yau Fillings and Topological Quantum Computation
    Atsuhide Mori
    arXivPreprintCC BY-NC-SA 4.0Full textGeometry & topologyMathematical physicsarXiv
  2. Exact orbifold fillings of contact manifolds
    Fabio Gironella, Zhengyi Zhou
    Journal of TopologyPeer-reviewedLicence not statedFull text6 citedGeometry & topologyOpenAlex
  3. An example of universal braiding in Links--Gould topological quantum computation
    Matthew Harper, Ben-Michael Kohli
    arXivPreprintCC BY 4.0Full textAlgebra & number theoryCondensed matterarXiv
  4. Quaternionic and Octonionic Frameworks for Quantum Computation: Mathematical Structures, Models, and Fundamental Limitations
    Johan Heriberto Rúa Muñoz, Jorge Eduardo Mahecha Gómez, Santiago Pineda Montoya
    arXivPreprintCC BY 4.0Full textAlgebra & number theoryarXiv
  5. Contact 3-manifolds with infinitely many rational homology ball Stein fillings
    Burak Ozbagci
    arXivPreprintCC BY 4.0Full textGeometry & topologyarXiv
BibTeX
@misc{mori2026nonplanar,
  title = {{Non-planar contact structures with Calabi-Yau Fillings and topological quantum computation}},
  author = {Atsuhide Mori},
  howpublished = {arXiv},
  year = {2026},
  month = oct,
  doi = {10.48550/arxiv.2610.25878},
  eprint = {2610.25878},
  archivePrefix = {arXiv},
  url = {https://arxiv.org/abs/2610.25878},
  note = {CC BY-NC-SA 4.0},
}
RIS
TY  - UNPB
TI  - Non-planar contact structures with Calabi-Yau Fillings and topological quantum computation
AU  - Atsuhide Mori
PY  - 2026
DA  - 2026/10/20
PB  - arXiv
DO  - 10.48550/arxiv.2610.25878
UR  - https://arxiv.org/abs/2610.25878
AB  - This paper is a non-planar counterpart of the author's earlier work on planar contact structures and topological quantum computation. On a planar page every branch point is paired by a liftable arc, and the pairing matches the Ising representation exactly, in that fixing the channels of the pairs already fixes the state. Here the page has genus g and connected binding, presented as a simple degree-three cover of the disk. Every maximal system of disjoint liftable arcs then has exactly g members and leaves two branch points unused, and the half-twist interchanging the two points is not liftable, although its cube is and lifts to the identity. Ising fusion does not see that leftover pair, determining its channel from the other g and acting there only by scalars, whereas Fibonacci fusion can leave the channel undetermined. The powers of the cube then act by ten distinct relative phases on a single joint eigenspace, while the Calabi-Yau Stein filling stays fixed. An integral residue criterion supplies the Calabi-Yau test, a factorization localized on a contact connected sum is automatically Calabi-Yau, and, unlike in the planar case, a Calabi-Yau factorization need not be the shortest.
ER  -