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:quant-ph/0701103 · Quantum Information and Computation

Generalized Clifford groups and simulation of associated quantum circuits

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

Published Jan 1, 2008• 29 citations
arXivHTMLPDF

Abstract

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$.

DOI
10.26421/qic8.1-2-8

Related papers

Clifford quantum computer and the Mathieu groups

Michel R. P. Planat

One learned from Gottesman-Knill theorem that the Clifford model of quantum computing \cite{Clark07} may be generated from a few quantum gates, the Hadamard, Phase and Controlled-Z gates, and efficiently simulated on a classical computer. We employ the group theoretical package GAP\cite{GAP} for simulating the two qubit Clifford group $\mathcal{C}_2$. We already found that the symmetric group S(6), aka the automorphism group of the generalized quadrangle W(2), controls the geometry of the two-qubit Pauli graph \cite{Pauligraphs}. Now we find that the {\it inner} group ${Inn}(\mathcal{C}_2)=\mathcal{C}_2/{Center}(\mathcal{C}_2)$ exactly contains two normal subgroups, one isomorphic to $\mathcal{Z}_2^{\times 4}$ (of order 16), and the second isomorphic to the parent $A'(6)$ (of order 5760) of the alternating group A(6). The group $A'(6)$ stabilizes an {\it hexad} in the Steiner system $S(3,6,22)$ attached to the Mathieu group M(22). Both groups A(6) and $A'(6)$ have an {\it outer} automorphism group $\mathcal{Z}_2\times \mathcal{Z}_2$, a feature we associate to two-qubit quantum entanglement.

arXiv:0711.1733•Nov 12, 2007•2 citations

On Classical Simulation of Quantum Circuits Composed of Clifford Gates

George Biswas

The Gottesman–Knill theorem asserts that quantum circuits composed solely of Clifford gates can be efficiently simulated classically. This theorem hinges on the fact that Clifford gates map Pauli strings to other Pauli strings, thereby allowing for a structured simulation process using classical computations. In this work, we break down the step-by-step procedure of the Gottesman–Knill theorem in a beginner-friendly manner, leveraging concepts such as matrix products, tensor products, commutation, anti-commutation, eigenvalues, and eigenvectors of quantum mechanical operators. Through detailed examples illustrating superposition and entanglement phenomena, we aim to provide a clear understanding of the classical simulation of Clifford gate-based quantum circuits. While we do not provide a formal proof of the theorem, we offer intuitive physical insights at each stage where necessary, empowering readers to grasp the fundamental principles underpinning this intriguing aspect of quantum computation. Quanta 2024; 13: 20–27.

arXiv:2405.13590•Quanta•Jul 29, 2024•6 citations

Classical simulation complexity of extended Clifford circuits

Richard Jozsa, M. Van den Nest

Clifford gates are a winsome class of quantum operations combining mathematical elegance with physical significance. The Gottesman-Knill theorem asserts that Clifford computations can be classically efficiently simulated but this is true only in a suitably restricted setting. Here we consider Clifford computations with a variety of additional ingredients: (a) strong vs. weak simulation, (b) inputs being computational basis states vs. general product states, (c) adaptive vs. non-adaptive choices of gates for circuits involving intermediate measurements, (d) single line outputs vs. multi-line outputs. We consider the classical simulation complexity of all combinations of these ingredients and show that many are not classically efficiently simulatable (subject to common complexity assumptions such as P not equal to NP). Our results reveal a surprising proximity of classical to quantum computing power viz. a class of classically simulatable quantum circuits which yields universal quantum computation if extended by a purely classical additional ingredient that does not extend the class of quantum processes occurring.

arXiv:1305.6190•Quantum Information and Computation•May 1, 2014•97 citations

On the stabilizer formalism and its generalization

Éloi Descamps, Borivoje Dakić

Abstract The standard stabilizer formalism provides a setting to show that quantum computations restricted to operations within the Clifford group are classically efficiently simulable: this is the content of the well-known Gottesman–Knill theorem. This work analyzes the mathematical structure behind this theorem to find possible generalizations and derivation of constraints required for constructing a non-trivial generalized Clifford group. We prove that if the closure of the stabilizing set is dense in the set of SU(d) transformations, then the associated Clifford group is trivial, consisting only of local gates and permutations of subsystems. This result demonstrates the close relationship between the density of the stabilizing set and the simplicity of the corresponding Clifford group. We apply the analysis to investigate stabilization with binary observables for qubits and find that the formalism is equivalent to the standard stabilization for a low number of qubits. Based on the observed patterns, we conjecture that a large class of generalized stabilizer states are equivalent to the standard ones. Our results provide better insights into the structure of Gottesman–Knill-type results, consequently allowing us to draw a sharper line between quantum and classical computation.

arXiv:2309.09815•Journal of Physics A Mathematical and Theoretical•Oct 11, 2024•2 citations

On Clifford groups in quantum computing

J. Tolar

The term Clifford group was introduced in 1998 by D. Gottesmann in his investigation of quantum error-correcting codes. The simplest Clifford group in multiqubit quantum computation is generated by a restricted set of unitary Clifford gates - the Hadamard, π /4-phase and controlled-X gates. Because of this restriction the Clifford model of quantum computation can be efficiently simulated on a classical computer (the Gottesmann-Knill theorem). However, this fact does not diminish the importance of the Clifford model, since it may serve as a suitable starting point for a full-fledged quantum computation. In the general case of a single or composite quantum system with finite-dimensional Hilbert space the finite Weyl-Heisenberg group of unitary operators defines the quantum kinematics and the states of the quantum register. Then the corresponding Clifford group is defined as the group of unitary operators leaving the Weyl-Heisenberg group invariant. The aim of this contribution is to show that our comprehensive results on symmetries of the Pauli gradings of quantum operator algebras - covering any single as well as composite finite quantum systems - directly correspond to Clifford groups defined as quotients with respect to U(1).

