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:2107.02479 · Annali di Matematica Pura ed Applicata (1923 -)

Graph states and the variety of principal minors

Vincenzo Galgano, Frédéric Holweck

Published Jul 28, 2023• 1 citation
arXivHTMLPDF

Abstract

Abstract In Quantum Information theory, graph states are quantum states defined by graphs. In this work we exhibit a correspondence between orbits of graph states and orbits in the variety of binary symmetric principal minors, under the action of SL $$(2,{\mathbb {F}}_2)^{\times n}\rtimes {\mathfrak {S}}_n$$ ( 2 , F 2 ) × n ⋊ S n . First we study the orbits of maximal abelian subgroups of the n-fold Pauli group under the action of $${\mathcal {C}}_n^{\textrm{loc}}\rtimes {\mathfrak {S}}_n$$ C n loc ⋊ S n , where $${\mathcal {C}}_n^{\textrm{loc}}$$ C n loc is the n-fold local Clifford group, and we show that this action corresponds to the natural action of SL $$(2,{\mathbb {F}}_2)^{\times n}\rtimes {\mathfrak {S}}_n$$ ( 2 , F 2 ) × n ⋊ S n on the variety $${\mathcal {Z}}_n\subset {\mathbb {P}}({\mathbb {F}}_2^{2^n})$$ Z n ⊂ P ( F 2 2 n ) of principal minors of binary symmetric $$n\times n$$ n × n matrices: the crucial step is in translating the action of SL $$(2,{\mathbb {F}}_2)^{\times n}$$ ( 2 , F 2 ) × n into an action of the local symplectic group Sp $$_{2n}^{\textrm{loc}}({\mathbb {F}}_2)$$ 2 n loc ( F 2 ) . We conclude by showing how the former action restricts onto stabilizer groups, stabilizer states and graph states.

DOI
10.1007/s10231-023-01361-8

Related papers

Algorithmic approaches to graph states under the action of local Clifford groups

Moshen Bahramgiri

Graph states are quantum states (quantum codes) in qn-dimensional space ... (q being a power of some prime number) which can be described by graphs with edges labeled from the field of order q, Fq. Graph states are determined as a common eigenvector of independent elements of the n-fold Pauli group, on which the local Clifford group has a natural action. This action induces the natural action of the local Clifford group on graph states and hence, its action on graphs. Locally equivalent graphs can be described using this action. For q being a prime number, two graphs are locally equivalent when they are located on the same orbit of this action, in other words, when there is an element of the local Clifford group mapping one graph to the other one. When q is some power of a prime number, the definition of this action is the natural generalization of this action in the case where q is prime. We translate the action of local Clifford groups on graphs to a set of linear and quadratic equations in the field F,. In the case that q is an odd number, given two arbitrary graphs, we present an efficient algorithm (polynomial in n) to verify whether these graphs are locally equivalent or not. Moreover, we present a computational method to calculate the number of inequivalent graph states. We give some estimations on the size of the orbits of this action on graphs, and prove that when either q is equal to 2 or is an odd number, the number of inequivalent quantum codes (i.e., the number of classes of equivalency) is equal to ..., which is essentially as large as the total number of graphs.

•Jan 1, 2007•0 citations

Graph States Under the Action of Local Clifford Group in Non-Binary Case

Mohsen Bahramgiri, Salman Beigi

Graph states are well-entangled quantum states that are defined based on a graph. Of course, if two graphs are isomorphic their associated states are the same. Also, we know local operations do not change the entanglement of quantum states. Therefore, graph states that are either isomorphic or equivalent under the local Clifford group have the same properties. In this paper, we first establish a bound on the number of graph states which are neither isomorphic nor equivalent under the action of local Clifford group. Also, we study graph states in non-binary case. We translate the action of local Clifford group, as well as measurement of Pauli operators, into transformations on their associated graphs. Finally, we present an efficient algorithm to verify whether two graph states, in non-binary case, are locally equivalent or not.

arXiv:quant-ph/0610267•Oct 31, 2006•74 citations

Graphical description of the action of local Clifford transformations on graph states

Maarten Van den Nest, Jeroen Dehaene, Bart De Moor

