84 citations · 970 across the 84 of their papers we have counts for
5 papers · 2 filters
Clifford quantum computer and the Mathieu groups
Michel 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…
Multi-Line Geometry of Qubit-Qutrit and Higher-Order Pauli Operators
Michel R. P. Planat, Anne-Céline Baboin, Metod Saniga
The commutation relations of the generalized Pauli operators of a qubit-qutrit system are discussed in the newly established graph-theoretic and finite-geometrical settings. The du…
The Veldkamp Space of Two-Qubits
Metod Saniga, Michel Planat, Petr Pracna +1
Given a remarkable representation of the generalized Pauli operators of two-qubits in terms of the points of the generalized quadrangle of order two, W(2), it is shown that specifi…
Pauli graph and finite projective lines/geometries
Michel R. P. Planat, Metod Saniga
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…
On the Pauli graphs of N-qudits
Michel Planat, Metod Saniga
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/point…