Robustness of quantum spectrum estimation: weak Schur sampling under noisy inputs
Abstract
We initiate the study of weak Schur sampling (WSS) under noisy inputs. Many optimal quantum learning algorithms rely on this measurement, for instance in quantum spectrum estimation (QSE) and quantum state tomography (QST). The standard analysis of WSS, QSE and QST assumes that the n input copies of the target state ρ are identical, i.e. ρ⊗ n. We study what happens when they are not, a more realistic noisy scenario that breaks the very permutation symmetry on which WSS is built. In the simplest model the input is a noisy product state: the copies are independent but not necessarily identical and each is ε-close in trace distance to the d-dimensional target state ρ. A naive argument via the data-processing inequality allows the per-copy errors to accumulate to nε on the measurement outcome. We show that for QSE via WSS this does not happen: the expected estimation error in total variation is at most ε+η(n,d), where η(n,d)=O(d/√n) is the noiseless error, and the additive noise term ε is optimal. The output error does not grow with n even though the input error does; in this sense WSS is robust. Beyond noisy product states, for arbitrary input ω we show that the error is at most η(n,d)+1/n|ω−ρ⊗ n|W1, where W1 is the quantum Wasserstein distance of De Palma et al. In particular, our results imply, for the first time, noise-robustness of Keyl and Werner's seminal algorithm for QSE, more than two decades after its introduction. Finally, we show that the noise cannot be too bad: within our model of robustness the promise on the input cannot be weakened to closeness of single-copy marginals or to a global trace-distance budget alone, as in both cases some inputs defeat every measurement and estimator.
Related
- Portfolio Selection by Joint Estimation-Robustness Optimization with the Return and Risk Constraints
- When n is not enough: Assessing the interplay of spatial sampling error and sample selection in abundance estimation
- A Quantum Phase Neural Network with Multi-Inputs/Single-Output
- L2-error bounds for covariation estimation under asynchronous mixed time-space sampling
- Amortized ratio-estimation importance sampling and localized simulation-based calibration for intractable likelihoods
BibTeX
@misc{visnevskyi2026robustness,
title = {{Robustness of quantum spectrum estimation: weak Schur sampling under noisy inputs}},
author = {Vladyslav Visnevskyi and Laura Mančinska},
howpublished = {arXiv},
year = {2026},
month = oct,
doi = {10.48550/arxiv.2610.03582},
eprint = {2610.03582},
archivePrefix = {arXiv},
url = {https://arxiv.org/abs/2610.03582},
note = {CC BY-NC-SA 4.0},
}
RIS
TY - UNPB
TI - Robustness of quantum spectrum estimation: weak Schur sampling under noisy inputs
AU - Vladyslav Visnevskyi
AU - Laura Mančinska
PY - 2026
DA - 2026/10/15
PB - arXiv
DO - 10.48550/arxiv.2610.03582
UR - https://arxiv.org/abs/2610.03582
AB - We initiate the study of weak Schur sampling (WSS) under noisy inputs. Many optimal quantum learning algorithms rely on this measurement, for instance in quantum spectrum estimation (QSE) and quantum state tomography (QST). The standard analysis of WSS, QSE and QST assumes that the n input copies of the target state ρ are identical, i.e. ρ^⊗ n. We study what happens when they are not, a more realistic noisy scenario that breaks the very permutation symmetry on which WSS is built. In the simplest model the input is a noisy product state: the copies are independent but not necessarily identical and each is ε-close in trace distance to the d-dimensional target state ρ. A naive argument via the data-processing inequality allows the per-copy errors to accumulate to nε on the measurement outcome. We show that for QSE via WSS this does not happen: the expected estimation error in total variation is at most ε+η(n,d), where η(n,d)=O(d/√n) is the noiseless error, and the additive noise term ε is optimal. The output error does not grow with n even though the input error does; in this sense WSS is robust. Beyond noisy product states, for arbitrary input ω we show that the error is at most η(n,d)+1/n|ω−ρ^⊗ n|_W_1, where W_1 is the quantum Wasserstein distance of De Palma et al. In particular, our results imply, for the first time, noise-robustness of Keyl and Werner's seminal algorithm for QSE, more than two decades after its introduction. Finally, we show that the noise cannot be too bad: within our model of robustness the promise on the input cannot be weakened to closeness of single-copy marginals or to a global trace-distance budget alone, as in both cases some inputs defeat every measurement and estimator.
ER -