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

The Quantum Realization Functor and the κ-Obstruction Theorem: Why Quantum Computation is Bounded by the Algebraic Geometry of Motives

Matthew Eltgroth

Published Mar 28, 2026• 0 citations
Publisher

Abstract

We introduce the quantum realization procedure H_{\mathrm{QFT}}, which packages the Betti and étale realizations of a motive into a single Hilbert space and implements a computational analogue of the comparison isomorphism at polynomial cost via the quantum Fourier transform. The central result is the κ-obstruction theorem, a purely categorical statement: any exact functor from an abelian category to a semisimple target category annihilates all higher extension groups \mathrm{Ext}^n for n \geq 1. This applies in particular to quantum computation, where measurement maps quantum states to classical outputs in a semisimple category (finite-dimensional vector spaces). We show that the complementarity index \kappa of the Algorithmic Motives (AM) framework corresponds canonically to a nontrivial extension class arising from the derived inverse limit \varprojlim^1, which embeds into \mathrm{Ext}^1 of the motivic category. When \kappa = 0, the obstruction is fully captured by morphisms and can be resolved via the comparison isomorphism, yielding polynomial-time quantum algorithms (e.g., Shor, Biasse–Song). When \kappa > 0, the residual obstruction lies in \mathrm{Ext}^1, which is annihilated by any realization functor and therefore cannot be accessed by any computational model whose output lands in a semisimple category. This establishes a structural limitation on quantum computation: quantum speedup is possible precisely when the relevant motivic obstruction is visible at the level of realizations, and impossible when it resides in extension data invisible to all such functors. The result is independent of physical assumptions and depends only on standard homological algebra and the semisimplicity of the output category.

DOI
10.5281/zenodo.19273082

Related papers

Quantum Measurement through a Categorical Lens: A Structural Dictionary between Quantum Mechanics and Arithmetic Geometry

Matthew Eltgroth

This paper develops a structural framework connecting quantum mechanics, category theory, and arithmetic geometry through the language of non-semisimple categories. Within the Algorithmic Motives (AM) and Ramified Arithmetic Coordinates (RAC) frameworks, core phenomena of quantum mechanics—including superposition, measurement, the Born rule, complementarity, and entanglement—are interpreted as consequences of categorical structures such as extension groups, global dimension, and exact functors. Superposition is identified with non-split extensions classified by Ext¹, while measurement is modeled as a functor to a semisimple category, forcing the annihilation of extension classes and yielding wavefunction collapse as an algebraic necessity. The Born rule is derived as the unique probability assignment compatible with the output category’s semisimple structure. Complementarity arises from the algebraic invariance of squared amplitudes under phase transformations. The framework further introduces a geometric interpretation of entanglement via covering spaces and deck transformations, and provides a categorical explanation of the quantum eraser phenomenon. These constructions are extended to arithmetic geometry through a dictionary linking Betti and étale realizations to wave and particle descriptions. A central component is the Ramified Arithmetic Coordinates (RAC) framework, which interprets the critical point of L-functions as a ramification point analogous to a coordinate singularity in general relativity. The modified trace is proposed as a coordinate system resolving this singularity. Within this structure, the Generalized Riemann Hypothesis is reformulated as a faithfulness condition for a modified comparison functor, with precise separation between proved finite-level results and conjectural infinite-level extensions. All statements are explicitly classified as Theorem, Structural Correspondence, or Conjecture, ensuring clarity between established results and proposed extensions. The paper is intended as a research exposition introducing a unified algebraic framework rather than a claim of equivalence between physical and arithmetic systems.

•Apr 11, 2026•0 citations

Algebraic and Mathematical Foundations of Quantum Computation: Hilbert Spaces, Group Structures, and Quantum Algorithms

Bhavesh B. Prajapati

Quantum computation is, at bottom, a branch of applied algebra and functional analysis: the state of a quantum register is a unit vector in a finite-dimensional complex Hilbert space, computation is the action of the unitary group on that space, and the structure of the most important quantum algorithms is dictated by the representation theory of finite and continuous groups. This paper develops the mathematical scaffolding of the field from first principles and uses it to explain why quantum computers can outperform classical ones. We review complex inner-product spaces, self-adjoint and unitary operators, the spectral theorem, and the tensor-product construction that gives rise to entanglement and the exponential dimension of the state space. We then describe the qubit and its geometry, the group-theoretic classification of quantum gates (the special unitary groups, the Pauli and Clifford groups, and their Lie-algebraic generators), and the universality results that justify finite gate sets together with the Solovay–Kitaev theorem. With this apparatus we analyse the quantum Fourier transform, phase estimation, and the hidden subgroup problem, showing how Shor’s factoring algorithm, Grover’s search, and the quantum linear-systems algorithm arise as instances of a small number of algebraic templates. Finally we treat the stabilizer formalism of quantum error correction—where finite abelian groups over GF(2) play the central role—and the variational, near-term (NISQ) algorithms that dominate current practice. Throughout, the emphasis is on the algebraic invariants that make quantum speed-ups possible.

