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:1101.5690 · Foundations of Physics

Division Algebras and Quantum Theory

John C. Baez

Published May 23, 2011• 107 citations
arXivHTMLPDF
DOI
10.1007/s10701-011-9566-z

Related papers

The complexity of divisibility

Johannes Bausch, Toby S. Cubitt

We address two sets of long-standing open questions in linear algebra and probability theory, from a computational complexity perspective: stochastic matrix divisibility, and divisibility and decomposability of probability distributions. We prove that finite divisibility of stochastic matrices is an NP-complete problem, and extend this result to nonnegative matrices, and completely-positive trace-preserving maps, i.e. the quantum analogue of stochastic matrices. We further prove a complexity hierarchy for the divisibility and decomposability of probability distributions, showing that finite distribution divisibility is in P, but decomposability is NP-hard. For the former, we give an explicit polynomial-time algorithm. All results on distributions extend to weak-membership formulations, proving that the complexity of these problems is robust to perturbations.

arXiv:1411.7380•Linear Algebra and its Applications•Apr 8, 2016•14 citations

Quantum structures and operator algebras

Jan Hamhalter

Elsevier eBooks•Jan 1, 2007•5 citations

Algebraic Approach to Quantum Theory

Kasia Rejzner

Mathematical physics studies•Jan 1, 2016•2 citations

Algebraic Structure of Quantum Measurement in RQT

Janiszewski, Krzysztof

This document develops the algebraic structure of quantum measurement within the Relational Quantum Theory (RQT) framework. We show that the measurement process corresponds to a sequence of algebraic reductions through the division algebra hierarchy: 𝕆 → ℍ → ℂ → ℝ. We construct explicit projection operators for the ℍ → ℂ reduction, derive the associated Lindblad dynamics, and propose connections to particle generations and the dark matter problem. The formalism provides a unified algebraic interpretation of wave function collapse, mass generation, and the distinction between visible and dark sectors.

•Nov 29, 2025•0 citations

Robust Local Testability of Tensor Products of Constant-Rate Algebraic Geometry Codes

Sumegha Garg, Akash Kumar Sengupta

We study the robust local testability of tensor products of two Algebraic-Geometry (AG) codes. In particular, we prove that constant rate AG codes are robust locally testable. This significantly generalizes the seminal result of Polishchuk-Spielman (1994), which proved robust local testability of Reed-Solomon codes. We establish an algebraic-geometric framework that enables us to geometrically interpret codewords in tensor products of AG codes. Thereby, we use tools from intersection theory of algebraic surfaces to prove a divisibility criterion for AG codes, that generalizes the bivariate divisibility result of Polishchuk-Spielman.Over the years, robust local testability of tensor products has played a key role in the development of classical locally testable codes (LTCs) as well as quantum Low Density Parity Check (qLDPC) codes and quantum Locally Testable Codes (qLTCs). To the best of our knowledge, after Reed-Solomon codes, our result provides the first explicit family of robustly locally testable codes with constant rate and linear dual-distance. Moreover, our result, when combined with Golowich-Guruswami (2024), yields new explicit families of good quantum CSS codes of length N which are locally testable with locality $O(\sqrt N )$ and constant soundness.

Annual Symposium on Foundations of Computer Science•Dec 14, 2025•0 citations

Algebras in Quantum Mechanies

健一郎 小林, Ken-ichiro KOBAYASHI

•Mar 1, 2011•0 citations
We address two sets of long-standing open questions in linear algebra and probability theory, from a computational complexity perspective: stochastic matrix divisibility, and divisibility and decomposability of probability distributions. We prove that finite divisibility of stochastic matrices is an NP-complete problem, and extend this result to nonnegative matrices, and completely-positive trace-preserving maps, i.e. the quantum analogue of stochastic matrices. We further prove a complexity hierarchy for the divisibility and decomposability of probability distributions, showing that finite distribution divisibility is in P, but decomposability is NP-hard. For the former, we give an explicit polynomial-time algorithm. All results on distributions extend to weak-membership formulations, proving that the complexity of these problems is robust to perturbations.
This document develops the algebraic structure of quantum measurement within the Relational Quantum Theory (RQT) framework. We show that the measurement process corresponds to a sequence of algebraic reductions through the division algebra hierarchy: 𝕆 → ℍ → ℂ → ℝ. We construct explicit projection operators for the ℍ → ℂ reduction, derive the associated Lindblad dynamics, and propose connections to particle generations and the dark matter problem. The formalism provides a unified algebraic interpretation of wave function collapse, mass generation, and the distinction between visible and dark sectors.
We study the robust local testability of tensor products of two Algebraic-Geometry (AG) codes. In particular, we prove that constant rate AG codes are robust locally testable. This significantly generalizes the seminal result of Polishchuk-Spielman (1994), which proved robust local testability of Reed-Solomon codes. We establish an algebraic-geometric framework that enables us to geometrically interpret codewords in tensor products of AG codes. Thereby, we use tools from intersection theory of algebraic surfaces to prove a divisibility criterion for AG codes, that generalizes the bivariate divisibility result of Polishchuk-Spielman.Over the years, robust local testability of tensor products has played a key role in the development of classical locally testable codes (LTCs) as well as quantum Low Density Parity Check (qLDPC) codes and quantum Locally Testable Codes (qLTCs). To the best of our knowledge, after Reed-Solomon codes, our result provides the first explicit family of robustly locally testable codes with constant rate and linear dual-distance. Moreover, our result, when combined with Golowich-Guruswami (2024), yields new explicit families of good quantum CSS codes of length N which are locally testable with locality O(N)O(\sqrt N )O(N​) and constant soundness.