Metraipolis › archive › dc_014e58800a05

Topologically Protected Learning from Exceptional Point Braiding: Toward Braid Programming — arXiv:2608.15829

Source
arXiv (en)
Original
https://arxiv.org/abs/2608.15829
License (as archived)
CC0-1.0
Archived
2026-10-19T00:58:41.997Z
SHA-256 of the archived text
61245a709fbebdf2e72ca4ede5666258bfc3e16d2439b2c0ae9756985a32273d
Stable URL of this page
https://metraipolis.com/documento/dc_014e58800a05

How to cite

Topologically Protected Learning from Exceptional Point Braiding: Toward Braid Programming — arXiv:2608.15829 — arXiv (en), https://arxiv.org/abs/2608.15829 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_014e58800a05 (Metraipolis archive dc_014e58800a05, sha256 61245a709fbebdf2e72ca4ede5666258bfc3e16d2439b2c0ae9756985a32273d)
BibTeX
@misc{dc014e58800a05,
  title = {Topologically Protected Learning from Exceptional Point Braiding: Toward Braid Programming — arXiv:2608.15829},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2608.15829},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_014e58800a05; sha256 61245a709fbebdf2e72ca4ede5666258bfc3e16d2439b2c0ae9756985a32273d},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2608.15829. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

We present a framework for topological learning based on exceptional point (EP) braiding in a non-Hermitian Bogoliubov-de Gennes Hamiltonian. A closed algebraic equation for the EP super-surface is derived; through momentum quantisation in finite systems, it predicts the exact number and parameter positions of all EPs in real space, irrespective of system size. The EP topology is characterised by two quantised invariants the state-swap fidelity and the normalised Berry phase which cannot both be zero for a topological EP. A complete topological map shows that all EPs lie within a specefic region. Adiabatic encirclements confirm robust state swapping and yield a universal set of braid gates, including Pauli-X, Pauli-Y, Pauli-Z, a Hadamard-like gate, the T-gate, and a SWAP operation, with the special case where a is 0, providing additional phase gates. Building on these generators, we reformulate learning as braid programming a discrete search over the braid group that replaces gradient descent on continuous weights with combinatorial optimisation. A proof-of-concept genetic search successfully discovers short braid words that reproduce the standard Hadamard gate and the H.Z gate with perfect fidelity. This paradigm offers inherent noise immunity, catastrophic-forgetting prevention through compositional concatenation, and guaranteed generalisation by mathematical construction, establishing EP braiding as a promising substrate for robust, interpretable, and topologically protected neuromorphic computation.

Tema degli esploratori: fisica e astronomia (retro-catalogo arXiv: annunci del 2026-08-18 in quant-ph).
Categorie arXiv: Quantum Physics (quant-ph) ; Strongly Correlated Electrons (cond-mat.str-el).
Pagina del lavoro: https://arxiv.org/abs/2608.15829 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-19T00:29:15.392Z dalla pagina https://arxiv.org/catchup/quant-ph/2026-08-18?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).