Accurately estimating expectation values of observables from a finite number of measurement shots is a central challenge in quantum information science. Informationally overcomplete measurements provide a route to reduce estimation variance through optimized classical post-processing. However, the interplay between measurement geometry and dual-frame construction remains largely unexplored. In this work, we study Platonic solid POVMs ---highly symmetric, overcomplete single-qubit measurements whose effects correspond to the vertices of the five Platonic solids on the Bloch sphere--- for the estimation of molecular Hamiltonians. Using $k$-locally optimal dual frames, we show that the geometry of the POVM can have a non-trivial and non-monotonic effect on the estimation variance. We further propose a joint optimization of the POVM orientation and effect weights using a classical proxy state, either a product state or a Matrix Product State (MPS) approximation. We demonstrate that optimized Platonic solid POVMs can outperform standard randomized Pauli measurements, provided the MPS bond dimension is sufficient to faithfully represent the target state. These results reveal a trade-off between classical preprocessing and estimation accuracy, suggesting a practical route to improved observable estimation on near-term quantum hardware.
Accurately estimating expectation values of observables from a finite number of measurement shots is a central challenge in quantum information science. Informationally overcomplete measurements provide a route to reduce estimation variance through optimized classical post-processing. However, the interplay between measurement geometry and dual-frame construction remains largely unexplored. In this work, we study Platonic solid POVMs ---highly symmetric, overcomplete single-qubit measurements whose effects correspond to the vertices of the five Platonic solids on the Bloch sphere--- for the estimation of molecular Hamiltonians. Using k-locally optimal dual frames, we show that the geometry of the POVM can have a non-trivial and non-monotonic effect on the estimation variance. We further propose a joint optimization of the POVM orientation and effect weights using a classical proxy state, either a product state or a Matrix Product State (MPS) approximation. We demonstrate that optimized Platonic solid POVMs can outperform standard randomized Pauli measurements, provided the MPS bond dimension is sufficient to faithfully represent the target state. These results reveal a trade-off between classical preprocessing and estimation accuracy, suggesting a practical route to improved observable estimation on near-term quantum hardware.
Accurate estimation of observables in quantum systems is a central challenge in quantum information science, yet practical implementations are fundamentally constrained by the limited number of measurement shots. In this work we explore a variation of the classical shadows protocol in which the measurements are kept local while allowing the resulting classical shadows themselves to be correlated. By constructing locally optimal shadows, we obtain unbiased estimators that are competitive with state-of-the-art methods in terms of measurement overhead, while requiring only single-qubit measurements and allowing for the estimation of any observable in pure post-processing, reducing estimation errors by orders of magnitude over standard classical shadows. We validate our approach through numerical experiments on molecular Hamiltonians with up to 40 qubits consistently observing significant reductions in estimation errors, including for estimations of multiple chemically relevant observables simultaneously.
In recent years, informationally complete measurements have attracted considerable attention, especially in the context of classical shadows. In the particular case of informationally overcomplete measurements, for which the number of possible outcomes exceeds the dimension of the space of linear operators in Hilbert space, the dual positive operator-valued measure operators used to interpret the measurement outcomes are not uniquely defined. In this paper, we propose a method to optimize the dual operators after the measurements have been carried out in order to produce sharper, unbiased estimations of observables of interest. We discuss how this procedure can produce zero-variance estimations in cases where the classical shadows formalism, which relies on so-called canonical duals, incurs exponentially large measurement overheads. We also analyze the algorithm in the context of quantum simulation with randomized Pauli measurements, and show that it can significantly reduce statistical errors with respect to canonical duals on multiple observable estimations.
Informationally overcomplete POVMs are known to outperform minimally complete measurements in many tomography and estimation tasks, and they also leave a purely classical freedom in shadow tomography: the same observable admits infinitely many unbiased linear reconstructions from identical measurement data. We formulate the choice of reconstruction coefficients as a convex minimax problem and give an algorithm with guaranteed convergence that returns the tightest state-independent variance bound achievable by post-processing for a fixed POVM and observable. Numerical examples show that the resulting estimators can dramatically reduce sampling complexity relative to standard (canonical) reconstructions, and can even improve the qualitative scaling with system size for structured noncommuting targets.
Accurately estimating expectation values of quantum observables with as few measurements as possible is crucial to many quantum computing applications. We introduce a framework that covers many of existing measurement strategies and introduce heuristics that can be used to enhance randomized schemes, including those based on Pauli grouping with inverse probability weighting and variants of the classical shadow algorithm. We show how to maximize information gain from such schemes, while carefully optimizing the distribution of possible measurements, and show that simple grouping algorithms can get close to, and in some cases exceed, state-of-the-art accuracy for unbiased estimation of expectation values on a standard quantum chemistry benchmark. We show how these randomized methods may be compared to more recent measurement schemes, such as shadow grouping, derandomized shadow, and overlapped grouping measurement, we show how the same strategies can be used to augment these schemes, and we demonstrate that we can reduce measurement costs by up to a factor of two by allowing Clifford measurement circuits for otherwise Clifford-less methods.
Randomized measurement protocols such as classical shadows represent powerful resources for quantum technologies, with applications ranging from quantum state characterization and process tomography to machine learning and error mitigation. Recently, the notion of measurement dual frames, in which classical shadows are generalized to dual operators of positive operator-valued measure (POVM) effects, resurfaced in the literature. This brought attention to additional degrees of freedom in the postprocessing stage of randomized measurements that are often neglected by established techniques. In this work, we leverage dual frames to construct improved observable estimators from informationally complete measurement samples. We introduce novel classes of parametrized frame superoperators and optimization-free dual frames based on empirical frequencies, which offer advantages over their canonical counterparts while retaining computational efficiency. Remarkably, this comes at almost no quantum or classical cost, thus rendering dual frame optimization a valuable addition to the randomized measurement toolbox. Published by the American Physical Society 2024
Estimating many local expectation values over time is a central measurement bottleneck in quantum simulation and device characterization. We study the task of reconstructing the Pauli-signal matrix Sij=Tr(Oiρ(tj)) for a collection of M low-weight Pauli observables {Oi}i=1M over N timesteps {tj}j=1N, while minimizing the total number of device shots. We propose a Compressed Sensing Shadow Tomography (CSST) protocol that combines two complementary reductions. First, local classical shadows reduce the observable dimension by enabling many Pauli expectation values to be estimated from the same randomized snapshots at a fixed time. Second, compressed sensing reduces the time dimension by exploiting the fact that many expectation-value traces are spectrally sparse or compressible in a unitary (e.g., Fourier) transform basis. Operationally, CSST samples m≪N timesteps uniformly at random, collects shadows only at those times, and then reconstructs each length-N signal via standard ℓ1-based recovery in the unitary transform domain. We provide end-to-end guarantees that explicitly combine shadow estimation error with compressed sensing recovery bounds. For exactly s-sparse signals in a unitary transform basis, we show that m=O(slog2slogN) random timesteps suffice (with high probability), leading to total-shot savings scaling as Θ(N/s) (i.e., up to polylogarithmic factors) relative to collecting shadows at all N timesteps. For approximately sparse signals, the reconstruction error decomposes into a compressibility (tail) term plus a noise term. We present numerical experiments on noisy many-qubit dynamics that support strong Fourier compressibility of Pauli traces and demonstrate substantial shot reductions with accurate reconstruction.