It is proved that the accuracy of any quantum-computing inference procedure is upper bounded by the maximal quantum leakage from the classical data through its quantum encoding, establishing leakage as a universal, task-agnostic quality measure for encoders.
Abstract
Optimal encoding of classical data for quantum-assisted statistical inference is investigated from an information-theoretic perspective. We prove that the accuracy of any quantum-computing inference procedure is upper bounded by the maximal quantum leakage from the classical data through its quantum encoding, establishing leakage as a universal, task-agnostic quality measure for encoders. This demonstrates that the maximal quantum leakage is a universal measure of the quality of the encoding strategy for statistical inference as it only depends on the quantum encoding of the data and not the inference task itself. The optimal universal encoding strategy, i.e., an encoding strategy that maximizes the maximal quantum leakage, is proved to be attained by pure states. When there are enough qubits, basis encoding is proved to be universally optimal. However, when the dimension of the system is small, phase encoding is optimal. For the latter, any tight frame, any ensemble whose average state is the maximally mixed state, is in fact optimal. Within tight frames, equiangular tight frames (ETFs) are distinguished as the uniquely symmetric optimal encodings, i.e., they saturate the Welch lower bound on pairwise overlaps and possess a self-referential optimal measurement. Prominent special cases are the qubit trine, the regular simplex, and symmetric informationally complete positive operator-valued measures (SIC-POVMs), for which the ETF structure and explicit codeword constructions are provided. Numerical examples are presented to validate the theoretical predictions.
The minimum change principle provides an information-theoretic characterization of the Bayes reversal channel in classical probability theory and has recently been proposed as a framework for extending Bayes'rule to quantum information theory. Using quantum relative entropy, we investigate a minimum change principle fo...
It is explained that the efficiently preparable states, device-generated distributions, variationally learned loading, and amortized preparation are required to get advantage from quantum machine learning and close with a checklist for evaluating input-dependent advantage claims.
Quantum state ensembles are important in quantum information processing. For example, quantum $t$-designs model highly entangled states in complex systems, while projected ensembles appear in generative quantum machine learning and studies of thermalization. With their sample state accompanied by a classical label, the...
F fidelity-based and relative-entropy-based sufficient conditions for bounding the variation of maximal quantum leakage are derived, and it is illustrated numerically that these conditions can be loose.
This work presents a Lean 4 library for quantum information, designed as a reusable formal infrastructure for theoretical analysis, and formalizes the DPI for the sandwiched R\'enyi relative entropy for positive semidefinite operators on finite-dimensional quantum systems.
Kazumi Kasaura, Kei Tsukamoto, Kento Mori et al.· 2 citations
Lean-QIT provides a machine-readable foundation for formal QIT and a compositional knowledge substrate for emerging AI-assisted formalization, automated proof search, and agentic reasoning in quantum information and computation.