Quick Navigation
Topics
Bosonic Continuous Variable Quantum Computing
Quadratic tensors as a unification of Clifford, Gaussian, and free-fermion physics
arXiv
Authors: Andreas Bauer, Seth Lloyd
Year
2026
Paper ID
3503
Status
Preprint
Abstract Read
~2 min
Abstract Words
242
Citations
N/A
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\(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 ith order tensors, which are specified by O\(ni\) coefficients but cannot be contracted efficiently in general.
Why This Paper Matters
- This paper contributes to the Bosonic & Continuous-Variable Quantum Computing research area in the Quantum Articles archive.
- It adds a 2026 reference point for readers tracking recent quantum research.
- 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...
Paper Tools
Become a member to use research tools
Sign in to open papers, visit source links, share, cite, compare, copy DOI links, request category corrections, and build your reading list.
Show Paper arXiv Publisher Share
Cite This Paper
Copy URL
Compare
Copy DOI Add to Reading List
Category Correction Request
Category Correction Request
Help us improve classification quality by proposing a better category. Every request is reviewed by an admin.
Sign in to submit a category correction request for this paper.
Log In to SubmitReferences & Citation Signals
Community Reactions
Quick sentiment from readers on this paper.
Score:
0
Likes: 0
Dislikes: 0
Sign in to react to this paper.
Discussion & Reviews (Moderated)
Average Rating: 0.0 / 5 (0 ratings)
No written reviews yet.