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:2611.03348 · Quantum Reports

Quaternionic and Octonionic Frameworks for Quantum Computation: Mathematical Structures, Models, and Fundamental Limitations

Johan Heriberto Rúa Muñoz, Jorge Eduardo Mahecha Gómez, Santiago Pineda Montoya

Published Nov 26, 2025• 2 citations
arXivHTMLPDF

Abstract

We develop detailed quaternionic and octonionic frameworks for quantum computation grounded on normed division algebras. Our central result is to prove the polynomial computational equivalence of quaternionic and complex quantum models: Computation over H is polynomially equivalent to the standard complex quantum circuit model and hence captures the same complexity class BQP up to polynomial reductions. Over H, we construct a complete model—quaternionic qubits on right H-modules with quaternion-valued inner products, unitary dynamics, associative tensor products, and universal gate sets—and establish polynomial equivalence with the standard complex model; routes for implementation at fidelities exceeding 99% via pulse-level synthesis on current hardware are discussed. Over O, non-associativity yields path-dependent evolution, ambiguous adjoints/inner products, non-associative tensor products, and possible failure of energy conservation outside associative sectors. We formalize these obstructions and systematize four mitigation strategies: Confinement to associative subalgebras, G2-invariant codes, dynamical decoupling of associator terms, and a seven-factor algebraic decomposition for gate synthesis. The results delineate the feasible quaternionic regime from the constrained octonionic landscape and point to applications in symmetry-protected architectures, algebra-aware simulation, and hypercomplex learning.

DOI
10.3390/quantum7040055

Related papers

Geometry of Quantum Information Beyond Complex Numbers: A Review from Clifford Algebras, Division Algebras and Hopf Fibrations

Johan H. Rúa Muñoz, Santiago Pineda Montoya

We develop a comparative synthesis of quantum-information geometry beyond complex numbers, with emphasis on what different algebraic frameworks contribute to information-processing structure rather than on their formal novelty alone. The organizing idea is a layer-by-layer test of the standard complex Hilbert-space formalism: each non-complex or deformed framework modifies the scalar field, phase group, projective state space, Born-probability semantics, composition rule, measurement geometry, symmetry algebra or representation category. The central thesis is that such frameworks are physically meaningful when they identify which assumptions make complex quantum mechanics operationally stable: positive probabilities, associative multipartite composition, reversible dynamics, experimentally testable phases, locality constraints, informationally complete measurements, error bases and clear operational semantics. Real quantum theory probes the necessity of complex phases and local tomography; quaternionic quantum mechanics probes non-Abelian phase while retaining associativity and admitting complex embeddings; octonionic proposals probe the boundary where exceptional geometry survives but generic circuit composition is obstructed by non-associativity; Jordan algebras test ordered probabilistic state spaces; Clifford algebras and Bott periodicity provide the spinorial and topological grammar connecting gates, Hopf maps and periodic dimensions; and quantum-group or q-deformed constructions probe coproducts, braiding and representation categories rather than scalar amplitudes. We distinguish three roles that are often conflated: genuine hypercomplex kinematics, Hopf-fibration coordinates for ordinary complex multipartite entanglement, and deformed algebraic or categorical structures. The resulting map separates established equivalence and experimental-constraint results from useful representation tools and speculative programs, while identifying concrete open problems for non-complex quantum information.

Symmetry•Jun 14, 2026•2 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

The Isomorphism of Complex Numbers and Latent Worlds 5; The Rigorization and Higher-Dimensional Generalization of Latent World Algebra: An Algebraic Foundation of Quantum Structure

changzheng zhou, ZIQING zhou

