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:2204.07593 · Physical Review A

Entropic lens on stabilizer states

Cynthia A Keeler, William Munizzi, Jason Pollack

Published Dec 16, 2022• 8 citations
arXivHTMLPDF

Abstract

The $n$-qubit stabilizer states are those left invariant by a ${2}^{n}$-element subset of the Pauli group. The Clifford group is the group of unitaries which take stabilizer states to stabilizer states; a physically motivated generating set, the Hadamard, phase, and controlled-not (cnot) gates which comprise the Clifford gates, impose a graph structure on the set of stabilizers. We explicitly construct these structures, the ``reachability graphs,'' at $n\ensuremath{\le}5$. When we consider only a subset of the Clifford gates, the reachability graphs separate into multiple, often complicated, connected components. Seeking an understanding of the entropic structure of the stabilizer states, which is ultimately built up by cnot gate applications on two qubits, we are motivated to consider the restricted subgraphs built from the Hadamard and cnot gates acting on only two of the $n$ qubits. We show how the two subgraphs already present at two qubits are embedded into more complicated subgraphs at three and four qubits. We argue that no additional types of subgraph appear beyond four qubits, but that the entropic structures within the subgraphs can grow progressively more complicated as the qubit number increases. Starting at four qubits, some of the stabilizer states have entropy vectors which are not allowed by holographic entropy inequalities. We comment on the nature of the transition between holographic and nonholographic states within the stabilizer reachability graphs.

DOI
10.1103/physreva.106.062418

Related papers

Bounding entanglement entropy with Clifford double cosets

Cynthia A Keeler, William Munizzi, Jason Pollack

