Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:2607.15853

Maximal quantum leakage: operational interpretation and quantum channel analysis

Shuixin Xiao, Zijia Zhao, Jingge Zhu, Farhad Farokhi

quant-pheess.SYSubmitted Jul 17, 2026• Announced Jul 20, 2026• 1 citation
arXivHTMLPDF

Abstract

Maximal quantum leakage quantifies privacy against adversaries with arbitrary intentions. In this work, we prove that computing this leakage is equivalent to minimum-error quantum state discrimination with equal priors. This establishes a computable operational interpretation, addressing the previous difficulty in computing maximal quantum leakage. We further analyze the impact of collective measurements on multiple copies of a state, demonstrating that leakage increases monotonically with the number of copies, which leads to explicitly characterizing the maximal leakage in the asymptotic limit. Extending this framework to quantum channels, we develop an iterative algorithm for the jointly designing of input states and measurements. Numerical examples involving collective measurements and the maximal channel leakage demonstrate our theoretical findings.

Comments
6 Pages, 2 figures

Related papers

Maximal information leakage from quantum encoding of classical data

Farhad Farokhi

An alternative measure of information leakage for quantum encoding of classical data is defined. An adversary can access a single copy of the state of a quantum system that encodes some classical data and is interested in correctly guessing a general randomized or deterministic function of the data (e.g., a specific feature or attribute of the data in quantum machine learning) that is unknown to the security analyst. The resulting measure of information leakage, referred to as maximal quantum leakage, is the multiplicative increase of the probability of correctly guessing any function of the classical data upon observing measurements of the quantum state. Maximal quantum leakage is shown to satisfy the postprocessing inequality (i.e., applying a quantum channel reduces information leakage) and independence property (i.e., leakage is zero if the quantum state is independent of the classical data), which are fundamental properties required for privacy and security analysis. It also bounds accessible information. Effects of global and local depolarizing noise models on the maximal quantum leakage are established.

arXiv:2307.12529•Physical Review A•Feb 16, 2024•8 citations

Perturbation Analysis of Maximal Quantum Leakage

Zijia Zhao, Shuixin Xiao, Farhad Farokhi

Maximal quantum leakage (MQL) is a worst-case information leakage measure that quantifies an adversary's inference advantage gained from accessing quantum encoding of classical data with arbitrary measurements. While MQL admits an exact characterization for a given ensemble of quantum states, its robustness to implementation imperfections has not been systematically studied. In this paper, we analyze the sensitivity of maximal quantum leakage under perturbations of the quantum encoding. We establish a continuity bound in terms of the trace distance between ideal and perturbed quantum states, and show, via an example, that this bound is attainable. We further derive fidelity-based and relative-entropy-based sufficient conditions for bounding the variation of maximal quantum leakage, and illustrate numerically that these conditions can be loose.

quant-pharXiv:2607.14469•Jul 17, 2026•0 citations

Maximal $\alpha$ - Leakage for Quantum Privacy Mechanisms and Operational Meaning of Measured Renyi Capacity

Bo-Yu Yang, Hsuan Yu, Hao–Chung Cheng

In this work, maximal a-leakage is introduced to quantify how much a quantum adversary can learn about any sensitive information of data upon observing its disturbed versionvia a quantum privacy mechanism. We first show that an adversary's maximal expected a-gain using optimal measurement is characterized by measured conditional Renyi entropy. This can be viewed as a parametric generalization of Konig et al.'s famous guessing probability formula [IEEE Trans. Inf. Theory, 55(9), 2009]. Then, we prove that the a-leakage and maximal$\alpha$-leakage for a quantum privacy mechanism are determined by measured Arimoto information and measured Renyi capacity, respectively. Various properties of maximal a-leakage, such as data processing inequality and composition property are established as well. Moreover, we show that regularized a-leakage and regularized maximal a-leakage for identical and independent quantum privacy mechanisms coincide with a-tilted sandwiched Renyi information and sandwiched Renyi capacity, respectively. A full version of this paper is accessible at: https://arxiv.org/pdf/2403.14450 [1].

IEEE International Symposium on Information Theory (ISIT)•Jul 7, 2024•0 citations

Estimation of Quantum States and Operations

Ballester Sánchez, Manuel Alberto

