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:2601.15396

Quadratic tensors as a unification of Clifford, Gaussian, and free-fermion physics

Andreas Bauer, Seth Lloyd

quant-phmath-phSubmitted Jan 21, 2026• Announced Jan 23, 2026• 10 citations
arXivHTMLPDF

Abstract

Certain families of quantum mechanical models can be described and solved efficiently on a classical computer, including qubit or qudit Clifford circuits and stabilizer codes, free-boson or free-fermion models, and certain rotor and GKP codes. We show that all of these families can be described as instances of the same algebraic structure, namely quadratic functions over abelian groups, or more generally over (super) Hopf algebras. Different kinds of degrees of freedom correspond to different "elementary" abelian groups or Hopf algebras: $\mathbb{Z}_2$ for qubits, $\mathbb{Z}_d$ for qudits, $\mathbb{R}$ for continuous variables, both $\mathbb{Z}$ and $\mathbb{R}/\mathbb{Z}$ for rotors, and a super Hopf algebra $\mathcal F$ for fermionic modes. Objects such as states, operators, superoperators, or projection-operator valued measures, etc, are tensors. For the solvable models above, these tensors are quadratic tensors based on quadratic functions. Quadratic tensors with $n$ degrees of freedom are fully specified by only $O(n^2)$ coefficients. Tensor networks of quadratic tensors can be contracted efficiently on the level of these coefficients, using an operation reminiscent of the Schur complement. Our formalism naturally includes models with mixed degrees of freedom, such as qudits of different dimensions. We also use quadratic functions to define generalized stabilizer codes and Clifford gates for arbitrary abelian groups. Finally, we give a generalization from quadratic (or 2nd order) to $i$th order tensors, which are specified by $O(n^i)$ coefficients but cannot be contracted efficiently in general.

Related papers

Unifying Algebraic Structures in Solvable Quantum Models: A Review of Quadratic Tensors with Fractal Interpretations and Emergent Quantum Connections

Syed Muntasir Mamun

The paper "Quadratic tensors as a unification of Clifford, Gaussian, and free-fermion physics" by Andreas Bauer and Seth Lloyd presents a unified algebraic framework for efficiently simulable quantum models. It demonstrates that Clifford circuits, stabilizer codes, free-boson (Gaussian) models, free-fermion models, and certain rotor/Gottesman-Kitaev-Preskill (GKP) codes are all instances of quadratic functions over abelian groups or (super) commutative Hopf algebras. Quadratic tensors, representing quantum objects like states and operators, are specified by O(n²) coefficients for n degrees of freedom and can be efficiently contracted using a generalized Schur complement. The framework supports mixed degrees of freedom (e.g., qudits, continuous variables, fermions) and extends to generalized stabilizer codes and Clifford operations. A generalization to ith-order tensors is provided, though they lack efficient contractibility. This review summarizes the paper's content, compares it with fractal geometry concepts, and ideates connections to Dr. Syed Muntasir Mamun's quantum articulations. Mamun, SM (2026)……………………………………………1 Unifying Algebraic Structures in Solvable Quantum Models: A Review of Quadratic Tensors with Fractal Interpretations and Emergent Quantum Connections Also available on Academia.edu: https://www.academia.edu/attachments/131608598/download_file?s=portfolio

•Jan 1, 2026•0 citations

Unifying Algebraic Structures in Solvable Quantum Models: A Comprehensive Synthesis of Quadratic Tensors, Super-Hopf Algebras, and Fractal-Recursive Ontologies

Syed Muntasir Mamun