Following on our previous work arXiv:2204.07593 and arXiv:2306.01043 studying the orbits of quantum states under Clifford circuits via `reachability graphs', we introduce `contracted graphs' whose vertices represent classes of quantum states with the same entropy vector. These contracted graphs represent the double cosets of the Clifford group, where the left cosets are built from the stabilizer subgroup of the starting state and the right cosets are built from the entropy-preserving operators. We study contracted graphs for stabilizer states, as well as W states and Dicke states, discussing how the diameter of a state's contracted graph constrains the `entropic diversity' of its $2$-qubit Clifford orbit. We derive an upper bound on the number of entropy vectors that can be generated using any $n$-qubit Clifford circuit, for any quantum state. We speculate on the holographic implications for the relative proximity of gravitational duals of states within the same Clifford orbit. Although we concentrate on how entropy evolves under the Clifford group, our double-coset formalism, and thus the contracted graph picture, is extendable to generic gate sets and generic state properties.

arXiv:2310.19874•Physical Review A•Jul 14, 2025•2 citations

Four qubits generated by Clifford gates

Frédéric Latour, Oscar Mario Perdomo

The Clifford group is the set of gates generated by the controlled not gates, the Hadamard gate and the P={{1,0},{0,i}} gate. We will say that a n-qubit state is a Clifford state if it can be prepared using Clifford gates. In this paper we study the set of all 4-qubit Clifford states. We prove that there are 293760 states and their entanglement entropy must be either 0, 2/3, 1, 4/3 and 5/3. We also show that any pair of these states can be connected using local gates and at most 3 CNOT gates. We achieve this by splitting the 293760 states into 18 groups where each pair of states in a group can be connected with a local Clifford gate. We then study how the different CNOT gates act on the 18 groups. We also study the Clifford states with real entries under the action of the subgroup C_R of Clifford gates with real entries. This time we show that every pair of Clifford states with real entries can be connected with at most 5 CNOT gates and local gates in C_R. The link https://youtu.be/42MI6ks2_eU leads to a YouTube video that explains the most important results in this paper.

arXiv:2004.08720•Apr 18, 2020•0 citations

Four-qubit states generated by Clifford gates

Frédéric Latour, Oscar Mario Perdomo

The Clifford group is the set of gates generated by controlled not (CNOT) gates and the two local gates [Formula: see text] and [Formula: see text]. We will say that an [Formula: see text]-qubit state is a Clifford state if it can be prepared using Clifford gates, this is, [Formula: see text] is Clifford if [Formula: see text] where [Formula: see text] is a Clifford gate. In this paper, we study the set of all 4-qubit Clifford states. We prove that there are 293760 states, each of which has entanglement entropy equal to 0, [Formula: see text], 1, [Formula: see text], or [Formula: see text]. We also show that any pair of these states can be connected using local gates and at most 3 CNOT gates. We also study the Clifford states with real entries under the action of the subgroup [Formula: see text] of Clifford gates with real entries. This time we show that every pair of Clifford states with real entries can be connected with at most 5 CNOT gates and local gates in [Formula: see text]. To understand the action of the 12 different CNOT gates, we partition the Clifford states into orbits using the equivalence relation: two states are equivalent if they differ by a local Clifford gate. We label each orbit in such a way that it is easy to see the effect of the CNOT gates. Diagrams and tables explaining the action of the CNOT gates on all the orbits are presented in the paper. The link https://youtu.be/42MI6ks2_eU leads to a YouTube video that explains the most important results in this paper.

International Journal of Quantum Information•Feb 26, 2022•0 citations

Clifford orbits from cayley graph quotients

Cynthia A Keeler, William Munizzi, Jason Pollack

We describe the structure of the $n$-qubit Clifford group $\mathcal{C}_n$ via Cayley graphs, whose vertices represent group elements and edges represent generators. In order to obtain the action of Clifford gates on a given quantum state, we introduce a quotient procedure. Quotienting the Cayley graph by the stabilizer subgroup of a state gives a reduced graph which depicts the state's Clifford orbit. Using this protocol for $\mathcal{C}_2$, we reproduce and generalize the reachability graphs introduced in \cite{Keeler2022}. Since the procedure is state-independent, we extend our study to non-stabilizer states, including the W and Dicke states. Our new construction provides a more precise understanding of state evolution under Clifford circuit action.

arXiv:2306.01043•Quantum Information and Computation•Feb 1, 2024•4 citations

Five-qubit states generated by Clifford gates

Frédéric Latour, Oscar Mario Perdomo

The Clifford group is the set of gates generated by controlled-Z gates, the phase gate and the Hadamard gate. We will say that a n-qubit state is a Clifford state if it can be prepared using Clifford gates. These states are known as the stabilizer states and they arise in quantum error correction. In this paper we study the set of all 5-qubit Clifford states. By using an exhaustive method we start by confirming that there are 19388160 states. The main goal of the paper is to understand the action of the controlled-Z gates action on the 5-qubit states. With this goal in mind, we partition the Clifford states into orbits using the equivalence relation: two states are equivalent if they differ by a local Clifford gate. We show that there are 93 orbits, and we label each orbit in such a way that it is easy to see the effect of the controlled-Z gates. Diagrams and tables explaining the action of the CZ gates on all the orbits are presented in the paper. A similar work is done for the real Clifford 5-qubits states, this is, for states that can be prepared with Controlled-Z gates, the Z gate and the Hadamard gate.

arXiv:2210.17034•Oct 31, 2022•1 citation

Reducing stabilizer circuits without the symplectic group

Marc Bataille

We start by studying the subgroup structures underlying stabilizer circuits. Then we apply our results to provide two normal forms for stabilizer circuits. These forms are computed by induction using simple conjugation rules in the Clifford group and our algorithms do not rely on a special decomposition in the symplectic group. The first normal form has shape CX-CZ-P-Z-X-H-CZ-P-H, where CX (resp. CZ) denotes a layer of CNOT (resp. controlled-Z) gates, P a layer of phase gates, X (resp. Z) a layer of Pauli-X (resp. Pauli-Z) gates. Then we replace most of the controlled-Z gates by CNOT gates to obtain a second normal form of type P-CX-CZ-CX-Z-X-H-CZ-CX-P-H. In this second form, both controlled-Z layers have depth 1 and together contain therefore at most n controlled-Z gates. We also consider normal forms for stabilizer states and graph states. Finally we carry out a few tests on classical and quantum computers in order to show experimentally the utility of these normal forms to reduce the gate count of a stabilizer circuit.

arXiv:2012.09224•Dec 16, 2020•0 citations
The nnn-qubit stabilizer states are those left invariant by a 2n{2}^{n}2n-element subset of the Pauli group. The Clifford group is the group of unitaries which take stabilizer states to stabilizer states; a physically motivated generating set, the Hadamard, phase, and controlled-not (cnot) gates which comprise the Clifford gates, impose a graph structure on the set of stabilizers. We explicitly construct these structures, the ``reachability graphs,'' at n\ensuremath≤5n\ensuremath{\le}5n\ensuremath≤5. When we consider only a subset of the Clifford gates, the reachability graphs separate into multiple, often complicated, connected components. Seeking an understanding of the entropic structure of the stabilizer states, which is ultimately built up by cnot gate applications on two qubits, we are motivated to consider the restricted subgraphs built from the Hadamard and cnot gates acting on only two of the nnn qubits. We show how the two subgraphs already present at two qubits are embedded into more complicated subgraphs at three and four qubits. We argue that no additional types of subgraph appear beyond four qubits, but that the entropic structures within the subgraphs can grow progressively more complicated as the qubit number increases. Starting at four qubits, some of the stabilizer states have entropy vectors which are not allowed by holographic entropy inequalities. We comment on the nature of the transition between holographic and nonholographic states within the stabilizer reachability graphs.
Following on our previous work arXiv:2204.07593 and arXiv:2306.01043 studying the orbits of quantum states under Clifford circuits via `reachability graphs', we introduce `contracted graphs' whose vertices represent classes of quantum states with the same entropy vector. These contracted graphs represent the double cosets of the Clifford group, where the left cosets are built from the stabilizer subgroup of the starting state and the right cosets are built from the entropy-preserving operators. We study contracted graphs for stabilizer states, as well as W states and Dicke states, discussing how the diameter of a state's contracted graph constrains the `entropic diversity' of its 222-qubit Clifford orbit. We derive an upper bound on the number of entropy vectors that can be generated using any nnn-qubit Clifford circuit, for any quantum state. We speculate on the holographic implications for the relative proximity of gravitational duals of states within the same Clifford orbit. Although we concentrate on how entropy evolves under the Clifford group, our double-coset formalism, and thus the contracted graph picture, is extendable to generic gate sets and generic state properties.
The Clifford group is the set of gates generated by the controlled not gates, the Hadamard gate and the P={{1,0},{0,i}} gate. We will say that a n-qubit state is a Clifford state if it can be prepared using Clifford gates. In this paper we study the set of all 4-qubit Clifford states. We prove that there are 293760 states and their entanglement entropy must be either 0, 2/3, 1, 4/3 and 5/3. We also show that any pair of these states can be connected using local gates and at most 3 CNOT gates. We achieve this by splitting the 293760 states into 18 groups where each pair of states in a group can be connected with a local Clifford gate. We then study how the different CNOT gates act on the 18 groups. We also study the Clifford states with real entries under the action of the subgroup C_R of Clifford gates with real entries. This time we show that every pair of Clifford states with real entries can be connected with at most 5 CNOT gates and local gates in C_R. The link https://youtu.be/42MI6ks2_eU leads to a YouTube video that explains the most important results in this paper.
The Clifford group is the set of gates generated by controlled not (CNOT) gates and the two local gates [Formula: see text] and [Formula: see text]. We will say that an [Formula: see text]-qubit state is a Clifford state if it can be prepared using Clifford gates, this is, [Formula: see text] is Clifford if [Formula: see text] where [Formula: see text] is a Clifford gate. In this paper, we study the set of all 4-qubit Clifford states. We prove that there are 293760 states, each of which has entanglement entropy equal to 0, [Formula: see text], 1, [Formula: see text], or [Formula: see text]. We also show that any pair of these states can be connected using local gates and at most 3 CNOT gates. We also study the Clifford states with real entries under the action of the subgroup [Formula: see text] of Clifford gates with real entries. This time we show that every pair of Clifford states with real entries can be connected with at most 5 CNOT gates and local gates in [Formula: see text]. To understand the action of the 12 different CNOT gates, we partition the Clifford states into orbits using the equivalence relation: two states are equivalent if they differ by a local Clifford gate. We label each orbit in such a way that it is easy to see the effect of the CNOT gates. Diagrams and tables explaining the action of the CNOT gates on all the orbits are presented in the paper. The link https://youtu.be/42MI6ks2_eU leads to a YouTube video that explains the most important results in this paper.
We describe the structure of the nnn-qubit Clifford group Cn\mathcal{C}_nCn​ via Cayley graphs, whose vertices represent group elements and edges represent generators. In order to obtain the action of Clifford gates on a given quantum state, we introduce a quotient procedure. Quotienting the Cayley graph by the stabilizer subgroup of a state gives a reduced graph which depicts the state's Clifford orbit. Using this protocol for C2\mathcal{C}_2C2​, we reproduce and generalize the reachability graphs introduced in \cite{Keeler2022}. Since the procedure is state-independent, we extend our study to non-stabilizer states, including the W and Dicke states. Our new construction provides a more precise understanding of state evolution under Clifford circuit action.
The Clifford group is the set of gates generated by controlled-Z gates, the phase gate and the Hadamard gate. We will say that a n-qubit state is a Clifford state if it can be prepared using Clifford gates. These states are known as the stabilizer states and they arise in quantum error correction. In this paper we study the set of all 5-qubit Clifford states. By using an exhaustive method we start by confirming that there are 19388160 states. The main goal of the paper is to understand the action of the controlled-Z gates action on the 5-qubit states. With this goal in mind, we partition the Clifford states into orbits using the equivalence relation: two states are equivalent if they differ by a local Clifford gate. We show that there are 93 orbits, and we label each orbit in such a way that it is easy to see the effect of the controlled-Z gates. Diagrams and tables explaining the action of the CZ gates on all the orbits are presented in the paper. A similar work is done for the real Clifford 5-qubits states, this is, for states that can be prepared with Controlled-Z gates, the Z gate and the Hadamard gate.
We start by studying the subgroup structures underlying stabilizer circuits. Then we apply our results to provide two normal forms for stabilizer circuits. These forms are computed by induction using simple conjugation rules in the Clifford group and our algorithms do not rely on a special decomposition in the symplectic group. The first normal form has shape CX-CZ-P-Z-X-H-CZ-P-H, where CX (resp. CZ) denotes a layer of CNOT (resp. controlled-Z) gates, P a layer of phase gates, X (resp. Z) a layer of Pauli-X (resp. Pauli-Z) gates. Then we replace most of the controlled-Z gates by CNOT gates to obtain a second normal form of type P-CX-CZ-CX-Z-X-H-CZ-CX-P-H. In this second form, both controlled-Z layers have depth 1 and together contain therefore at most n controlled-Z gates. We also consider normal forms for stabilizer states and graph states. Finally we carry out a few tests on classical and quantum computers in order to show experimentally the utility of these normal forms to reduce the gate count of a stabilizer circuit.