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

Quantum Information and Computation

Clifford Circuits on Qudits of Mixed Dimension

Milo Moses, Jacek Horecki, Konrad Deka, Jan Tułowiecki

Published Mar 1, 2026• 0 citations
Publisher

Abstract

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.

DOI
10.2478/qic-2026-0009

Related papers

Clifford circuits over non-cyclic abelian groups

Milo Moses, Jacek Horecki, Konrad Deka +1 more

We present a discussion of the generalized Clifford group over non-cyclic finite abelian groups. These Clifford groups appear naturally in the theory of topological error correction and abelian anyon models. We demonstrate a generalized Gottesman-Knill theorem, stating that every Clifford circuit can be efficiently classically simulated. We additionally provide circuits for a universal quantum computing scheme based on local two-qudit Clifford gates and magic states.

arXiv:2402.13994•Feb 21, 2024•2 citations

Normalizer circuits and a Gottesman-Knill theorem for infinite-dimensional systems

Juan Bermejo-Vega, Cedric Yen-Yu Lin, Maarten Van den Nest

Normalizer circuits [1, 2] are generalized Clifford circuits that act on arbitrary finitedimensional systems Hd1 ⊗ · · · ⊗ Hdn with a standard basis labeled by the elements of a finite Abelian group G = Zd1 × · · · × Zdn . Normalizer gates implement operations associated with the group G and can be of three types: quantum Fourier transforms, group automorphism gates and quadratic phase gates. In this work, we extend the normalizer formalism [1, 2] to infinite dimensions, by allowing normalizer gates to act on systems of the form H⊗a Z : each factor HZ has a standard basis labeled by integers Z, and a Fourier basis labeled by angles, elements of the circle group T. Normalizer circuits become hybrid quantum circuits acting both on continuous- and discrete-variable systems. We show that infinite-dimensional normalizer circuits can be efficiently simulated classically with a generalized stabilizer formalism for Hilbert spaces associated with groups of the form Z a ×T b ×Zd1 ×· · ·×Zdn . We develop new techniques to track stabilizer-groups based on normal forms for group automorphisms and quadratic functions. We use our normal forms to reduce the problem of simulating normalizer circuits to that of finding general solutions of systems of mixed real-integer linear equations [3] and exploit this fact to devise a robust simulation algorithm: the latter remains efficient even in pathological cases where stabilizer groups become infinite, uncountable and non-compact. The techniques developed in this paper might find applications in the study of fault-tolerant quantum computation with superconducting qubits [4, 5].

arXiv:1409.3208•Quantum Information and Computation•Apr 1, 2016•22 citations

Efficient classical simulations of quantum Fourier transforms and Normalizer circuits over Abelian groups

Maarten Van den Nest

The quantum Fourier transform (QFT) is an important ingredient in various quantum algorithms which achieve superpolynomial speed-ups over classical computers. In this paper we study under which conditions the QFT can be simulated efficiently classically. We introduce a class of quantum circuits, called \emph{normalizer circuits}: a normalizer circuit over a finite Abelian group is any quantum circuit comprising the QFT over the group, gates which compute automorphisms and gates which realize quadratic functions on the group. In our main result we prove that all normalizer circuits have polynomial-time classical simulations. The proof uses algorithms for linear diophantine equation solving and the monomial matrix formalism introduced in our earlier work. Our result generalizes the Gottesman-Knill theorem: in particular, Clifford circuits for $d$-level qudits arise as normalizer circuits over the group ${\mathbf Z}_d^m$. We also highlight connections between normalizer circuits and Shor's factoring algorithm, and the Abelian hidden subgroup problem in general. Finally we prove that quantum factoring cannot be realized as a normalizer circuit owing to its modular exponentiation subroutine.

arXiv:1201.4867•Quantum Information and Computation•Nov 1, 2013•33 citations

Generalized Clifford groups and simulation of associated quantum circuits

Stephen R. L. Clark, Richard Jozsa, Noah Linden

Quantum computations starting with computational basis states and involving only Clifford operations, are classically simulable despite the fact that they generate highly entangled states; this is the content of the Gottesman-Knill theorem. Here we isolate the ingredients of the theorem and provide generalisations of some of them with the aim of identifying new classes of simulable quantum computations. In the usual construction, Clifford operations arise as projective normalisers of the first and second tensor powers of the Pauli group. We consider replacing the Pauli group by an arbitrary finite subgroup $G$ of $U(d)$. In particular we seek $G$ such that $G\otimes G$ has an entangling normaliser. Via a generalisation of the Gottesman-Knill theorem the resulting normalisers lead to classes of quantum circuits that can be classically efficiently simulated. For the qubit case $d = 2$ we exhaustively treat all finite irreducible subgroups of $U(2)$ and find that the only ones (up to unitary equivalence and trivial phase extensions) with entangling normalisers are the groups generated by X and the $n^{\rm th}$ root of $Z$ for $n \in \N$.

