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/0701211

On the Pauli graphs of N-qudits

Michel R. P. Planat, Метод Санига

Published Jan 29, 2007• 29 citations
arXivHTMLPDF

Abstract

A comprehensive graph theoretical and finite geometrical study of the commutation relations between the generalized Pauli operators of N-qudits is performed in which vertices/points correspond to the operators and edges/lines join commuting pairs of them. As per two-qubits, all basic properties and partitionings of the corresponding Pauli graph are embodied in the geometry of the generalized quadrangle of order two. Here, one identifies the operators with the points of the quadrangle and groups of maximally commuting subsets of the operators with the lines of the quadrangle. The three basic partitionings are (a) a pencil of lines and a cube, (b) a Mermin's array and a bipartite-part and (c) a maximum independent set and the Petersen graph. These factorizations stem naturally from the existence of three distinct geometric hyperplanes of the quadrangle, namely a set of points collinear with a given point, a grid and an ovoid, which answer to three distinguished subsets of the Pauli graph, namely a set of six operators commuting with a given one, a Mermin's square, and set of five mutually non-commuting operators, respectively. The generalized Pauli graph for multiple qubits is found to follow from symplectic polar spaces of order two, where maximal totally isotropic subspaces stand for maximal subsets of mutually commuting operators. The substructure of the (strongly regular) N-qubit Pauli graph is shown to be pseudo-geometric, i. e., isomorphic to a graph of a partial geometry. Finally, the (not strongly regular) Pauli graph of a two-qutrit system is introduced; here it turns out more convenient to deal with its dual in order to see all the parallels with the two-qubit case and its surmised relation with the generalized quadrangle Q(4, 3), the dual ofW(3).

DOI
10.48550/arxiv.quant-ph/0701211

Related papers

On the Pauli graphs on N-qudits

Michel R. P. Planat, Метод Санига

A comprehensive graph theoretical and finite geometrical study of the commutation relations between the generalized Pauli operators of $N$-qudits is performed in which vertices/points correspond to the operators and edges/lines join commuting pairs of them. As per two-qubits, all basic properties and partitionings of the corresponding {\it Pauli graph} are embodied in the geometry of the generalized quadrangle of order two. Here, one identifies the operators with the points of the quadrangle and groups of maximally commuting subsets of the operators with the lines of the quadrangle. The three basic partitionings are (a) a pencil of lines and a cube, (b) a Mermin's array and a bipartite-part and (c) a maximum independent set and the Petersen graph. These factorizations stem naturally from the existence of three distinct geometric hyperplanes of the quadrangle, namely a set of points collinear with a given point, a grid and an ovoid, which answer to three distinguished subsets of the Pauli graph, namely a set of six operators commuting with a given one, a Mermin's square, and set of five mutually non-commuting operators, respectively. The generalized Pauli graph for multiple qubits is found to follow from symplectic polar spaces of order two, where maximal totally isotropic subspaces stand for maximal subsets of mutually commuting operators. The substructure of the (strongly regular) $N$-qubit Pauli graph is shown to be pseudo-geometric, i.\,e., isomorphic to a graph of a partial geometry. Finally, the (not strongly regular) Pauli graph of a two-qutrit system is introduced; here it turns out more convenient to deal with its dual in order to see all the parallels with the two-qubit case and its surmised relation with the generalized quadrangle $Q(4,3)$, the dual of $W(3)$.

Quantum Information and Computation•Jan 1, 2008•66 citations

Pauli graph and finite projective lines/geometries

Michel R. P. Planat, Метод Санига