The indispensability of the complex structure in quantum mechanics has beenexperimentally confirmed, but its algebraic origin—the fact that the complex number field is the only commutative, algebraically closed division algebra over the realnumbers—has not yet been rigorously linked to an interpretive framework of quantum reality. This paper proposes an axiomatic system for a latent world algebra,decomposing the descriptive structure of quantum states into a direct sum of anobservable subalgebra and a latent world subalgebra, and defining the multiplication rules and commutation relations between them. It is proved that this algebraicstructure is a concrete realization of a C*-algebra, where self-adjoint elements correspond to the algebraic representation of observables, and non-self-adjoint elementsencode the algebraic information of modal dimensions. Furthermore, the square-lawclassification of the latent world subalgebra and its correspondence with Cliffordalgebras are explored, interpreting the difference between J2 = −I (complex structure) and J2 = +I (real structure) as two distinct physical modalities. On thisbasis, the algebraic framework is extended to quaternionic and octonionic cases,arguing that the non-associativity of octonions may correspond to the non-localityof quantum entanglement. Finally, topological invariants such as Chern numbersand characteristic classes are represented as numerical values obtained from thepairing of central cohomology classes of the latent world algebra with K-theory,establishing an equivalence relation between topological transitions and algebraicprojection mappings. This study provides a rigorous mathematical foundation forunderstanding the algebraic necessity of quantum structures and opens a formalizedpath for exploring hypercomplex quantum theories.

•Mar 9, 2026•0 citations

Quaternionic Computing

José M. Fernandez, William Alan Schneeberger

We introduce a model of computation based on quaternions, which is inspired on the quantum computing model. Pure states are vectors of a suitable linear space over the quaternions. Other aspects of the theory are the same as in quantum computing: superposition and linearity of the state space, unitarity of the transformations, and projective measurements. However, one notable exception is the fact that quaternionic circuits do not have a uniquely defined behaviour, unless a total ordering of evaluation of the gates is defined. Given such an ordering a unique unitary operator can be associated with the quaternionic circuit and a proper semantics of computation can be associated with it. The main result of this paper consists in showing that this model is no more powerful than quantum computing, as long as such an ordering of gates can be defined. More concretely we show, that for all quaternionic computation using n quaterbits, the behaviour of the circuit for each possible gate ordering can be simulated with n+1 qubits, and this with little or no overhead in circuit size. The proof of this result is inspired of a new simplified and improved proof of the equivalence of a similar model based on real amplitudes to quantum computing, which states that any quantum computation using n qubits can be simulated with n+1 rebits, and in this with no circuit size overhead. Beyond this potential computational equivalence, however, we propose this model as a simpler framework in which to discuss the possibility of a quaternionic quantum mechanics or information theory. In particular, it already allows us to illustrate that the introduction of quaternions might violate some of the ``natural'' properties that we have come to expect from physical models.

arXiv:quant-ph/0307017•Jul 2, 2003•23 citations

Quantum circuits and parallelism

Pawan Kumar Verma, Mohit Kumar, Saurabh Singhal +1 more

This chapter develops the quantum circuit model as the operational core of gate-based quantum computation, framing circuits as structured compositions of unitary transformations acting on qubits and quantum registers. It begins by formalizing qubits as normalized state vectors in Hilbert space and extends to multi-qubit registers via tensor products, emphasizing the exponential growth of representable basis amplitudes and the resulting capacity for entanglement. Building on these foundations, this chapter details circuit design as an algorithm-engineering discipline that must balance mathematical correctness with resource efficiency under hardware and noise constraints, including circuit depth, gate count, qubit connectivity, control bandwidth, and crosstalk. Circuit construction is presented through sequential composition and parallel execution on disjoint qubit subsets, motivating scheduling methods such as dependency-graph analysis, critical-path identification, and time-slice (layer) formation under platform-imposed concurrency limits. This chapter then addresses quantum circuit decomposition as the bridge from abstract algorithmic operators to implementable gate sets, highlighting universal synthesis principles (including Solovay–Kitaev guarantees) and standard decompositions for single-qubit unitaries (Euler-angle forms) and controlled multi-qubit operations. Finally, quantum parallelism is treated as a distinctly quantum computational resource arising from superposition over 2.

CRC Press eBooks•Nov 6, 2026•0 citations

Operational Foundations for Quaternionic and Octonionic Quantum Models: Exact Quaternionic Channels and Error Correction, Para-Linear Operators, and Categorical Closure Boundaries Beyond Associativity

Santiago Pineda Montoya, Johan H. Rúa Muñoz