arXiv:1810.10259•Journal of Physics Conference Series•Aug 1, 2018•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
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.
One learned from Gottesman-Knill theorem that the Clifford model of quantum computing \cite{Clark07} may be generated from a few quantum gates, the Hadamard, Phase and Controlled-Z gates, and efficiently simulated on a classical computer. We employ the group theoretical package GAP\cite{GAP} for simulating the two qubit Clifford group C2\mathcal{C}_2C2​. We already found that the symmetric group S(6), aka the automorphism group of the generalized quadrangle W(2), controls the geometry of the two-qubit Pauli graph \cite{Pauligraphs}. Now we find that the {\it inner} group Inn(C2)=C2/Center(C2){Inn}(\mathcal{C}_2)=\mathcal{C}_2/{Center}(\mathcal{C}_2)Inn(C2​)=C2​/Center(C2​) exactly contains two normal subgroups, one isomorphic to Z2×4\mathcal{Z}_2^{\times 4}Z2×4​ (of order 16), and the second isomorphic to the parent A′(6)A'(6)A′(6) (of order 5760) of the alternating group A(6). The group A′(6)A'(6)A′(6) stabilizes an {\it hexad} in the Steiner system S(3,6,22)S(3,6,22)S(3,6,22) attached to the Mathieu group M(22). Both groups A(6) and A′(6)A'(6)A′(6) have an {\it outer} automorphism group Z2×Z2\mathcal{Z}_2\times \mathcal{Z}_2Z2​×Z2​, a feature we associate to two-qubit quantum entanglement.
The Gottesman–Knill theorem asserts that quantum circuits composed solely of Clifford gates can be efficiently simulated classically. This theorem hinges on the fact that Clifford gates map Pauli strings to other Pauli strings, thereby allowing for a structured simulation process using classical computations. In this work, we break down the step-by-step procedure of the Gottesman–Knill theorem in a beginner-friendly manner, leveraging concepts such as matrix products, tensor products, commutation, anti-commutation, eigenvalues, and eigenvectors of quantum mechanical operators. Through detailed examples illustrating superposition and entanglement phenomena, we aim to provide a clear understanding of the classical simulation of Clifford gate-based quantum circuits. While we do not provide a formal proof of the theorem, we offer intuitive physical insights at each stage where necessary, empowering readers to grasp the fundamental principles underpinning this intriguing aspect of quantum computation. Quanta 2024; 13: 20–27.
Clifford gates are a winsome class of quantum operations combining mathematical elegance with physical significance. The Gottesman-Knill theorem asserts that Clifford computations can be classically efficiently simulated but this is true only in a suitably restricted setting. Here we consider Clifford computations with a variety of additional ingredients: (a) strong vs. weak simulation, (b) inputs being computational basis states vs. general product states, (c) adaptive vs. non-adaptive choices of gates for circuits involving intermediate measurements, (d) single line outputs vs. multi-line outputs. We consider the classical simulation complexity of all combinations of these ingredients and show that many are not classically efficiently simulatable (subject to common complexity assumptions such as P not equal to NP). Our results reveal a surprising proximity of classical to quantum computing power viz. a class of classically simulatable quantum circuits which yields universal quantum computation if extended by a purely classical additional ingredient that does not extend the class of quantum processes occurring.
Abstract The standard stabilizer formalism provides a setting to show that quantum computations restricted to operations within the Clifford group are classically efficiently simulable: this is the content of the well-known Gottesman–Knill theorem. This work analyzes the mathematical structure behind this theorem to find possible generalizations and derivation of constraints required for constructing a non-trivial generalized Clifford group. We prove that if the closure of the stabilizing set is dense in the set of SU(d) transformations, then the associated Clifford group is trivial, consisting only of local gates and permutations of subsystems. This result demonstrates the close relationship between the density of the stabilizing set and the simplicity of the corresponding Clifford group. We apply the analysis to investigate stabilization with binary observables for qubits and find that the formalism is equivalent to the standard stabilization for a low number of qubits. Based on the observed patterns, we conjecture that a large class of generalized stabilizer states are equivalent to the standard ones. Our results provide better insights into the structure of Gottesman–Knill-type results, consequently allowing us to draw a sharper line between quantum and classical computation.
The term Clifford group was introduced in 1998 by D. Gottesmann in his investigation of quantum error-correcting codes. The simplest Clifford group in multiqubit quantum computation is generated by a restricted set of unitary Clifford gates - the Hadamard, π /4-phase and controlled-X gates. Because of this restriction the Clifford model of quantum computation can be efficiently simulated on a classical computer (the Gottesmann-Knill theorem). However, this fact does not diminish the importance of the Clifford model, since it may serve as a suitable starting point for a full-fledged quantum computation. In the general case of a single or composite quantum system with finite-dimensional Hilbert space the finite Weyl-Heisenberg group of unitary operators defines the quantum kinematics and the states of the quantum register. Then the corresponding Clifford group is defined as the group of unitary operators leaving the Weyl-Heisenberg group invariant. The aim of this contribution is to show that our comprehensive results on symmetries of the Pauli gradings of quantum operator algebras - covering any single as well as composite finite quantum systems - directly correspond to Clifford groups defined as quotients with respect to U(1).
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.