The subject of this thesis, quantum estimation theory, is inspired by recent developments, both practical and theoretical, in the new field of quantum information and computation. The main task of quantum estimation theory, the subject of this thesis, is that given many identical copies of an unknown quantum system one wants to "guess" or estimate what the system is. This is done by performing an "optimal" measurement and analyzing the data obtained from it. A quantum state is represented by a density matrix. In some cases one does not need to know the whole density matrix, sometimes a partial characterization is enough. Chapter 2 of this thesis is about optimally estimating the spectrum, i.e. the eigenvalues, of a density matrix. This is useful, for example, for estimating the entanglement of a bipartite pure state. The results of chapter 2 tell us that one can optimally estimate bipartite entanglement with LOCC measurements on one of the two parties. Unitary operations transform density matrices to density matrices. They are the gates of quantum information processing. Suppose one has one such unitary operation but one does not know what it does. In order to characterize it one needs to know how it transforms any input state. In order to know how a particular state is transformed, one can prepare that state, feed it to the unitary many times, and measure the output. One state is, of course, not enough. It turns out that the unitary can be completely characterized with a finite set of states, this is known as quantum process tomography. Unfortunately, in many cases it is difficult to have available in the lab all the input states needed to perform quantum process tomography. It is here where entanglement comes to the rescue. One pair of maximally entangled qubits, where one of them is used as input for the unitary gate and the other is left untouched, is sufficient. All the information about the unknown gate is contained in the joint output state. This is the problem treated in chapter 3. Now the output state needs to be measured. Again, one could measure the two qubits separately (LOCC) or jointly (collective measurement). Is there anything to gain by performing joint measurements? The answer is yes, optimal collective measurements are at least 3 times more accurate than any LOCC measurement. Chapter 4 treats the problem of estimating commuting unitary gates. There it is shown that this extra information makes it unnecessary to use an entangled input state and to use collective measurements at the output. In chapters 3 and 4 it is assumed that only one copy of the unitary gate is available. If, however, more than one copy (say N ) are available at the same time one could use an N-fold entangled state as input. If no entanglement is used, classical statistics tells us that the error of the estimation is proportional to 1/√N. In the literature, it has been shown that by using an entangled state in the input one can achieve an error proportional to 1/N. However, this has been shown only for qubit gates. In chapter 5 important steps are taken in the direction of showing the same thing for a general unitary gate, but this remains an open problem.

•Jan 1, 2001•4 citations

The most discriminable quantum states in the multicopy regime

Maria Kvashchuk, Polina Chernyshova, Lucas E. A. Porto +3 more

This work investigates which sets of quantum states give rise to the highest achievable success probability in minimum-error state discrimination if multiple copies of the unknown state are given. Specifically, we consider uniformly distributed ensembles of the form $\left\{\frac{1}{N},ρ_i^{\otimes k}\right\}_{i=1}^N$, where $N$ states in dimension $d$ are provided in $k$ identical copies, and derive universal limits in this scenario. For pure state ensembles, we prove that whenever $N$ is large enough to support a state $k$-design, these designs will exactly give rise to the maximally discriminable sets. We further show that when $N$ exceeds the size required for a $k$-design, mixed states can outperform all pure state ensembles. We then recognise that the problem of most discriminable classical states in the multi-copy regime is in one-to-one correspondence to the concept of the multiplicative Bayes capacity of independent uses of classical channels, a concept that emerges naturally in the context of classical information leakage. This connection allows us to completely solve the classical analogue of our problem when $N\geq \binom{d + k - 1}{k}$, and to prove that quantum systems offer a quadratic advantage (in number of copies $k$) over classical ones. Then, we prove that this quantum over classical advantage is strongly reduced when one is restricted to real quantum states, more precisely, when $N \geq k + 1$, pure real qubits only offer a constant advantage over classical bits. Finally, we introduce computational techniques to find sets of most discriminable ensembles and to obtain rigorous universal upper bounds on the maximal success probability for multi-copy state discrimination in cases that are analytically intractable.

quant-pharXiv:2604.26927•Apr 30, 2026•1 citation

Projective robustness for quantum channels and measurements and their operational significance

Mingfei Ye, Yu Luo, Zhihui Li +1 more

