Performance Guarantees for Quantum Neural Estimation of Entropies
Sreejith Sreekumar, Ziv Goldfeld, Mark M. Wilde

TL;DR
This paper provides theoretical error bounds and concentration results for quantum neural estimators used to measure quantum entropies, aiding their practical implementation.
Contribution
It establishes non-asymptotic error guarantees and tail bounds for QNEs, including optimal sample complexity and improved bounds for permutation-invariant cases.
Findings
Error risk bounds for quantum neural estimators of measured relative entropies.
Exponential tail bounds showing sub-Gaussian concentration of estimation error.
Sample complexity bounds with minimax optimal dependence on accuracy and improved bounds for permutation-invariant states.
Abstract
Estimating quantum entropies and divergences is an important problem in quantum physics, information theory, and machine learning. Quantum neural estimators (QNEs), which utilize a hybrid classical-quantum architecture, have recently emerged as an appealing computational framework for estimating these measures. Such estimators combine classical neural networks with parametrized quantum circuits, and their deployment typically entails tedious tuning of hyperparameters controlling the sample size, network architecture, and circuit topology. This work initiates the study of formal guarantees for QNEs of measured (R\'enyi) relative entropies in the form of non-asymptotic error risk bounds. We further establish exponential tail bounds showing that the error is sub-Gaussian and thus sharply concentrates about the ground truth value. For an appropriate sub-class of density operator pairs on a…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
