It is a fundamental property of quantum mechanics that information is lost as a result of performing measurements. Indeed, with every quantum measurement one can associate a number -- its POVM norm constant -- that quantifies how much the distinguishability of quantum states degrades in the worst case as a result of the measurement. This raises the obvious question which measurements preserve the most information in these sense of having the largest norm constant. While a number of near-optimal schemes have been found (e.g. the uniform POVM, or complex projective 4-designs), they all seem to be difficult to implement in practice. Here, we analyze the distinguishability of quantum states under measurements that are orbits of the Clifford group. The Clifford group plays an important role e.g. in quantum error correction, and its elements are considered simple to implement. We find that the POVM norm constants of Clifford orbits depend on the effective rank of the states that should be distinguished, as well as on a quantitative measure of the "degree of localization in phase space" of the vectors in the orbit. The most important Clifford orbit is formed by the set of stabilizer states. Our main result implies that stabilizer measurements are essentially optimal for distinguishing pure quantum states. As an auxiliary result, we use the methods developed here to prove new entropic uncertainty relations for stabilizer measurements. This paper is based on a very recent analysis of the representation theory of tensor powers of the Clifford group.
It is a fundamental property of quantum mechanics that information is lost as a result of performing measurements. Indeed, with every quantum measurement one can associate a number -- its POVM norm constant -- that quantifies how much the distinguishability of quantum states degrades in the worst case as a result of the measurement. This raises the obvious question which measurements preserve the most information in these sense of having the largest norm constant. While a number of near-optimal schemes have been found (e.g. the uniform POVM, or complex projective 4-designs), they all seem to be difficult to implement in practice. Here, we analyze the distinguishability of quantum states under measurements that are orbits of the Clifford group. The Clifford group plays an important role e.g. in quantum error correction, and its elements are considered simple to implement. We find that the POVM norm constants of Clifford orbits depend on the effective rank of the states that should be distinguished, as well as on a quantitative measure of the "degree of localization in phase space" of the vectors in the orbit. The most important Clifford orbit is formed by the set of stabilizer states. Our main result implies that stabilizer measurements are essentially optimal for distinguishing pure quantum states. As an auxiliary result, we use the methods developed here to prove new entropic uncertainty relations for stabilizer measurements. This paper is based on a very recent analysis of the representation theory of tensor powers of the Clifford group.
The Clifford group plays a central role in quantum information science. It is the building block for many error-correcting schemes and matches the first three moments of the Haar measure over the unitary group-a property that is essential for a broad range of quantum algorithms, with applications in pseudorandomness, learning theory, benchmarking, and entanglement distillation. At the heart of understanding many properties of the Clifford group lies the Clifford commutant: the set of operators that commute with k -fold tensor powers of Clifford unitaries. Previous understanding of this commutant has been limited to relatively small values of k , constrained by the number of qubits n . In this work, we develop a complete theory of the Clifford commutant. Our first result provides an explicit orthogonal basis for the commutant and computes its dimension for arbitrary n and k . We also introduce an alternative and easy-to-manipulate basis formed by isotropic sums of Pauli operators. We show that this basis is generated by products of permutations, which generate the unitary group commutant, and at most three other operators. Additionally, we develop a graphical calculus allowing a diagrammatic manipulation of elements of this basis. These results enable a wealth of applications: among others, we characterize all measurable magic measures and identify optimal strategies for stabilizer property testing, whose success probability also offers an operational interpretation to stabilizer entropies. Finally, we show that these results also generalize to multi-qudit systems with prime local dimension.
We study the distinguishability associated to either a single POVM or a family of POVMs. These norms quantify how quantum measurements perform in the task of discriminating two quantum states. We address the following questions regarding their behaviour in the high-dimensional regime:
(i) How many POVMs are needed to approximate the family of all POVMs on C^d? We show that the answer is exp(O(d^2)).
(ii) How many outcomes are required for a POVM to emulate the uniform POVM on C^d? Improving on previous results, we show that O(d^2) outcomes are necessary and sufficient. Moreover, using the concept of zonoid and approximation results from Banach space theory, we show that this property extends (in a weaker form) to an arbitrary POVM.
(iii) On a bipartite space, what are the relative strengths of standard classes of locally restricted measurements? We show that the class of PPT measurements typically performs almost as well as the class of all measurements whereas restricting to separable measurements implies a substantial loss.
Abstract. We characterize the extremal points of the convex set of quantum measurements that are covariant under a finite-dimensional projective representation of a compact group, with action of the group on the measurement probability space which is generally non-transitive. In this case the POVM density is made of multiple orbits of positive operators, and, in the case of extremal measurements, we provide a bound for the number of orbits and for the rank of POVM elements. Two relevant applications are considered, concerning state discrimination with mutually unbiased bases and the maximization of the mutual information. 1. introduction A fundamental issue in the theory of quantum information [1] is the investigation of the ultimate precision limits for extracting classical information from a quantum system. Indeed, when the information is encoded on quantum states, its read-out suffers the intrinsically quantum limitation of discriminating among nonorthogonal states. One then need to optimize the discrimination with respect to a given optimality
We consider the problem of testing whether an unknown n-qubit quantum state ∣ψ⟩ is a stabilizer state, with only single-copy access. We give an algorithm solving this problem using O(n) copies, and conversely prove that Ω(n) copies are required for any algorithm. The main observation behind our algorithm is that when repeatedly measuring in a randomly chosen stabilizer basis, stabilizer states are the most likely among the set of all pure states to exhibit linear dependencies in measurement outcomes. Our algorithm is designed to probe deviations from this extremal behavior. For the lower bound, we first reduce stabilizer testing to the task of distinguishing random stabilizer states from the maximally mixed state. We then argue that, without loss of generality, it is sufficient to consider measurement strategies that a) lie in the commutant of the tensor action of the Clifford group and b) satisfy a Positive Partial Transpose (PPT) condition. By leveraging these constraints, together with novel results on the partial transposes of the generators of the Clifford commutant, we derive the lower bound on the sample complexity.
We consider the problem of testing whether an unknown n-qubit quantum state is a stabilizer state, with only single-copy access. We give an algorithm solving this problem using O(n) copies, and conversely prove that Ω(√n) copies are required for any algorithm. The main observation behind our algorithm is that when repeatedly measuring in a randomly chosen stabilizer basis, stabilizer states are the most likely among the set of all pure states to exhibit linear dependencies in measurement outcomes. Our algorithm is designed to probe deviations from this extremal behavior. For the lower bound, we first reduce stabilizer testing to the task of distinguishing random stabilizer states from the maximally mixed state. We then argue that, without loss of generality, it is sufficient to consider measurement strategies that a) lie in the commutant of the tensor action of the Clifford group and b) satisfy a Positive Partial Transpose (PPT) condition. By leveraging these constraints, together with novel results on the partial transposes of the generators of the Clifford commutant, we derive the lower bound on the sample complexity.
We prove that every pure state of stabilizer rank at most k has stabilizer extent at most 2O(klog(k+1)), and establish the analogous bound for the squared Clifford coefficient norm of Clifford-rank-k operators. This implies stabilizer fidelity at least 2−O(klog(k+1)), resolving the quantitative conjecture of (Mehraban-Tamasbi, STOC, 2025), and proves an Ω(n2/logn) lower bound for the approximate stabilizer rank of tensor powers of any non-stabilizer qubit state. The latter result generalizes the best-known lower bound for tensor powers of T-states (Mehraban-Tamasbi, STOC, 2024) to arbitrary non-stabilizer qubit states, including magic states.
As a consequence of the Clifford rank--norm inequality, we obtain an Ω(n2/logn) lower bound for exact representations of n-bit AND function by quadratic phases, improving the previous best-known linear bound. Further consequences rule out pseudorandom state and unitary ensembles with approximate stabilizer and Clifford rank O((logn)2/loglogn), respectively, a logn improvement over prior work (Kalra-Sinha, Quantum, 2026). We also obtain tomography algorithms for states of stabilizer rank at most k, with poly(n)2O(klog(k+1)) time and copy complexity, a nearly square-root improvement in the exponent over the best-known algorithm.