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.
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.
Ongoing work in quantum information emphasises the need for a structural understanding of quantum speedups: in this work, we focus on the quantum Fourier transform and the structures in quantum theory that enable it. We elucidate a general connection in any process theory between the Fourier transform and strongly complementary observables, i.e. Hopf algebras in dagger symmetric monoidal categories. We generalise the necessary tools of representation theory from fdHilb to arbitrary dagger symmetric monoidal categories. We define groups, characters and representations, and we prove their relation to strong complementarity. The Fourier transform is then defined in terms of pairs of strongly complementary observables, in both the abelian and non-abelian case. In the abelian case, we draw the connection with Pontryagin duality and provide categorical proofs of the Fourier Inversion Theorem, the Convolution Theory, and Pontryagin duality. Our work finds application in the novel characterisation of the Fourier transform for the category fRel of finite sets and relations. This is a result of interest for the study of categorical quantum algorithms, as the usual construction of the quantum Fourier transform in terms of Fourier matrices is shown to fail in fRel. Despite this, the process theoretic perspective on the Fourier transform is sensible in this setting. Furthermore, our categorical setting provides a generalisation of the abelian Fourier transform from finite-dimensional Hilbert spaces to finite-dimensional modules over arbitrary semirings, as well as a further generalisation to finite non-abelian groups, including a fully categorical generalisation of the Gelfand-Naimark theorem.
Quantum computing is captured in the formalism of the monoidal subcategory of 𝐕 𝐞 𝐜 𝐭 ℂ generated by ℂ 2 — in particular, quantum circuits are diagrams in 𝐕 𝐞 𝐜 𝐭 ℂ — while topological quantum field theories , in the sense of Atiyah, are diagrams in 𝐕 𝐞 𝐜 𝐭 ℂ indexed by cobordisms. We initiate a program to formalize this connection. In doing so, we equip cobordisms with machinery for producing linear maps by parallel transport along curves under a connection and then assemble these structures into a higher category. Finite-dimensional complex vector spaces and linear maps between them are given a suitable higher categorical structure which we call 𝔽 𝐕 𝐞 𝐜 𝐭 ℂ . We realize quantum circuits as images of cobordisms under monoidal functors from these modified cobordisms to 𝔽 𝐕 𝐞 𝐜 𝐭 ℂ , which are computed by taking parallel transports of vectors and then combining the results in a pattern encoded in the domain category.
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.