We translate the action of local Clifford operations on graph states into transformations on their associated graphs, i.e., we provide transformation rules, stated in purely graph theoretical terms, which completely characterize the evolution of graph states under local Clifford operations. As we will show, there is essentially one basic rule, successive application of which generates the orbit of any graph state under local unitary operations within the Clifford group.

arXiv:quant-ph/0308151•Physical Review A•Feb 24, 2004•401 citations

Clifford orbits and stabilizer states

Lingxuan Feng, Shunlong Luo

Abstract Stabilizer states serve as ‘classical objects’ in the stabilizer formalism of quantum theory, and play an important role in quantum error correction, fault-tolerant quantum computation, and quantum communication. They provide an efficient description of many basic features of quantum theory and exhibit a rich structure. For prime dimensional systems, they may be defined by two quite different yet equivalent ways: The first is via stabilizer groups (maximal Abelian subgroups of the discrete Heisenberg–Weyl group). The second is via the orbits of the Clifford group acting on any computational basis state. However, in a general dimensional system, this equivalence breaks down, and consequently, it is desirable to clarify the difference and relation between the above two approaches to stabilizer states. In this work, we show that these two approaches are equivalent if and only if the system dimension is square-free (i.e. has no square factor). Furthermore, we completely reveal the relation between the Clifford orbits and stabilizer states in an arbitrary dimensional system, derive the explicit expressions of the Clifford orbits and determine their cardinalities.

Journal of Physics A Mathematical and Theoretical•Sep 3, 2024•6 citations

From Pauli Strings to Quantum Dynamics: A Unified Characterization

Roberto Gargiulo, Paul Herringer, Robert Zeier

Understanding the dynamical properties of quantum systems is an essential task in quantum computing, quantum control, and many-body physics. Tools such as representation theory and Lie theory provide crucial information on reachability and computational power. However, this information can be difficult to access exactly or compute efficiently for arbitrary generating sets. Here we focus on the setting of Pauli strings, which satisfy numerous exceptional properties that simplify the problem. We find deep connections between Pauli Lie algebras and certain subgroups of the Clifford group generated by transvections, through the symplectic properties of the Pauli strings. This allows us to give an invariant-based perspective on these objects and their reachability, in the language of Pauli orbits, symmetries, and invariant subspaces. The invariant-based approach provides efficient algorithms for identifying Lie algebras and orbits, as well as a simple framework for analyzing structured Pauli generating sets. We also show in an elementary way that Clifford subgroups generated by transvections provide 3-designs for the corresponding Pauli Lie groups. We illustrate the framework through structured examples from variational quantum algorithms, restricted quantum computation, many-body systems, and random circuits.

