Jena–Genin–Mosca conjecture on Clifford Pauli partitioning
Statement
Let be prime, let be a set of generalized Pauli operators, and let denote the generalized Clifford group. A partition is a collection of parts whose operators are simultaneously diagonalizable by elements of the specified gate set. Jena–Genin–Mosca conjecture. For almost all sets , the number of parts in a minimal partition of with respect to is bounded above by
This conjecture extends the preceding estimate from linearly independent sets to almost all sets, with linear dependence expected to produce larger co-cliques and hence require no more colors. The source gives no resolution, so the conjecture remains open.
Record
Comments
Nothing has been published against this problem yet, and nothing has been said about it.
Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.
Sign inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.