Performance Guarantees for Quantum Neural Estimation of Entropies

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ényi) 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 space of dimension $d$ with bounded Thompson metric, our theory establishes a copy complexity of $O(|\Theta (\mathcal{U})|d/{\epsilon }^2)$ for QNE with a quantum circuit parameter set $\Theta (\mathcal{U})$, which has minimax optimal dependence on the accuracy $\epsilon$. Additionally, if the density operator pairs are permutation invariant, we improve the dimension dependence above to $O(|\Theta (\mathcal{U})|\mathrm{polylog}(d)/{\epsilon }^2)$. Our theory aims to facilitate principled implementation of QNEs for measured relative entropies and guide hyperparameter tuning in practice.

43 pages

References in corpus (45)

• Quantum Machine Learning
• Variational Quantum Algorithms
• Hardware-efficient Variational Quantum Eigensolver for Small Molecules and Quantum Magnets
• Barren plateaus in quantum neural network training landscapes
• Cost Function Dependent Barren Plateaus in Shallow Parametrized Quantum Circuits
• On quantum Renyi entropies: a new generalization and some properties
• Estimating divergence functionals and the likelihood ratio by convex risk minimization
• Connecting ansatz expressibility to gradient magnitudes and barren plateaus
• Strong converse for the classical capacity of entanglement-breaking and Hadamard channels via a sandwiched Renyi relative entropy
• Min- and Max- Relative Entropies and a New Entanglement Monotone
• An initialization strategy for addressing barren plateaus in parametrized quantum circuits
• Layerwise learning for quantum neural networks
• Nonparametric regression using deep neural networks with ReLU activation function
• Asymptotic Error Rates in Quantum Hypothesis Testing
• The Chernoff lower bound for symmetric quantum hypothesis testing
• Quantum hypothesis testing and the operational interpretation of the quantum Renyi relative entropies
• Exploiting symmetry in variational quantum machine learning
• Sample-optimal tomography of quantum states
• Efficient Quantum Circuits for Schur and Clebsch-Gordan Transforms
• Optimal sequence of quantum measurements in the sense of Stein's lemma in quantum hypothesis testing
• Variational Quantum Fidelity Estimation
• Universal expressiveness of variational quantum classifiers and quantum kernels for support vector machines
• Theory for Equivariant Quantum Neural Networks
• Relative Entropy of Entanglement and Restricted Measurements
• On the Universality of the Quantum Approximate Optimization Algorithm
• On Variational Expressions for Quantum Relative Entropies
• Does provable absence of barren plateaus imply classical simulability?
• Entanglement spectroscopy with a depth-two quantum circuit
• Quantum algorithm for estimating Renyi entropies of quantum states
• Quantum Algorithm for Fidelity Estimation
• An efficient high dimensional quantum Schur transform
• Measuring Quantum Entropy
• On Composite Quantum Hypothesis Testing
• New Quantum Algorithms for Computing Quantum Entropies and Distances
• Quantum algorithms for estimating quantum entropies
• Quantum Phase Processing and its Applications in Estimating Phase and Entropies
• An Improved Sample Complexity Lower Bound for (Fidelity) Quantum State Tomography
• Variational quantum algorithms to estimate rank, quantum entropies, fidelity and Fisher information via purity minimization
• Estimating Quantum Mutual Information Through a Quantum Neural Network
• Minimax Rate-Optimal Estimation of Divergences between Discrete Distributions
• Quantum Neural Estimation of Entropies
• A Quantum Algorithm Framework for Discrete Probability Distributions with Applications to Rényi Entropy Estimation
• Locally-Measured Rényi Divergences
• Time-Efficient Quantum Entropy Estimator via Samplizer
• Distributed Quantum Hypothesis Testing under Zero-rate Communication Constraints