The commutation relations between the generalized Pauli operators of N-qudits (i. e., N p-level quantum systems), and the structure of their maximal sets of commuting bases, follow a nice graph theoretical/geometrical pattern. One may identify vertices/points with the operators so that edges/lines join commuting pairs of them to form the so-called Pauli graph PpN . As per two-qubits (p = 2, N = 2) all basic properties and partitionings of this graph are embodied in the geometry of the symplectic generalized quadrangle of order two, W(2). The structure of the two-qutrit (p = 3, N = 2) graph is more involved; here it turns out more convenient to deal with its dual in order to see all the parallels with the two-qubit case and its surmised relation with the geometry of generalized quadrangle Q(4, 3), the dual of W(3). Finally, the generalized adjacency graph for multiple (N > 3) qubits/qutrits is shown to follow from symplectic polar spaces of order two/three. The relevance of these mathematical concepts to mutually unbiased bases and to quantum entanglement is also highlighted in some detail.

arXiv:quant-ph/0703154•Proceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIE•May 4, 2007•7 citations

The N-qudit fabric: Pauli graph and finite geometries

Michel R. P. Planat

The commutation relations between the generalized Pauli operators of N-qudits (i. e., N p-level quantum systems), and the structure of their bases/maximal sets of commuting operators, follow a nice graph theoretical/geometrical pattern. One may identify vertices of a graph with the operators so that edges join commuting pairs of them to form the so-called Pauli graph PpN . One may identify points of a geometry with the operators so that lines correspond to the maximal commuting sets of them. As per two-qubits (p = 2, N = 2) all basic properties and partitionings of this graph are embodied in the geometry of the symplectic generalized quadrangle of order two, W(2). The structure of the two-qutrit (p = 3, N = 2) graph is more involved; here it turns out more convenient to deal with its dual to see the relation with the geometry of generalized quadrangle Q(4, 3), the dual of W(3). Finally, the generalized adjacency graph for multiple (N > 3) qubits/qutrits is shown to follow from symplectic polar spaces of order two/three. These mathematical concepts relate to mutually unbiased bases and to quantum entanglement. Michel Planat† and Metod Saniga‡ The N-qudit fabric: Pauli graph and finite geometries

•Mar 30, 2007•0 citations

Geometry of Finite-Dimensional Hilbert Spaces

Michel R. P. Planat

The commutation relations between the generalized Pauli operators, and their maximal sets of commuting operators, follow an identifiable graph theoretical/geometrical pattern. Two-qubit observables have the geometry of the symplectic generalized quadrangle of order two W(2), and higher order $N$-qudit observables (N a power of a prime number) are related to polar spaces of the corresponding order. A new recognized feature is the multi-line property of the geometry of observables, starting with the smallest composite dimension six. An overview of recent progress will be given.

•Jan 1, 2007•0 citations

Multiple Qubits as Symplectic Polar Spaces of Order Two

Метод Санига, Michel R. P. Planat

It is surmised that the algebra of the Pauli operators on the Hilbert space of N-qubits is embodied in the geometry of the symplectic polar space of rank N and order two, W_{2N - 1}(2). The operators (discarding the identity) answer to the points of W_{2N - 1}(2), their partitionings into maximally commuting subsets correspond to spreads of the space, a maximally commuting subset has its representative in a maximal totally isotropic subspace of W_{2N - 1}(2) and, finally, "commuting" translates into "collinear" (or "perpendicular").

arXiv:quant-ph/0612179•Dec 21, 2006•53 citations

A sequence of qubit–qudit Pauli groups as a nested structure of doilies

Метод Санига, Michel R. P. Planat

Following the spirit of a recent work of one of the authors (2011 J. Phys. A: Math. Theor. 44 045301), the essential structure of the generalized Pauli group of a qubit–qudit, where d = 2 k and an integer k ⩾ 2, is recast in the language of a finite geometry. A point of such geometry is represented by the maximum set of mutually commuting elements of the group and two distinct points are regarded as collinear if the corresponding sets have exactly 2 k − 1 elements in common. The geometry comprises 2 k − 1 copies of the generalized quadrangle of order 2 ('the doily') that form 2 k − 1 − 1 pencils arranged into a remarkable nested configuration. This nested structure reflects the fact that maximum sets of mutually commuting elements are of two different kinds (ordinary and exceptional) and exhibits an intriguing alternating pattern: the subgeometry of the exceptional points of the ( k + 2) case is found to be isomorphic to the full geometry of the k -case. It should be stressed, however, that these generic properties of the qubit–qudit geometry were inferred from purely computer-handled cases of k = 2, 3, 4 and 5 only and, therefore, their rigorous, computer-free proof for k ⩾ 6 still remains a mathematical challenge.