This paper presents a rigorous mathematical and ontological synthesis of solvable quantum systems and emergent fractal geometries. By leveraging the quadratic tensor framework, we demonstrate that disparate families of quantum models—including Clifford circuits, stabilizer codes, Gaussian states, and free-fermion systems—can be unified as quadratic functions over abelian groups or super-commutative Hopf algebras. This algebraic unification permits classical simulation with $O(n^2)$ complexity via a generalized Schur complement contraction mechanism, dissolving the boundaries between discrete-variable qudits and continuous-variable bosonic modes. However, physical reality frequently transcends these smooth, integer-dimensional algebraic bases. We integrate a fractal-recursive ontology, identifying that quantum trajectories in path integrals and energy spectra in quantum materials (e.g., Hofstadter's butterfly) exhibit non-integer Hausdorff dimensions and self-similar architectures that challenge traditional linear causality. We further explore the transition from quadratic to $i$-th order tensors, identifying the Clifford hierarchy's correspondence to higher-order polynomial maps and the resulting computational boundaries of the Gottesman-Knill theorem. Also available on Academia.edu: https://www.academia.edu/attachments/131609415/download_file?s=portfolio

•Jan 1, 2026•0 citations

Unifying the Clifford hierarchy via symmetric matrices over rings

Narayanan Rengaswamy, Robert Calderbank, Henry D. Pfister

The Clifford hierarchy of unitary operators is a foundational concept for universal quantum computation. It was introduced to show that universal quantum computation can be realized via quantum teleportation, given access to certain standard resources. While the full structure of the hierarchy is still not understood, Cui et al. [S. X. Cui et al., Phys. Rev. A 95, 012329 (2017)] recently described the structure of diagonal unitaries in the hierarchy. They considered diagonal unitaries whose action on a computational basis qudit state is described by a ${2}^{k}\mathrm{th}$ root of unity raised to some polynomial function of the state, and they established the level of such unitaries in the hierarchy as a function of $k$ and the degree of the polynomial. For qubit systems, we consider $k\mathrm{th}$-level diagonal unitaries that can be described just by quadratic forms of the state over the ring ${\mathbb{Z}}_{{2}^{k}}$ of integers modulo ${2}^{k}$. The quadratic forms involve symmetric matrices over ${\mathbb{Z}}_{{2}^{k}}$ that can be used to efficiently describe all two-local and certain higher locality diagonal gates in the hierarchy. We also provide explicit algebraic descriptions of their action on Pauli matrices, which establishes a natural recursion to diagonal unitaries from lower levels. The result involves symplectic matrices over ${\mathbb{Z}}_{{2}^{k}}$ and hence our perspective unifies a subgroup of diagonal gates in the Clifford hierarchy with the binary symplectic framework for gates in the Clifford group. We augment our description with simple examples for certain standard gates. In addition to demonstrating structure, these formulas might prove useful in applications such as (i) classical simulation of quantum circuits, especially via the stabilizer rank approach, (ii) synthesis of logical non-Clifford unitaries, specifically alternatives to expensive magic state distillation, and (iii) decomposition of arbitrary unitaries beyond the $\mathrm{Clifford}+T$ set of gates, perhaps leading to shorter depth circuits. Our results suggest that some nondiagonal gates in the hierarchy might also be understood by generalizing other binary symplectic matrices to integer rings.

arXiv:1902.04022•Physical Review A•Aug 7, 2019•29 citations

Clifford Circuits on Qudits of Mixed Dimension

Milo Moses, Jacek Horecki, Konrad Deka +1 more

Abstract Associated to every finite abelian group G , there is a generalization of qubit Clifford group associated to G . We demonstrate that every G -Clifford gate can be decomposed into some distinguished elementary types: Fourier transforms, quadratic phase gates, and automorphism gates. Combined with earlier results on classical simulation of normalizer circuits, this implies a generalized Gottesman-Knill-type result. We additionally provide circuits for a universal quantum computing scheme based on local two-qudit G -Clifford gates and magic states.

Quantum Information and Computation•Mar 1, 2026•0 citations

Normalizer Circuits and Quantum Computation

Juan Bermejo-Vega

(Abridged abstract.) In this thesis we introduce new models of quantum computation to study the emergence of quantum speed-up in quantum computer algorithms. Our first contribution is a formalism of restricted quantum operations, named normalizer circuit formalism, based on algebraic extensions of the qubit Clifford gates (CNOT, Hadamard and $π/4$-phase gates): a normalizer circuit consists of quantum Fourier transforms (QFTs), automorphism gates and quadratic phase gates associated to a set $G$, which is either an abelian group or abelian hypergroup. Though Clifford circuits are efficiently classically simulable, we show that normalizer circuit models encompass Shor's celebrated factoring algorithm and the quantum algorithms for abelian Hidden Subgroup Problems. We develop classical-simulation techniques to characterize under which scenarios normalizer circuits provide quantum speed-ups. Finally, we devise new quantum algorithms for finding hidden hyperstructures. The results offer new insights into the source of quantum speed-ups for several algebraic problems. Our second contribution is an algebraic (group- and hypergroup-theoretic) framework for describing quantum many-body states and classically simulating quantum circuits. Our framework extends Gottesman's Pauli Stabilizer Formalism (PSF), wherein quantum states are written as joint eigenspaces of stabilizer groups of commuting Pauli operators: while the PSF is valid for qubit/qudit systems, our formalism can be applied to discrete- and continuous-variable systems, hybrid settings, and anyonic systems. These results enlarge the known families of quantum processes that can be efficiently classically simulated. This thesis also establishes a precise connection between Shor's quantum algorithm and the stabilizer formalism, revealing a common mathematical structure in several quantum speed-ups and error-correcting codes.

arXiv:1611.09274•Nov 28, 2016•9 citations

Structure of the Majorana Clifford group

Valérie Bettaque, Brian G. Swingle

In quantum information science, Clifford operators and stabilizer codes play a central role for systems of qubits (or qudits). In this paper, we study their analogues for systems composed of Majorana fermions. In this case, a crucial role is played by fermion parity symmetry, which is an unbreakable symmetry present in any system with fundamentally fermionic degrees of freedom. We prove that the subgroup of parity-preserving Majorana Cliffords can be represented by the orthogonal group over the binary field $\F$, and we show how it can be generated by braiding operators and used to construct any (even-parity) Majorana stabilizer code. We also analyze the frame potential for this so-called p-Clifford group when acting on a fixed-parity sector of the Hilbert space, proving that it is equivalent to the frame potential of the ordinary Clifford group acting on the same sector.

arXiv:2407.11319•Physical Review A•Jul 14, 2025•12 citations
Certain families of quantum mechanical models can be described and solved efficiently on a classical computer, including qubit or qudit Clifford circuits and stabilizer codes, free-boson or free-fermion models, and certain rotor and GKP codes. We show that all of these families can be described as instances of the same algebraic structure, namely quadratic functions over abelian groups, or more generally over (super) Hopf algebras. Different kinds of degrees of freedom correspond to different "elementary" abelian groups or Hopf algebras: Z2\mathbb{Z}_2Z2​ for qubits, Zd\mathbb{Z}_dZd​ for qudits, R\mathbb{R}R for continuous variables, both Z\mathbb{Z}Z and R/Z\mathbb{R}/\mathbb{Z}R/Z for rotors, and a super Hopf algebra F\mathcal FF for fermionic modes. Objects such as states, operators, superoperators, or projection-operator valued measures, etc, are tensors. For the solvable models above, these tensors are quadratic tensors based on quadratic functions. Quadratic tensors with nnn degrees of freedom are fully specified by only O(n2)O(n^2)O(n2) coefficients. Tensor networks of quadratic tensors can be contracted efficiently on the level of these coefficients, using an operation reminiscent of the Schur complement. Our formalism naturally includes models with mixed degrees of freedom, such as qudits of different dimensions. We also use quadratic functions to define generalized stabilizer codes and Clifford gates for arbitrary abelian groups. Finally, we give a generalization from quadratic (or 2nd order) to iiith order tensors, which are specified by O(ni)O(n^i)O(ni) coefficients but cannot be contracted efficiently in general.
The paper "Quadratic tensors as a unification of Clifford, Gaussian, and free-fermion physics" by Andreas Bauer and Seth Lloyd presents a unified algebraic framework for efficiently simulable quantum models. It demonstrates that Clifford circuits, stabilizer codes, free-boson (Gaussian) models, free-fermion models, and certain rotor/Gottesman-Kitaev-Preskill (GKP) codes are all instances of quadratic functions over abelian groups or (super) commutative Hopf algebras. Quadratic tensors, representing quantum objects like states and operators, are specified by O(n²) coefficients for n degrees of freedom and can be efficiently contracted using a generalized Schur complement. The framework supports mixed degrees of freedom (e.g., qudits, continuous variables, fermions) and extends to generalized stabilizer codes and Clifford operations. A generalization to ith-order tensors is provided, though they lack efficient contractibility. This review summarizes the paper's content, compares it with fractal geometry concepts, and ideates connections to Dr. Syed Muntasir Mamun's quantum articulations. Mamun, SM (2026)……………………………………………1 Unifying Algebraic Structures in Solvable Quantum Models: A Review of Quadratic Tensors with Fractal Interpretations and Emergent Quantum Connections Also available on Academia.edu: https://www.academia.edu/attachments/131608598/download_file?s=portfolio
This paper presents a rigorous mathematical and ontological synthesis of solvable quantum systems and emergent fractal geometries. By leveraging the quadratic tensor framework, we demonstrate that disparate families of quantum models—including Clifford circuits, stabilizer codes, Gaussian states, and free-fermion systems—can be unified as quadratic functions over abelian groups or super-commutative Hopf algebras. This algebraic unification permits classical simulation with O(n2)O(n^2)O(n2) complexity via a generalized Schur complement contraction mechanism, dissolving the boundaries between discrete-variable qudits and continuous-variable bosonic modes. However, physical reality frequently transcends these smooth, integer-dimensional algebraic bases. We integrate a fractal-recursive ontology, identifying that quantum trajectories in path integrals and energy spectra in quantum materials (e.g., Hofstadter's butterfly) exhibit non-integer Hausdorff dimensions and self-similar architectures that challenge traditional linear causality. We further explore the transition from quadratic to iii-th order tensors, identifying the Clifford hierarchy's correspondence to higher-order polynomial maps and the resulting computational boundaries of the Gottesman-Knill theorem. Also available on Academia.edu: https://www.academia.edu/attachments/131609415/download_file?s=portfolio
The Clifford hierarchy of unitary operators is a foundational concept for universal quantum computation. It was introduced to show that universal quantum computation can be realized via quantum teleportation, given access to certain standard resources. While the full structure of the hierarchy is still not understood, Cui et al. [S. X. Cui et al., Phys. Rev. A 95, 012329 (2017)] recently described the structure of diagonal unitaries in the hierarchy. They considered diagonal unitaries whose action on a computational basis qudit state is described by a 2kth{2}^{k}\mathrm{th}2kth root of unity raised to some polynomial function of the state, and they established the level of such unitaries in the hierarchy as a function of kkk and the degree of the polynomial. For qubit systems, we consider kthk\mathrm{th}kth-level diagonal unitaries that can be described just by quadratic forms of the state over the ring Z2k{\mathbb{Z}}_{{2}^{k}}Z2k​ of integers modulo 2k{2}^{k}2k. The quadratic forms involve symmetric matrices over Z2k{\mathbb{Z}}_{{2}^{k}}Z2k​ that can be used to efficiently describe all two-local and certain higher locality diagonal gates in the hierarchy. We also provide explicit algebraic descriptions of their action on Pauli matrices, which establishes a natural recursion to diagonal unitaries from lower levels. The result involves symplectic matrices over Z2k{\mathbb{Z}}_{{2}^{k}}Z2k​ and hence our perspective unifies a subgroup of diagonal gates in the Clifford hierarchy with the binary symplectic framework for gates in the Clifford group. We augment our description with simple examples for certain standard gates. In addition to demonstrating structure, these formulas might prove useful in applications such as (i) classical simulation of quantum circuits, especially via the stabilizer rank approach, (ii) synthesis of logical non-Clifford unitaries, specifically alternatives to expensive magic state distillation, and (iii) decomposition of arbitrary unitaries beyond the Clifford+T\mathrm{Clifford}+TClifford+T set of gates, perhaps leading to shorter depth circuits. Our results suggest that some nondiagonal gates in the hierarchy might also be understood by generalizing other binary symplectic matrices to integer rings.
Abstract Associated to every finite abelian group G , there is a generalization of qubit Clifford group associated to G . We demonstrate that every G -Clifford gate can be decomposed into some distinguished elementary types: Fourier transforms, quadratic phase gates, and automorphism gates. Combined with earlier results on classical simulation of normalizer circuits, this implies a generalized Gottesman-Knill-type result. We additionally provide circuits for a universal quantum computing scheme based on local two-qudit G -Clifford gates and magic states.
(Abridged abstract.) In this thesis we introduce new models of quantum computation to study the emergence of quantum speed-up in quantum computer algorithms. Our first contribution is a formalism of restricted quantum operations, named normalizer circuit formalism, based on algebraic extensions of the qubit Clifford gates (CNOT, Hadamard and π/4π/4π/4-phase gates): a normalizer circuit consists of quantum Fourier transforms (QFTs), automorphism gates and quadratic phase gates associated to a set GGG, which is either an abelian group or abelian hypergroup. Though Clifford circuits are efficiently classically simulable, we show that normalizer circuit models encompass Shor's celebrated factoring algorithm and the quantum algorithms for abelian Hidden Subgroup Problems. We develop classical-simulation techniques to characterize under which scenarios normalizer circuits provide quantum speed-ups. Finally, we devise new quantum algorithms for finding hidden hyperstructures. The results offer new insights into the source of quantum speed-ups for several algebraic problems. Our second contribution is an algebraic (group- and hypergroup-theoretic) framework for describing quantum many-body states and classically simulating quantum circuits. Our framework extends Gottesman's Pauli Stabilizer Formalism (PSF), wherein quantum states are written as joint eigenspaces of stabilizer groups of commuting Pauli operators: while the PSF is valid for qubit/qudit systems, our formalism can be applied to discrete- and continuous-variable systems, hybrid settings, and anyonic systems. These results enlarge the known families of quantum processes that can be efficiently classically simulated. This thesis also establishes a precise connection between Shor's quantum algorithm and the stabilizer formalism, revealing a common mathematical structure in several quantum speed-ups and error-correcting codes.
In quantum information science, Clifford operators and stabilizer codes play a central role for systems of qubits (or qudits). In this paper, we study their analogues for systems composed of Majorana fermions. In this case, a crucial role is played by fermion parity symmetry, which is an unbreakable symmetry present in any system with fundamentally fermionic degrees of freedom. We prove that the subgroup of parity-preserving Majorana Cliffords can be represented by the orthogonal group over the binary field $\F$, and we show how it can be generated by braiding operators and used to construct any (even-parity) Majorana stabilizer code. We also analyze the frame potential for this so-called p-Clifford group when acting on a fixed-parity sector of the Hilbert space, proving that it is equivalent to the frame potential of the ordinary Clifford group acting on the same sector.