arXiv:quant-ph/0701103•Quantum Information and Computation•Jan 1, 2008•29 citations

Classical simulations of Abelian-group normalizer circuits with intermediate measurements

Juan Bermejo-Vega, Maarten Van den Nest

Quantum normalizer circuits were recently introduced as generalizations of Clifford circuits: a normalizer circuit over a finite Abelian group G is composed of the quantum Fourier transform (QFT) over G, together with gates which compute quadratic functions and automorphisms. In \cite{VDNest_12_QFTs} it was shown that every normalizer circuit can be simulated efficiently classically. This result provides a nontrivial example of a family of quantum circuits that cannot yield exponential speed-ups in spite of usage of the QFT, the latter being a central quantum algorithmic primitive. Here we extend the aforementioned result in several ways. Most importantly, we show that normalizer circuits supplemented with intermediate measurements can also be simulated efficiently classically, even when the computation proceeds adaptively. This yields a generalization of the Gottesman-Knill theorem (valid for n-qubit Clifford operations) to quantum circuits described by arbitrary finite Abelian groups. Moreover, our simulations are twofold: we present efficient classical algorithms to sample the measurement probability distribution of any adaptive-normalizer computation, as well as to compute the amplitudes of the state vector in every step of it. Finally we develop a generalization of the stabilizer formalism relative to arbitrary finite Abelian groups: for example we characterize how to update stabilizers under generalized Pauli measurements and provide a normal form of the amplitudes of generalized stabilizer states using quadratic functions and subgroup cosets.

arXiv:1210.3637•Quantum Information and Computation•Mar 1, 2014•40 citations

Hybrid Qubit-Rotor Quantum Systems: Clifford Structure, Universal Control, and Applications

Dengyao Luo, Arvin Kushwaha, Mastawal Tirfe +1 more

A $U(1)$ quantum rotor pairs a periodic angle with an integer-valued conjugate momentum, and occurs in molecular rotation, superconducting phase-charge circuits, and compact gauge fields. Coupling such a rotor coherently to qubits gives a hybrid register whose control structure is not inherited from either the oscillator-qubit or the qudit case. We develop a Clifford theory, together with a universal-control result, for registers of $n$ qubits and $r$ rotors. We classify all automorphisms of the hybrid phase space $\mathbb{F}_2^{2n}\times\mathbb{Z}^r\times\mathbb{T}^r$ that preserve the Weyl commutation relations, and give an explicit finite Clifford circuit for each one. The classification is directional: rotor momentum parity may control qubit Pauli operations within the Clifford group, while every nonzero qubit-controlled rotor momentum shift is non-Clifford. It also yields normal forms for the mixed qubit-rotor couplings and the exact minimum number of elementary mixed gates needed to synthesize them. Adding a rotor cosine potential and one fixed qubit-rotor conditional phase to the local Clifford operations gives universal control on the full Hilbert space in the strong operator topology. We then apply this structure in three settings: an exact controlled-shift realization of gauge-covariant matter hopping, which is necessarily non-Clifford; rotor phase estimation with direct angle readout and probe optimization under momentum-support and energy constraints; and finite Fourier transforms on rotor momentum codes, where the one-rotor transform for $d=2^s$ compiles into $O(s)$ momentum-selective and controlled-shift instructions and each cross-register Fourier factor is implemented by one quadratic rotor Clifford gate.