arXiv:1102.3281•Journal of Physics A Mathematical and Theoretical•May 4, 2011•6 citations
A comprehensive graph theoretical and finite geometrical study of the commutation relations between the generalized Pauli operators of N-qudits is performed in which vertices/points correspond to the operators and edges/lines join commuting pairs of them. As per two-qubits, all basic properties and partitionings of the corresponding Pauli graph are embodied in the geometry of the generalized quadrangle of order two. Here, one identifies the operators with the points of the quadrangle and groups of maximally commuting subsets of the operators with the lines of the quadrangle. The three basic partitionings are (a) a pencil of lines and a cube, (b) a Mermin's array and a bipartite-part and (c) a maximum independent set and the Petersen graph. These factorizations stem naturally from the existence of three distinct geometric hyperplanes of the quadrangle, namely a set of points collinear with a given point, a grid and an ovoid, which answer to three distinguished subsets of the Pauli graph, namely a set of six operators commuting with a given one, a Mermin's square, and set of five mutually non-commuting operators, respectively. The generalized Pauli graph for multiple qubits is found to follow from symplectic polar spaces of order two, where maximal totally isotropic subspaces stand for maximal subsets of mutually commuting operators. The substructure of the (strongly regular) N-qubit Pauli graph is shown to be pseudo-geometric, i. e., isomorphic to a graph of a partial geometry. Finally, the (not strongly regular) Pauli graph of a two-qutrit system is introduced; here it turns out more convenient to deal with its dual in order to see all the parallels with the two-qubit case and its surmised relation with the generalized quadrangle Q(4, 3), the dual ofW(3).
A comprehensive graph theoretical and finite geometrical study of the commutation relations between the generalized Pauli operators of NNN-qudits is performed in which vertices/points correspond to the operators and edges/lines join commuting pairs of them. As per two-qubits, all basic properties and partitionings of the corresponding {\it Pauli graph} are embodied in the geometry of the generalized quadrangle of order two. Here, one identifies the operators with the points of the quadrangle and groups of maximally commuting subsets of the operators with the lines of the quadrangle. The three basic partitionings are (a) a pencil of lines and a cube, (b) a Mermin's array and a bipartite-part and (c) a maximum independent set and the Petersen graph. These factorizations stem naturally from the existence of three distinct geometric hyperplanes of the quadrangle, namely a set of points collinear with a given point, a grid and an ovoid, which answer to three distinguished subsets of the Pauli graph, namely a set of six operators commuting with a given one, a Mermin's square, and set of five mutually non-commuting operators, respectively. The generalized Pauli graph for multiple qubits is found to follow from symplectic polar spaces of order two, where maximal totally isotropic subspaces stand for maximal subsets of mutually commuting operators. The substructure of the (strongly regular) NNN-qubit Pauli graph is shown to be pseudo-geometric, i.\,e., isomorphic to a graph of a partial geometry. Finally, the (not strongly regular) Pauli graph of a two-qutrit system is introduced; here it turns out more convenient to deal with its dual in order to see all the parallels with the two-qubit case and its surmised relation with the generalized quadrangle Q(4,3)Q(4,3)Q(4,3), the dual of W(3)W(3)W(3).
The commutation relations between the generalized Pauli operators of N-qudits (i. e., N p-level quantum systems), and the structure of their maximal sets of commuting bases, follow a nice graph theoretical/geometrical pattern. One may identify vertices/points with the operators so that edges/lines join commuting pairs of them to form the so-called Pauli graph PpN . As per two-qubits (p = 2, N = 2) all basic properties and partitionings of this graph are embodied in the geometry of the symplectic generalized quadrangle of order two, W(2). The structure of the two-qutrit (p = 3, N = 2) graph is more involved; here it turns out more convenient to deal with its dual in order to see all the parallels with the two-qubit case and its surmised relation with the geometry of generalized quadrangle Q(4, 3), the dual of W(3). Finally, the generalized adjacency graph for multiple (N > 3) qubits/qutrits is shown to follow from symplectic polar spaces of order two/three. The relevance of these mathematical concepts to mutually unbiased bases and to quantum entanglement is also highlighted in some detail.
The commutation relations between the generalized Pauli operators of N-qudits (i. e., N p-level quantum systems), and the structure of their bases/maximal sets of commuting operators, follow a nice graph theoretical/geometrical pattern. One may identify vertices of a graph with the operators so that edges join commuting pairs of them to form the so-called Pauli graph PpN . One may identify points of a geometry with the operators so that lines correspond to the maximal commuting sets of them. As per two-qubits (p = 2, N = 2) all basic properties and partitionings of this graph are embodied in the geometry of the symplectic generalized quadrangle of order two, W(2). The structure of the two-qutrit (p = 3, N = 2) graph is more involved; here it turns out more convenient to deal with its dual to see the relation with the geometry of generalized quadrangle Q(4, 3), the dual of W(3). Finally, the generalized adjacency graph for multiple (N > 3) qubits/qutrits is shown to follow from symplectic polar spaces of order two/three. These mathematical concepts relate to mutually unbiased bases and to quantum entanglement. Michel Planat† and Metod Saniga‡ The N-qudit fabric: Pauli graph and finite geometries
The commutation relations between the generalized Pauli operators, and their maximal sets of commuting operators, follow an identifiable graph theoretical/geometrical pattern. Two-qubit observables have the geometry of the symplectic generalized quadrangle of order two W(2), and higher order NNN-qudit observables (N a power of a prime number) are related to polar spaces of the corresponding order. A new recognized feature is the multi-line property of the geometry of observables, starting with the smallest composite dimension six. An overview of recent progress will be given.
It is surmised that the algebra of the Pauli operators on the Hilbert space of N-qubits is embodied in the geometry of the symplectic polar space of rank N and order two, W_{2N - 1}(2). The operators (discarding the identity) answer to the points of W_{2N - 1}(2), their partitionings into maximally commuting subsets correspond to spreads of the space, a maximally commuting subset has its representative in a maximal totally isotropic subspace of W_{2N - 1}(2) and, finally, "commuting" translates into "collinear" (or "perpendicular").
Following the spirit of a recent work of one of the authors (2011 J. Phys. A: Math. Theor. 44 045301), the essential structure of the generalized Pauli group of a qubit–qudit, where d = 2 k and an integer k ⩾ 2, is recast in the language of a finite geometry. A point of such geometry is represented by the maximum set of mutually commuting elements of the group and two distinct points are regarded as collinear if the corresponding sets have exactly 2 k − 1 elements in common. The geometry comprises 2 k − 1 copies of the generalized quadrangle of order 2 ('the doily') that form 2 k − 1 − 1 pencils arranged into a remarkable nested configuration. This nested structure reflects the fact that maximum sets of mutually commuting elements are of two different kinds (ordinary and exceptional) and exhibits an intriguing alternating pattern: the subgeometry of the exceptional points of the ( k + 2) case is found to be isomorphic to the full geometry of the k -case. It should be stressed, however, that these generic properties of the qubit–qudit geometry were inferred from purely computer-handled cases of k = 2, 3, 4 and 5 only and, therefore, their rigorous, computer-free proof for k ⩾ 6 still remains a mathematical challenge.