Jena–Genin–Mosca conjecture on single-qudit Clifford partitioning
Jena–Genin–Mosca conjecture on single-qudit Clifford partitioning
Let be prime, let be a set of generalized Pauli operators, let denote the gate set of single-qudit Clifford operators, and let be the length of the largest Pauli operator in . A partition is a collection of parts whose operators are simultaneously diagonalizable by elements of the specified gate set. Jena–Genin–Mosca conjecture. Given , the number of parts in a minimal partition of with respect to is expected to be bounded below by
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
Sign in to submit a solution.
No solutions have been posted yet.