quant-pharXiv:2608.20227•Aug 21, 2026•1 citation
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.
Normalizer circuits [1, 2] are generalized Clifford circuits that act on arbitrary finitedimensional systems Hd1 ⊗ · · · ⊗ Hdn with a standard basis labeled by the elements of a finite Abelian group G = Zd1 × · · · × Zdn . Normalizer gates implement operations associated with the group G and can be of three types: quantum Fourier transforms, group automorphism gates and quadratic phase gates. In this work, we extend the normalizer formalism [1, 2] to infinite dimensions, by allowing normalizer gates to act on systems of the form H⊗a Z : each factor HZ has a standard basis labeled by integers Z, and a Fourier basis labeled by angles, elements of the circle group T. Normalizer circuits become hybrid quantum circuits acting both on continuous- and discrete-variable systems. We show that infinite-dimensional normalizer circuits can be efficiently simulated classically with a generalized stabilizer formalism for Hilbert spaces associated with groups of the form Z a ×T b ×Zd1 ×· · ·×Zdn . We develop new techniques to track stabilizer-groups based on normal forms for group automorphisms and quadratic functions. We use our normal forms to reduce the problem of simulating normalizer circuits to that of finding general solutions of systems of mixed real-integer linear equations [3] and exploit this fact to devise a robust simulation algorithm: the latter remains efficient even in pathological cases where stabilizer groups become infinite, uncountable and non-compact. The techniques developed in this paper might find applications in the study of fault-tolerant quantum computation with superconducting qubits [4, 5].
The quantum Fourier transform (QFT) is an important ingredient in various quantum algorithms which achieve superpolynomial speed-ups over classical computers. In this paper we study under which conditions the QFT can be simulated efficiently classically. We introduce a class of quantum circuits, called \emph{normalizer circuits}: a normalizer circuit over a finite Abelian group is any quantum circuit comprising the QFT over the group, gates which compute automorphisms and gates which realize quadratic functions on the group. In our main result we prove that all normalizer circuits have polynomial-time classical simulations. The proof uses algorithms for linear diophantine equation solving and the monomial matrix formalism introduced in our earlier work. Our result generalizes the Gottesman-Knill theorem: in particular, Clifford circuits for ddd-level qudits arise as normalizer circuits over the group Zdm{\mathbf Z}_d^mZdm​. We also highlight connections between normalizer circuits and Shor's factoring algorithm, and the Abelian hidden subgroup problem in general. Finally we prove that quantum factoring cannot be realized as a normalizer circuit owing to its modular exponentiation subroutine.
Quantum computations starting with computational basis states and involving only Clifford operations, are classically simulable despite the fact that they generate highly entangled states; this is the content of the Gottesman-Knill theorem. Here we isolate the ingredients of the theorem and provide generalisations of some of them with the aim of identifying new classes of simulable quantum computations. In the usual construction, Clifford operations arise as projective normalisers of the first and second tensor powers of the Pauli group. We consider replacing the Pauli group by an arbitrary finite subgroup GGG of U(d)U(d)U(d). In particular we seek GGG such that G⊗GG\otimes GG⊗G has an entangling normaliser. Via a generalisation of the Gottesman-Knill theorem the resulting normalisers lead to classes of quantum circuits that can be classically efficiently simulated. For the qubit case d=2d = 2d=2 we exhaustively treat all finite irreducible subgroups of U(2)U(2)U(2) and find that the only ones (up to unitary equivalence and trivial phase extensions) with entangling normalisers are the groups generated by X and the nthn^{\rm th}nth root of ZZZ for n∈Nn \in \Nn∈N.
Quantum normalizer circuits were recently introduced as generalizations of Clifford circuits: a normalizer circuit over a finite Abelian group G is composed of the quantum Fourier transform (QFT) over G, together with gates which compute quadratic functions and automorphisms. In \cite{VDNest_12_QFTs} it was shown that every normalizer circuit can be simulated efficiently classically. This result provides a nontrivial example of a family of quantum circuits that cannot yield exponential speed-ups in spite of usage of the QFT, the latter being a central quantum algorithmic primitive. Here we extend the aforementioned result in several ways. Most importantly, we show that normalizer circuits supplemented with intermediate measurements can also be simulated efficiently classically, even when the computation proceeds adaptively. This yields a generalization of the Gottesman-Knill theorem (valid for n-qubit Clifford operations) to quantum circuits described by arbitrary finite Abelian groups. Moreover, our simulations are twofold: we present efficient classical algorithms to sample the measurement probability distribution of any adaptive-normalizer computation, as well as to compute the amplitudes of the state vector in every step of it. Finally we develop a generalization of the stabilizer formalism relative to arbitrary finite Abelian groups: for example we characterize how to update stabilizers under generalized Pauli measurements and provide a normal form of the amplitudes of generalized stabilizer states using quadratic functions and subgroup cosets.
A U(1)U(1)U(1) quantum rotor pairs a periodic angle with an integer-valued conjugate momentum, and occurs in molecular rotation, superconducting phase-charge circuits, and compact gauge fields. Coupling such a rotor coherently to qubits gives a hybrid register whose control structure is not inherited from either the oscillator-qubit or the qudit case. We develop a Clifford theory, together with a universal-control result, for registers of nnn qubits and rrr rotors. We classify all automorphisms of the hybrid phase space F22n×Zr×Tr\mathbb{F}_2^{2n}\times\mathbb{Z}^r\times\mathbb{T}^rF22n​×Zr×Tr that preserve the Weyl commutation relations, and give an explicit finite Clifford circuit for each one. The classification is directional: rotor momentum parity may control qubit Pauli operations within the Clifford group, while every nonzero qubit-controlled rotor momentum shift is non-Clifford. It also yields normal forms for the mixed qubit-rotor couplings and the exact minimum number of elementary mixed gates needed to synthesize them. Adding a rotor cosine potential and one fixed qubit-rotor conditional phase to the local Clifford operations gives universal control on the full Hilbert space in the strong operator topology. We then apply this structure in three settings: an exact controlled-shift realization of gauge-covariant matter hopping, which is necessarily non-Clifford; rotor phase estimation with direct angle readout and probe optimization under momentum-support and energy constraints; and finite Fourier transforms on rotor momentum codes, where the one-rotor transform for d=2sd=2^sd=2s compiles into O(s)O(s)O(s) momentum-selective and controlled-shift instructions and each cross-register Fourier factor is implemented by one quadratic rotor Clifford gate.