quant-pharXiv:2606.09773•Jun 9, 2026•7 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•11 citations
Abstract In Quantum Information theory, graph states are quantum states defined by graphs. In this work we exhibit a correspondence between orbits of graph states and orbits in the variety of binary symmetric principal minors, under the action of SL (2,F2)×n⋊Sn(2,{\mathbb {F}}_2)^{\times n}\rtimes {\mathfrak {S}}_n(2,F2​)×n⋊Sn​ ( 2 , F 2 ) × n ⋊ S n . First we study the orbits of maximal abelian subgroups of the n-fold Pauli group under the action of Cnloc⋊Sn{\mathcal {C}}_n^{\textrm{loc}}\rtimes {\mathfrak {S}}_nCnloc​⋊Sn​ C n loc ⋊ S n , where Cnloc{\mathcal {C}}_n^{\textrm{loc}}Cnloc​ C n loc is the n-fold local Clifford group, and we show that this action corresponds to the natural action of SL (2,F2)×n⋊Sn(2,{\mathbb {F}}_2)^{\times n}\rtimes {\mathfrak {S}}_n(2,F2​)×n⋊Sn​ ( 2 , F 2 ) × n ⋊ S n on the variety Zn⊂P(F22n){\mathcal {Z}}_n\subset {\mathbb {P}}({\mathbb {F}}_2^{2^n})Zn​⊂P(F22n​) Z n ⊂ P ( F 2 2 n ) of principal minors of binary symmetric n×nn\times nn×n n × n matrices: the crucial step is in translating the action of SL (2,F2)×n(2,{\mathbb {F}}_2)^{\times n}(2,F2​)×n ( 2 , F 2 ) × n into an action of the local symplectic group Sp 2nloc(F2)_{2n}^{\textrm{loc}}({\mathbb {F}}_2)2nloc​(F2​) 2 n loc ( F 2 ) . We conclude by showing how the former action restricts onto stabilizer groups, stabilizer states and graph states.
Graph states are quantum states (quantum codes) in qn-dimensional space ... (q being a power of some prime number) which can be described by graphs with edges labeled from the field of order q, Fq. Graph states are determined as a common eigenvector of independent elements of the n-fold Pauli group, on which the local Clifford group has a natural action. This action induces the natural action of the local Clifford group on graph states and hence, its action on graphs. Locally equivalent graphs can be described using this action. For q being a prime number, two graphs are locally equivalent when they are located on the same orbit of this action, in other words, when there is an element of the local Clifford group mapping one graph to the other one. When q is some power of a prime number, the definition of this action is the natural generalization of this action in the case where q is prime. We translate the action of local Clifford groups on graphs to a set of linear and quadratic equations in the field F,. In the case that q is an odd number, given two arbitrary graphs, we present an efficient algorithm (polynomial in n) to verify whether these graphs are locally equivalent or not. Moreover, we present a computational method to calculate the number of inequivalent graph states. We give some estimations on the size of the orbits of this action on graphs, and prove that when either q is equal to 2 or is an odd number, the number of inequivalent quantum codes (i.e., the number of classes of equivalency) is equal to ..., which is essentially as large as the total number of graphs.
Graph states are well-entangled quantum states that are defined based on a graph. Of course, if two graphs are isomorphic their associated states are the same. Also, we know local operations do not change the entanglement of quantum states. Therefore, graph states that are either isomorphic or equivalent under the local Clifford group have the same properties. In this paper, we first establish a bound on the number of graph states which are neither isomorphic nor equivalent under the action of local Clifford group. Also, we study graph states in non-binary case. We translate the action of local Clifford group, as well as measurement of Pauli operators, into transformations on their associated graphs. Finally, we present an efficient algorithm to verify whether two graph states, in non-binary case, are locally equivalent or not.
Abstract Stabilizer states serve as ‘classical objects’ in the stabilizer formalism of quantum theory, and play an important role in quantum error correction, fault-tolerant quantum computation, and quantum communication. They provide an efficient description of many basic features of quantum theory and exhibit a rich structure. For prime dimensional systems, they may be defined by two quite different yet equivalent ways: The first is via stabilizer groups (maximal Abelian subgroups of the discrete Heisenberg–Weyl group). The second is via the orbits of the Clifford group acting on any computational basis state. However, in a general dimensional system, this equivalence breaks down, and consequently, it is desirable to clarify the difference and relation between the above two approaches to stabilizer states. In this work, we show that these two approaches are equivalent if and only if the system dimension is square-free (i.e. has no square factor). Furthermore, we completely reveal the relation between the Clifford orbits and stabilizer states in an arbitrary dimensional system, derive the explicit expressions of the Clifford orbits and determine their cardinalities.
Understanding the dynamical properties of quantum systems is an essential task in quantum computing, quantum control, and many-body physics. Tools such as representation theory and Lie theory provide crucial information on reachability and computational power. However, this information can be difficult to access exactly or compute efficiently for arbitrary generating sets. Here we focus on the setting of Pauli strings, which satisfy numerous exceptional properties that simplify the problem. We find deep connections between Pauli Lie algebras and certain subgroups of the Clifford group generated by transvections, through the symplectic properties of the Pauli strings. This allows us to give an invariant-based perspective on these objects and their reachability, in the language of Pauli orbits, symmetries, and invariant subspaces. The invariant-based approach provides efficient algorithms for identifying Lie algebras and orbits, as well as a simple framework for analyzing structured Pauli generating sets. We also show in an elementary way that Clifford subgroups generated by transvections provide 3-designs for the corresponding Pauli Lie groups. We illustrate the framework through structured examples from variational quantum algorithms, restricted quantum computation, many-body systems, and random circuits.
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.