Abstract Recently, the projective robustness of quantum states was introduced in (Regula 2022 Phys. Rev. Lett. 128 110505). This demonstrates that the projective robustness is a useful resource monotone and can comprehensively characterize the capabilities and limitations of probabilistic protocols that manipulate quantum resources deterministically. In this paper, we will extend the projective robustness to any convex resource theory of quantum channels and measurements. First, we introduce the projective robustness of quantum channels and prove that it satisfies some good properties, especially sub-multiplicativity under any free quantum process. Moreover, we show that the projective robustness of channels quantifies the maximal advantage that a given channel outperforms all free channels in the simultaneous discrimination and exclusion of a fixed-state ensemble. Second, we define the projective robustness of quantum measurements and prove that it exactly quantifies the maximal advantage that a given measurement outperforms all free measurements in the simultaneous discrimination and exclusion of two fixed-state ensembles. Finally, within a specific channel resource setting based on measurement incompatibility, we show that the projective robustness of quantum channels coincides with the projective robustness of measurement incompatibility.

arXiv:2111.12536•Laser Physics Letters•Jun 2, 2022•5 citations
Maximal quantum leakage quantifies privacy against adversaries with arbitrary intentions. In this work, we prove that computing this leakage is equivalent to minimum-error quantum state discrimination with equal priors. This establishes a computable operational interpretation, addressing the previous difficulty in computing maximal quantum leakage. We further analyze the impact of collective measurements on multiple copies of a state, demonstrating that leakage increases monotonically with the number of copies, which leads to explicitly characterizing the maximal leakage in the asymptotic limit. Extending this framework to quantum channels, we develop an iterative algorithm for the jointly designing of input states and measurements. Numerical examples involving collective measurements and the maximal channel leakage demonstrate our theoretical findings.
An alternative measure of information leakage for quantum encoding of classical data is defined. An adversary can access a single copy of the state of a quantum system that encodes some classical data and is interested in correctly guessing a general randomized or deterministic function of the data (e.g., a specific feature or attribute of the data in quantum machine learning) that is unknown to the security analyst. The resulting measure of information leakage, referred to as maximal quantum leakage, is the multiplicative increase of the probability of correctly guessing any function of the classical data upon observing measurements of the quantum state. Maximal quantum leakage is shown to satisfy the postprocessing inequality (i.e., applying a quantum channel reduces information leakage) and independence property (i.e., leakage is zero if the quantum state is independent of the classical data), which are fundamental properties required for privacy and security analysis. It also bounds accessible information. Effects of global and local depolarizing noise models on the maximal quantum leakage are established.
Maximal quantum leakage (MQL) is a worst-case information leakage measure that quantifies an adversary's inference advantage gained from accessing quantum encoding of classical data with arbitrary measurements. While MQL admits an exact characterization for a given ensemble of quantum states, its robustness to implementation imperfections has not been systematically studied. In this paper, we analyze the sensitivity of maximal quantum leakage under perturbations of the quantum encoding. We establish a continuity bound in terms of the trace distance between ideal and perturbed quantum states, and show, via an example, that this bound is attainable. We further derive fidelity-based and relative-entropy-based sufficient conditions for bounding the variation of maximal quantum leakage, and illustrate numerically that these conditions can be loose.
Maximal α\alphaα - Leakage for Quantum Privacy Mechanisms and Operational Meaning of Measured Renyi Capacity
In this work, maximal a-leakage is introduced to quantify how much a quantum adversary can learn about any sensitive information of data upon observing its disturbed versionvia a quantum privacy mechanism. We first show that an adversary's maximal expected a-gain using optimal measurement is characterized by measured conditional Renyi entropy. This can be viewed as a parametric generalization of Konig et al.'s famous guessing probability formula [IEEE Trans. Inf. Theory, 55(9), 2009]. Then, we prove that the a-leakage and maximalα\alphaα-leakage for a quantum privacy mechanism are determined by measured Arimoto information and measured Renyi capacity, respectively. Various properties of maximal a-leakage, such as data processing inequality and composition property are established as well. Moreover, we show that regularized a-leakage and regularized maximal a-leakage for identical and independent quantum privacy mechanisms coincide with a-tilted sandwiched Renyi information and sandwiched Renyi capacity, respectively. A full version of this paper is accessible at: https://arxiv.org/pdf/2403.14450 [1].
The subject of this thesis, quantum estimation theory, is inspired by recent developments, both practical and theoretical, in the new field of quantum information and computation. The main task of quantum estimation theory, the subject of this thesis, is that given many identical copies of an unknown quantum system one wants to "guess" or estimate what the system is. This is done by performing an "optimal" measurement and analyzing the data obtained from it. A quantum state is represented by a density matrix. In some cases one does not need to know the whole density matrix, sometimes a partial characterization is enough. Chapter 2 of this thesis is about optimally estimating the spectrum, i.e. the eigenvalues, of a density matrix. This is useful, for example, for estimating the entanglement of a bipartite pure state. The results of chapter 2 tell us that one can optimally estimate bipartite entanglement with LOCC measurements on one of the two parties. Unitary operations transform density matrices to density matrices. They are the gates of quantum information processing. Suppose one has one such unitary operation but one does not know what it does. In order to characterize it one needs to know how it transforms any input state. In order to know how a particular state is transformed, one can prepare that state, feed it to the unitary many times, and measure the output. One state is, of course, not enough. It turns out that the unitary can be completely characterized with a finite set of states, this is known as quantum process tomography. Unfortunately, in many cases it is difficult to have available in the lab all the input states needed to perform quantum process tomography. It is here where entanglement comes to the rescue. One pair of maximally entangled qubits, where one of them is used as input for the unitary gate and the other is left untouched, is sufficient. All the information about the unknown gate is contained in the joint output state. This is the problem treated in chapter 3. Now the output state needs to be measured. Again, one could measure the two qubits separately (LOCC) or jointly (collective measurement). Is there anything to gain by performing joint measurements? The answer is yes, optimal collective measurements are at least 3 times more accurate than any LOCC measurement. Chapter 4 treats the problem of estimating commuting unitary gates. There it is shown that this extra information makes it unnecessary to use an entangled input state and to use collective measurements at the output. In chapters 3 and 4 it is assumed that only one copy of the unitary gate is available. If, however, more than one copy (say N ) are available at the same time one could use an N-fold entangled state as input. If no entanglement is used, classical statistics tells us that the error of the estimation is proportional to 1/√N. In the literature, it has been shown that by using an entangled state in the input one can achieve an error proportional to 1/N. However, this has been shown only for qubit gates. In chapter 5 important steps are taken in the direction of showing the same thing for a general unitary gate, but this remains an open problem.
This work investigates which sets of quantum states give rise to the highest achievable success probability in minimum-error state discrimination if multiple copies of the unknown state are given. Specifically, we consider uniformly distributed ensembles of the form {1N,ρi⊗k}i=1N\left\{\frac{1}{N},ρ_i^{\otimes k}\right\}_{i=1}^N{N1​,ρi⊗k​}i=1N​, where NNN states in dimension ddd are provided in kkk identical copies, and derive universal limits in this scenario. For pure state ensembles, we prove that whenever NNN is large enough to support a state kkk-design, these designs will exactly give rise to the maximally discriminable sets. We further show that when NNN exceeds the size required for a kkk-design, mixed states can outperform all pure state ensembles. We then recognise that the problem of most discriminable classical states in the multi-copy regime is in one-to-one correspondence to the concept of the multiplicative Bayes capacity of independent uses of classical channels, a concept that emerges naturally in the context of classical information leakage. This connection allows us to completely solve the classical analogue of our problem when N≥(d+k−1k)N\geq \binom{d + k - 1}{k}N≥(kd+k−1​), and to prove that quantum systems offer a quadratic advantage (in number of copies kkk) over classical ones. Then, we prove that this quantum over classical advantage is strongly reduced when one is restricted to real quantum states, more precisely, when N≥k+1N \geq k + 1N≥k+1, pure real qubits only offer a constant advantage over classical bits. Finally, we introduce computational techniques to find sets of most discriminable ensembles and to obtain rigorous universal upper bounds on the maximal success probability for multi-copy state discrimination in cases that are analytically intractable.
Abstract Recently, the projective robustness of quantum states was introduced in (Regula 2022 Phys. Rev. Lett. 128 110505). This demonstrates that the projective robustness is a useful resource monotone and can comprehensively characterize the capabilities and limitations of probabilistic protocols that manipulate quantum resources deterministically. In this paper, we will extend the projective robustness to any convex resource theory of quantum channels and measurements. First, we introduce the projective robustness of quantum channels and prove that it satisfies some good properties, especially sub-multiplicativity under any free quantum process. Moreover, we show that the projective robustness of channels quantifies the maximal advantage that a given channel outperforms all free channels in the simultaneous discrimination and exclusion of a fixed-state ensemble. Second, we define the projective robustness of quantum measurements and prove that it exactly quantifies the maximal advantage that a given measurement outperforms all free measurements in the simultaneous discrimination and exclusion of two fixed-state ensembles. Finally, within a specific channel resource setting based on measurement incompatibility, we show that the projective robustness of quantum channels coincides with the projective robustness of measurement incompatibility.