A scalar field alone does not determine a quantum theory: states, effects, processes, symmetries, composition, and discard are equally structural. Realification illustrates this point: an orthogonal complex structure J^2 = -I selects the physical real operators and the balanced composite. Quaternionic quantum mechanics has an analogous exact representation on a doubled complex space selected by an antiunitary symplectic structure Theta^2 = -I. Within that sector, a Choi fixed-point condition characterizes when a complex channel admits quaternionic Kraus operators, while exact correction of a finite-dimensional right-quaternionic code is characterized by compression coefficients in the real center and admits an explicit recovery. For octonions, nonassociativity precludes a unique continuation; para-linear, categorical, sectorial, Jordan, Clifford-envelope, and Moufang models are compared by the operational structures they retain and the additional data required to define composites, channels, or recovery. Across these cases, an exact ambient representation does not erase the complex or symplectic structure that selects the physical theory.

arXiv:2608.20259•Aug 20, 2026•1 citation
We develop detailed quaternionic and octonionic frameworks for quantum computation grounded on normed division algebras. Our central result is to prove the polynomial computational equivalence of quaternionic and complex quantum models: Computation over H is polynomially equivalent to the standard complex quantum circuit model and hence captures the same complexity class BQP up to polynomial reductions. Over H, we construct a complete model—quaternionic qubits on right H-modules with quaternion-valued inner products, unitary dynamics, associative tensor products, and universal gate sets—and establish polynomial equivalence with the standard complex model; routes for implementation at fidelities exceeding 99% via pulse-level synthesis on current hardware are discussed. Over O, non-associativity yields path-dependent evolution, ambiguous adjoints/inner products, non-associative tensor products, and possible failure of energy conservation outside associative sectors. We formalize these obstructions and systematize four mitigation strategies: Confinement to associative subalgebras, G2-invariant codes, dynamical decoupling of associator terms, and a seven-factor algebraic decomposition for gate synthesis. The results delineate the feasible quaternionic regime from the constrained octonionic landscape and point to applications in symmetry-protected architectures, algebra-aware simulation, and hypercomplex learning.
We develop a comparative synthesis of quantum-information geometry beyond complex numbers, with emphasis on what different algebraic frameworks contribute to information-processing structure rather than on their formal novelty alone. The organizing idea is a layer-by-layer test of the standard complex Hilbert-space formalism: each non-complex or deformed framework modifies the scalar field, phase group, projective state space, Born-probability semantics, composition rule, measurement geometry, symmetry algebra or representation category. The central thesis is that such frameworks are physically meaningful when they identify which assumptions make complex quantum mechanics operationally stable: positive probabilities, associative multipartite composition, reversible dynamics, experimentally testable phases, locality constraints, informationally complete measurements, error bases and clear operational semantics. Real quantum theory probes the necessity of complex phases and local tomography; quaternionic quantum mechanics probes non-Abelian phase while retaining associativity and admitting complex embeddings; octonionic proposals probe the boundary where exceptional geometry survives but generic circuit composition is obstructed by non-associativity; Jordan algebras test ordered probabilistic state spaces; Clifford algebras and Bott periodicity provide the spinorial and topological grammar connecting gates, Hopf maps and periodic dimensions; and quantum-group or q-deformed constructions probe coproducts, braiding and representation categories rather than scalar amplitudes. We distinguish three roles that are often conflated: genuine hypercomplex kinematics, Hopf-fibration coordinates for ordinary complex multipartite entanglement, and deformed algebraic or categorical structures. The resulting map separates established equivalence and experimental-constraint results from useful representation tools and speculative programs, while identifying concrete open problems for non-complex quantum information.
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.
The indispensability of the complex structure in quantum mechanics has beenexperimentally confirmed, but its algebraic origin—the fact that the complex number field is the only commutative, algebraically closed division algebra over the realnumbers—has not yet been rigorously linked to an interpretive framework of quantum reality. This paper proposes an axiomatic system for a latent world algebra,decomposing the descriptive structure of quantum states into a direct sum of anobservable subalgebra and a latent world subalgebra, and defining the multiplication rules and commutation relations between them. It is proved that this algebraicstructure is a concrete realization of a C*-algebra, where self-adjoint elements correspond to the algebraic representation of observables, and non-self-adjoint elementsencode the algebraic information of modal dimensions. Furthermore, the square-lawclassification of the latent world subalgebra and its correspondence with Cliffordalgebras are explored, interpreting the difference between J2 = −I (complex structure) and J2 = +I (real structure) as two distinct physical modalities. On thisbasis, the algebraic framework is extended to quaternionic and octonionic cases,arguing that the non-associativity of octonions may correspond to the non-localityof quantum entanglement. Finally, topological invariants such as Chern numbersand characteristic classes are represented as numerical values obtained from thepairing of central cohomology classes of the latent world algebra with K-theory,establishing an equivalence relation between topological transitions and algebraicprojection mappings. This study provides a rigorous mathematical foundation forunderstanding the algebraic necessity of quantum structures and opens a formalizedpath for exploring hypercomplex quantum theories.
We introduce a model of computation based on quaternions, which is inspired on the quantum computing model. Pure states are vectors of a suitable linear space over the quaternions. Other aspects of the theory are the same as in quantum computing: superposition and linearity of the state space, unitarity of the transformations, and projective measurements. However, one notable exception is the fact that quaternionic circuits do not have a uniquely defined behaviour, unless a total ordering of evaluation of the gates is defined. Given such an ordering a unique unitary operator can be associated with the quaternionic circuit and a proper semantics of computation can be associated with it. The main result of this paper consists in showing that this model is no more powerful than quantum computing, as long as such an ordering of gates can be defined. More concretely we show, that for all quaternionic computation using n quaterbits, the behaviour of the circuit for each possible gate ordering can be simulated with n+1 qubits, and this with little or no overhead in circuit size. The proof of this result is inspired of a new simplified and improved proof of the equivalence of a similar model based on real amplitudes to quantum computing, which states that any quantum computation using n qubits can be simulated with n+1 rebits, and in this with no circuit size overhead. Beyond this potential computational equivalence, however, we propose this model as a simpler framework in which to discuss the possibility of a quaternionic quantum mechanics or information theory. In particular, it already allows us to illustrate that the introduction of quaternions might violate some of the ``natural'' properties that we have come to expect from physical models.
This chapter develops the quantum circuit model as the operational core of gate-based quantum computation, framing circuits as structured compositions of unitary transformations acting on qubits and quantum registers. It begins by formalizing qubits as normalized state vectors in Hilbert space and extends to multi-qubit registers via tensor products, emphasizing the exponential growth of representable basis amplitudes and the resulting capacity for entanglement. Building on these foundations, this chapter details circuit design as an algorithm-engineering discipline that must balance mathematical correctness with resource efficiency under hardware and noise constraints, including circuit depth, gate count, qubit connectivity, control bandwidth, and crosstalk. Circuit construction is presented through sequential composition and parallel execution on disjoint qubit subsets, motivating scheduling methods such as dependency-graph analysis, critical-path identification, and time-slice (layer) formation under platform-imposed concurrency limits. This chapter then addresses quantum circuit decomposition as the bridge from abstract algorithmic operators to implementable gate sets, highlighting universal synthesis principles (including Solovay–Kitaev guarantees) and standard decompositions for single-qubit unitaries (Euler-angle forms) and controlled multi-qubit operations. Finally, quantum parallelism is treated as a distinctly quantum computational resource arising from superposition over 2.
A scalar field alone does not determine a quantum theory: states, effects, processes, symmetries, composition, and discard are equally structural. Realification illustrates this point: an orthogonal complex structure J^2 = -I selects the physical real operators and the balanced composite. Quaternionic quantum mechanics has an analogous exact representation on a doubled complex space selected by an antiunitary symplectic structure Theta^2 = -I. Within that sector, a Choi fixed-point condition characterizes when a complex channel admits quaternionic Kraus operators, while exact correction of a finite-dimensional right-quaternionic code is characterized by compression coefficients in the real center and admits an explicit recovery. For octonions, nonassociativity precludes a unique continuation; para-linear, categorical, sectorial, Jordan, Clifford-envelope, and Moufang models are compared by the operational structures they retain and the additional data required to define composites, channels, or recovery. Across these cases, an exact ambient representation does not erase the complex or symplectic structure that selects the physical theory.