Finite-Size Limits of Adaptive Pauli Prediction
Abstract
The expectation values of a predetermined set of Pauli observables can be predicted using only a few copies of a quantum state. However, when later observables depend on earlier predictions, how the system size constrains the required number of copies remains unclear. We use classical interactive fingerprinting codes to establish this constraint. A compact Pauli-parity encoding embeds the fingerprinting interaction into the quantum prediction task, allowing any quantum prediction mechanism on the constructed diagonal states to be simulated by a classical response strategy subject to the same information constraints. We show that accurate prediction from too few copies would violate the guarantees of the fingerprinting code. For n qubits and M adaptively chosen Pauli observables, requiring all predictions to be simultaneously accurate to a fixed additive error with probability at least 2/3 yields the worst-case lower bound N*(n,M)=Ω(√(min{n,M})) on the required number of copies. For M≤ n, this lower bound matches known upper bounds. In particular, n adaptive predictions require Θ(√n) copies, whereas the same number of predetermined queries requires only O(log n) copies. This separation persists even for diagonal states and commuting observables.
Related
- Achievability of CSS codes performance limits over Pauli channels under separate ML decoding with bounded graphical complexity
- Adaptive sensing beyond non-adaptive information limits: End-to-end co-design of geometry, policy, and inference
- Why finite-size non-Hermitian eigenvalues can miss asymptotic eigenstates in topological physics
- Balancing theory uncertainties in ab initio nuclear structure calculations: Many-body truncation versus finite basis size
- Finite-size scaling theory of Rényi thermal entropy for second-order, first-order, and weakly first-order quantum phase transitions
BibTeX
@misc{wang2026finitesize,
title = {{Finite-Size Limits of Adaptive Pauli Prediction}},
author = {Luofei Wang and Boyu Liu and Zihe Wang and Zhangqi Yin},
howpublished = {arXiv},
year = {2026},
month = oct,
doi = {10.48550/arxiv.2610.13652},
eprint = {2610.13652},
archivePrefix = {arXiv},
url = {https://arxiv.org/abs/2610.13652},
note = {CC BY 4.0},
}
RIS
TY - UNPB
TI - Finite-Size Limits of Adaptive Pauli Prediction
AU - Luofei Wang
AU - Boyu Liu
AU - Zihe Wang
AU - Zhangqi Yin
PY - 2026
DA - 2026/10/29
PB - arXiv
DO - 10.48550/arxiv.2610.13652
UR - https://arxiv.org/abs/2610.13652
AB - The expectation values of a predetermined set of Pauli observables can be predicted using only a few copies of a quantum state. However, when later observables depend on earlier predictions, how the system size constrains the required number of copies remains unclear. We use classical interactive fingerprinting codes to establish this constraint. A compact Pauli-parity encoding embeds the fingerprinting interaction into the quantum prediction task, allowing any quantum prediction mechanism on the constructed diagonal states to be simulated by a classical response strategy subject to the same information constraints. We show that accurate prediction from too few copies would violate the guarantees of the fingerprinting code. For n qubits and M adaptively chosen Pauli observables, requiring all predictions to be simultaneously accurate to a fixed additive error with probability at least 2/3 yields the worst-case lower bound N^*(n,M)=Ω(√(min{n,M})) on the required number of copies. For M≤ n, this lower bound matches known upper bounds. In particular, n adaptive predictions require Θ(√n) copies, whereas the same number of predetermined queries requires only O(log n) copies. This separation persists even for diagonal states and commuting observables.
ER -