Jena–Genin–Mosca conjecture on single-qudit Clifford partitioning

From papers

Let qq be prime, let S\pauliq[]\mathcal{S}\subseteq \pauli{q}[*] be a set of generalized Pauli operators, let sqCsq\mathcal{C} denote the gate set of single-qudit Clifford operators, and let mm be the length of the largest Pauli operator in S\mathcal{S}. A partition is a collection of parts whose operators are simultaneously diagonalizable by elements of the specified gate set. Jena–Genin–Mosca conjecture. Given S\pauliq[]\mathcal{S}\subseteq \pauli{q}[*], the number of parts in a minimal partition of S\mathcal{S} with respect to sqCsq\mathcal{C} is expected to be bounded below by

(12+o(1))m(log2(q)o(1))Slog2(S).\left( \frac{1}{2} + o(1) \right) m(\log_2(q) - o(1)) \frac{|\mathcal{S}|}{\log_2(|\mathcal{S}|)}.

The bound expresses the expected cost of restricting measurements to single-qudit Clifford operations, compared with arbitrary Clifford operations. The source gives no resolution, so the conjecture remains open.

Progress summary

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Sources & referencesView supporting material

Primary source

Andrew Jena, Scott Genin and Michele Mosca, “Pauli Partitioning with Respect to Gate Sets”, arXiv:1907.07859 (2019).

Solutions 0

No solutions have been posted yet.