Communications on Applied Nonlinear Analysis•Jan 24, 2025•0 citations

Everything is Contextual: Contextuality Beyond Quantum

Ryan J Buchanan

Contextuality has become a cornerstone of modern foundational approaches to quantum physics. This paper introduces contextual mathematics (CM), a categorical framework for context-indexed observations and agent-dependent evaluation. Contexts are organized into a category Ctx, and observation is modeled as a contravariant bifunctor into an epistemic category E; context refinements induce restriction maps, and a Grothendieck construction organizes evaluations over agent–context pairs. We show how the established sheaf-theoretic account of Kochen–Specker contextuality (Abramsky–Brandenburger) can be represented inside this framework, recovering non-existence of a global section as the relevant obstruction. We then formulate, as comparison problems rather than established equivalences, several further candidate obstruction theories that a fully developed CM might connect to this sheaf-theoretic core: homological extension classes (Ext1 ), Kan-extension reconstruction, deformation-quantization cocycles, and device-dependent restriction in algebraic quantum field theory (AQFT) over globally hyperbolic spacetimes. We are explicit about which of these connections are proved, which are illustrative analogies, and which remain open.

•Aug 17, 2026•0 citations

Categorical computation

Liang Kong, Hao Zheng

In quantum computing, the computation is achieved by linear operators in or between Hilbert spaces. In this work, we explore a new computation scheme, in which the linear operators in quantum computing are replaced by (higher) functors between two (higher) categories. If from Turing computing to quantum computing is the first quantization of computation, then this new scheme can be viewed as the second quantization of computation. The fundamental problem in realizing this idea is how to realize a (higher) functor physically. We provide a theoretical idea of realizing (higher) functors physically based on the physics of topological orders.

arXiv:2102.04814•Frontiers of Physics•Feb 13, 2023•3 citations

A Categorical Algorithmic Ontology A Self‑Consistent Framework for Quantum Physics, the Observer, and the Emergence of Structure

El Bouazzaoui TAYB

We present a rigorously formulated, internally self‑consistent foundational framework for physics based on a minimal algorithmic substrate and the mathematics of category theory and presheaf topoi. The construction begins with a universal prefix Turing machine and the algorithmic probability distribution as the sole primitive, from which arithmetic, discrete topology, and gauge symmetries emerge as the most compressible relational structures. Quantum mechanics is not postulated but derived: the non‑Boolean, contextual nature of physical propositions is captured by the Isham–Butterfield presheaf topos SetsV(H)opSetsV(H)op, whose internal logic is intuitionistic and whose spectral presheaf resolves the Kochen–Specker obstruction. Within this setting, we propose an Algorithmic Information Bound that provides a novel, computational explanation for the Yang–Mills mass gap: a strictly positive lower bound on the algorithmic complexity per lattice site forces a finite correlation length, guaranteeing a non‑zero mass gap. The observer is formalised as an Independent Ontological Simulation Algorithm (IOSA)—a finite, algorithmic subsystem that executes decoherence and context selection, reducing the global intuitionistic logic to a classical Boolean description. We embed the entire ontology in a symmetric monoidal category, exhibiting a precise Rosetta Stone mapping between physics, computation, and logic. Crucially, the framework explicitly acknowledges its own limits via Gödel and Turing, thereby avoiding the paradoxes of absolute self‑description. The resulting theory is internally contradiction‑free, mathematically explicit, and generates falsifiable predictions for lattice gauge simulations, cosmological initial conditions, and quantum‑contextual experiments.

•May 27, 2026•0 citations

Relating Toy Models of Quantum Computation: Comprehension, Complementarity and Dagger Mix Autonomous Categories

Duško Pavlović

