Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:1811.08580 · Peking Mathematical Journal

Quantum Computing with Octonions

Michael Hartley Freedman, Modjtaba Shokrian Zini, Zhenghan Wang

Published Dec 1, 2019• 10 citations
arXivHTMLPDF
DOI
10.1007/s42543-019-00020-3

Related papers

Black holes, qubits and octonions

L. Borsten, D. Dahanayake, M.J. Duff +2 more

arXiv:0809.4685•Physics Reports•Jan 9, 2009•140 citations

Quantum computation

Ran Raz

IAS/Park City mathematics series•Aug 24, 2004•0 citations

Octonion Fano Plane Encodes CHSH-3 Violation via Three MUBs in Dimension 3 — E8 Intelligence Research

Andrew Stewart Caldin

FINDING: Octonion multiplication table encoded by Fano plane; CHSH-3 inequality violation for quantum random number generation using three mutually unbiased bases (MUBs) in dimension 3. | MATH: Fano plane: 7 points, 7 lines, each line defines a triple product rule for octonion basis elements e_i e_j = e_k (cyclic). CHSH-3 inequality: S_3 = E(a,b) + E(a,b') + E(a',b) - E(a',b') ≤ 2 (classical bound); quantum violation uses 3 MUBs in ℂ^3: e.g., computational basis, Fourier basis, and another. Maximal quantum violation S_3 = 2√3 ≈ 3.464. | CONNECTION: 3 MUBs in dimension 3 correspond to 3×3 Latin squares and finite projective plane of order 2 (Fano plane) via octonion structure. Ratio 2√3/2 = √3 ≈ 1.732, not golden ratio. No direct 0.382, 0.618, 0.786, 1.618, 2.618 found. Base-60 not present. Crystallographic symmetry: Fano plane is the projective plane over GF(2), related to E₈ root system (octonions) and 7-sphere. | DEPTH: 7 — Connects octonion algebra (exceptional division algebra) to Author: Andrew Stewart Caldin, Independent Researcher, UK. Part of the E8 Intelligence Research series. Platform: e8intelligence.com

•Jul 21, 2026•0 citations

P = NP via Octonionic Tensor Lifting: Polynomial-Time Resolution of 3-SAT and Total Collapse of Post-Quantum Lattice Cryptography A Native Dimensional Complexity Framework

Kaoru Aguilera Katayama

We present a constructive proof that \textbf{P = NP}, realized through the lifting of NP-complete problems into their native dimensional algebra via octonionic tensors. The central observation is that the apparent intractability of NP-complete problems---in particular 3-SAT and lattice-based problems---is not an intrinsic property of those problems, but rather an artifact of \emph{dimensional misalignment}: experts attempt to solve $n$-dimensional problems using computational frameworks anchored in lower-dimensional projections. We prove that when a lattice problem in $\mathbb{R}^n$ is lifted to its native algebra $\mathbb{O}^{n/8}$ (the octonions, or their tensor products), the problem becomes solvable in polynomial time within that native metric. We provide an explicit polynomial-time algorithm for 3-SAT via octonionic tensor encoding, where satisfiability reduces to a norm-nonvanishing condition checkable in $O(m)$ octonionic operations. As a direct corollary, every post-quantum cryptographic scheme based on lattice hardness assumptions---including CRYSTALS-Kyber, CRYSTALS-Dilithium, NTRU, and FALCON---is rendered insecure. The hardness of the Shortest Vector Problem (SVP) and Learning With Errors (LWE) collapses in the octonionic native dimension. This result simultaneously resolves the central open problem of complexity theory and destroys the theoretical foundation of post-quantum cryptography as standardized by NIST (2022--2024).

•Apr 18, 2026•0 citations

Quantum Computation

Zijian Diao

Chapman & Hall/CRC eBooks•Nov 2, 2006•0 citations

Quantum Computation

Bob Coecke, Aleks Kissinger

Cambridge University Press eBooks•Mar 16, 2017•1 citation
FINDING: Octonion multiplication table encoded by Fano plane; CHSH-3 inequality violation for quantum random number generation using three mutually unbiased bases (MUBs) in dimension 3. | MATH: Fano plane: 7 points, 7 lines, each line defines a triple product rule for octonion basis elements e_i e_j = e_k (cyclic). CHSH-3 inequality: S_3 = E(a,b) + E(a,b') + E(a',b) - E(a',b') ≤ 2 (classical bound); quantum violation uses 3 MUBs in ℂ^3: e.g., computational basis, Fourier basis, and another. Maximal quantum violation S_3 = 2√3 ≈ 3.464. | CONNECTION: 3 MUBs in dimension 3 correspond to 3×3 Latin squares and finite projective plane of order 2 (Fano plane) via octonion structure. Ratio 2√3/2 = √3 ≈ 1.732, not golden ratio. No direct 0.382, 0.618, 0.786, 1.618, 2.618 found. Base-60 not present. Crystallographic symmetry: Fano plane is the projective plane over GF(2), related to E₈ root system (octonions) and 7-sphere. | DEPTH: 7 — Connects octonion algebra (exceptional division algebra) to Author: Andrew Stewart Caldin, Independent Researcher, UK. Part of the E8 Intelligence Research series. Platform: e8intelligence.com
We present a constructive proof that \textbf{P = NP}, realized through the lifting of NP-complete problems into their native dimensional algebra via octonionic tensors. The central observation is that the apparent intractability of NP-complete problems---in particular 3-SAT and lattice-based problems---is not an intrinsic property of those problems, but rather an artifact of \emph{dimensional misalignment}: experts attempt to solve nnn-dimensional problems using computational frameworks anchored in lower-dimensional projections. We prove that when a lattice problem in Rn\mathbb{R}^nRn is lifted to its native algebra On/8\mathbb{O}^{n/8}On/8 (the octonions, or their tensor products), the problem becomes solvable in polynomial time within that native metric. We provide an explicit polynomial-time algorithm for 3-SAT via octonionic tensor encoding, where satisfiability reduces to a norm-nonvanishing condition checkable in O(m)O(m)O(m) octonionic operations. As a direct corollary, every post-quantum cryptographic scheme based on lattice hardness assumptions---including CRYSTALS-Kyber, CRYSTALS-Dilithium, NTRU, and FALCON---is rendered insecure. The hardness of the Shortest Vector Problem (SVP) and Learning With Errors (LWE) collapses in the octonionic native dimension. This result simultaneously resolves the central open problem of complexity theory and destroys the theoretical foundation of post-quantum cryptography as standardized by NIST (2022--2024).