Toy models have been used to separate important features of quantum computation from the rich background of the standard Hilbert space model. Category theory, on the other hand, is a general tool to separate components of mathematical structures, and analyze one layer at a time. It seems natural to combine the two approaches, and several authors have already pursued this idea. We explore categorical comprehension construction as a tool for adding features to toy models. We use it to comprehend quantum propositions and probabilities within the basic model of finite-dimensional Hilbert spaces. We also analyze complementary quantum observables over the category of sets and relations. This leads into the realm of test spaces, a well-studied model. We present one of many possible extensions of this model, enabled by the comprehension construction. Conspicuously, all models obtained in this way carry the same categorical structure, extending the familiar dagger compact framework with the complementation operations. We call the obtained structure dagger mix autonomous, because it extends star autonomous categories, popular in computer science, in a similar way like dagger compact structure extends compact categories. Dagger mix autonomous categories seem to arise quite naturally in quantum computation, as soon as complementarity is viewed as a part of the global structure.

arXiv:1006.1011•Electronic Notes in Theoretical Computer Science•Feb 1, 2011•8 citations
We introduce the quantum realization procedure H_{\mathrm{QFT}}, which packages the Betti and étale realizations of a motive into a single Hilbert space and implements a computational analogue of the comparison isomorphism at polynomial cost via the quantum Fourier transform. The central result is the κ-obstruction theorem, a purely categorical statement: any exact functor from an abelian category to a semisimple target category annihilates all higher extension groups \mathrm{Ext}^n for n \geq 1. This applies in particular to quantum computation, where measurement maps quantum states to classical outputs in a semisimple category (finite-dimensional vector spaces). We show that the complementarity index \kappa of the Algorithmic Motives (AM) framework corresponds canonically to a nontrivial extension class arising from the derived inverse limit \varprojlim^1, which embeds into \mathrm{Ext}^1 of the motivic category. When \kappa = 0, the obstruction is fully captured by morphisms and can be resolved via the comparison isomorphism, yielding polynomial-time quantum algorithms (e.g., Shor, Biasse–Song). When \kappa > 0, the residual obstruction lies in \mathrm{Ext}^1, which is annihilated by any realization functor and therefore cannot be accessed by any computational model whose output lands in a semisimple category. This establishes a structural limitation on quantum computation: quantum speedup is possible precisely when the relevant motivic obstruction is visible at the level of realizations, and impossible when it resides in extension data invisible to all such functors. The result is independent of physical assumptions and depends only on standard homological algebra and the semisimplicity of the output category.
This paper develops a structural framework connecting quantum mechanics, category theory, and arithmetic geometry through the language of non-semisimple categories. Within the Algorithmic Motives (AM) and Ramified Arithmetic Coordinates (RAC) frameworks, core phenomena of quantum mechanics—including superposition, measurement, the Born rule, complementarity, and entanglement—are interpreted as consequences of categorical structures such as extension groups, global dimension, and exact functors. Superposition is identified with non-split extensions classified by Ext¹, while measurement is modeled as a functor to a semisimple category, forcing the annihilation of extension classes and yielding wavefunction collapse as an algebraic necessity. The Born rule is derived as the unique probability assignment compatible with the output category’s semisimple structure. Complementarity arises from the algebraic invariance of squared amplitudes under phase transformations. The framework further introduces a geometric interpretation of entanglement via covering spaces and deck transformations, and provides a categorical explanation of the quantum eraser phenomenon. These constructions are extended to arithmetic geometry through a dictionary linking Betti and étale realizations to wave and particle descriptions. A central component is the Ramified Arithmetic Coordinates (RAC) framework, which interprets the critical point of L-functions as a ramification point analogous to a coordinate singularity in general relativity. The modified trace is proposed as a coordinate system resolving this singularity. Within this structure, the Generalized Riemann Hypothesis is reformulated as a faithfulness condition for a modified comparison functor, with precise separation between proved finite-level results and conjectural infinite-level extensions. All statements are explicitly classified as Theorem, Structural Correspondence, or Conjecture, ensuring clarity between established results and proposed extensions. The paper is intended as a research exposition introducing a unified algebraic framework rather than a claim of equivalence between physical and arithmetic systems.
Quantum computation is, at bottom, a branch of applied algebra and functional analysis: the state of a quantum register is a unit vector in a finite-dimensional complex Hilbert space, computation is the action of the unitary group on that space, and the structure of the most important quantum algorithms is dictated by the representation theory of finite and continuous groups. This paper develops the mathematical scaffolding of the field from first principles and uses it to explain why quantum computers can outperform classical ones. We review complex inner-product spaces, self-adjoint and unitary operators, the spectral theorem, and the tensor-product construction that gives rise to entanglement and the exponential dimension of the state space. We then describe the qubit and its geometry, the group-theoretic classification of quantum gates (the special unitary groups, the Pauli and Clifford groups, and their Lie-algebraic generators), and the universality results that justify finite gate sets together with the Solovay–Kitaev theorem. With this apparatus we analyse the quantum Fourier transform, phase estimation, and the hidden subgroup problem, showing how Shor’s factoring algorithm, Grover’s search, and the quantum linear-systems algorithm arise as instances of a small number of algebraic templates. Finally we treat the stabilizer formalism of quantum error correction—where finite abelian groups over GF(2) play the central role—and the variational, near-term (NISQ) algorithms that dominate current practice. Throughout, the emphasis is on the algebraic invariants that make quantum speed-ups possible.
Contextuality has become a cornerstone of modern foundational approaches to quantum physics. This paper introduces contextual mathematics (CM), a categorical framework for context-indexed observations and agent-dependent evaluation. Contexts are organized into a category Ctx, and observation is modeled as a contravariant bifunctor into an epistemic category E; context refinements induce restriction maps, and a Grothendieck construction organizes evaluations over agent–context pairs. We show how the established sheaf-theoretic account of Kochen–Specker contextuality (Abramsky–Brandenburger) can be represented inside this framework, recovering non-existence of a global section as the relevant obstruction. We then formulate, as comparison problems rather than established equivalences, several further candidate obstruction theories that a fully developed CM might connect to this sheaf-theoretic core: homological extension classes (Ext1 ), Kan-extension reconstruction, deformation-quantization cocycles, and device-dependent restriction in algebraic quantum field theory (AQFT) over globally hyperbolic spacetimes. We are explicit about which of these connections are proved, which are illustrative analogies, and which remain open.
In quantum computing, the computation is achieved by linear operators in or between Hilbert spaces. In this work, we explore a new computation scheme, in which the linear operators in quantum computing are replaced by (higher) functors between two (higher) categories. If from Turing computing to quantum computing is the first quantization of computation, then this new scheme can be viewed as the second quantization of computation. The fundamental problem in realizing this idea is how to realize a (higher) functor physically. We provide a theoretical idea of realizing (higher) functors physically based on the physics of topological orders.
We present a rigorously formulated, internally self‑consistent foundational framework for physics based on a minimal algorithmic substrate and the mathematics of category theory and presheaf topoi. The construction begins with a universal prefix Turing machine and the algorithmic probability distribution as the sole primitive, from which arithmetic, discrete topology, and gauge symmetries emerge as the most compressible relational structures. Quantum mechanics is not postulated but derived: the non‑Boolean, contextual nature of physical propositions is captured by the Isham–Butterfield presheaf topos SetsV(H)opSetsV(H)op, whose internal logic is intuitionistic and whose spectral presheaf resolves the Kochen–Specker obstruction. Within this setting, we propose an Algorithmic Information Bound that provides a novel, computational explanation for the Yang–Mills mass gap: a strictly positive lower bound on the algorithmic complexity per lattice site forces a finite correlation length, guaranteeing a non‑zero mass gap. The observer is formalised as an Independent Ontological Simulation Algorithm (IOSA)—a finite, algorithmic subsystem that executes decoherence and context selection, reducing the global intuitionistic logic to a classical Boolean description. We embed the entire ontology in a symmetric monoidal category, exhibiting a precise Rosetta Stone mapping between physics, computation, and logic. Crucially, the framework explicitly acknowledges its own limits via Gödel and Turing, thereby avoiding the paradoxes of absolute self‑description. The resulting theory is internally contradiction‑free, mathematically explicit, and generates falsifiable predictions for lattice gauge simulations, cosmological initial conditions, and quantum‑contextual experiments.
Toy models have been used to separate important features of quantum computation from the rich background of the standard Hilbert space model. Category theory, on the other hand, is a general tool to separate components of mathematical structures, and analyze one layer at a time. It seems natural to combine the two approaches, and several authors have already pursued this idea. We explore categorical comprehension construction as a tool for adding features to toy models. We use it to comprehend quantum propositions and probabilities within the basic model of finite-dimensional Hilbert spaces. We also analyze complementary quantum observables over the category of sets and relations. This leads into the realm of test spaces, a well-studied model. We present one of many possible extensions of this model, enabled by the comprehension construction. Conspicuously, all models obtained in this way carry the same categorical structure, extending the familiar dagger compact framework with the complementation operations. We call the obtained structure dagger mix autonomous, because it extends star autonomous categories, popular in computer science, in a similar way like dagger compact structure extends compact categories. Dagger mix autonomous categories seem to arise quite naturally in quantum computation, as soon as complementarity is viewed as a part of the global structure.