SearcharxivSearch

arXiv subjects

Marco Tomamichel

Publications and source records attributed to Marco Tomamichel.

At least 19 recordsLinked to original sources

Strong Converse for Quantum Capacity via a Fully Quantum Blowing-Up Lemma

We prove an exponential strong converse for quantum communication through every finite-dimensional memoryless channel: at any fixed rate above the quantum capacity, the entanglement-transmission fidelity of every code decays exponentially with the number of channel uses. The proof has two main ingredients. First, a fully quantum blowing-up lemma converts a low-fidelity code into a high-fidelity code, with a loss in the number of transmitted qubits controlled by the projective tensor norm of the orthogonal projection on the image of the Stinespring dilation of the channel across the receiver--environment bipartition. Second, a low-degree polynomial construction approximates the tensor power of this projector with exponential accuracy while controlling its projective norm, providing the approximation needed for the blowing-up argument.

quant-ph

Second-Order Expansion of Privacy Amplification Under f-Divergence Criteria

We derive the second-order asymptotics of randomness extraction from memoryless sources with side information under security criteria based on a broad class of Csisz\`ar f-divergences, treating both a fixed reference side-information marginal and optimization over that marginal. The conditional varentropy decomposes into fluctuations of the conditional entropy across different values of the side information and the average variance of the conditional surprisal for each value. Without marginal optimization, these contributions yield a Gaussian-mixture second-order profile. With marginal optimization, they combine into the total conditional varentropy, yielding a single Gaussian profile. As corollaries, we obtain second-order expansions for R\'enyi-entropy criteria of all orders $\alpha \in (0,1)$ and recover the known expansion for total variation distance.

cs.IT

On the Power of Adaptivity in Testing Quantum States in Fidelity

We study the problems of quantum state certification, equivalence testing and independence testing. In certification, given samples of an unknown quantum state $\rho$ and the description of a state $\sigma$, the goal is to test whether $\rho=\sigma$, or whether $\rho$ and $\sigma$ are far in a given distance measure. In equivalence testing, $\sigma$ is also unknown and only accessible via samples. Independence testing decides whether $\rho_{AC}=\rho_A\otimes\rho_C$, or is far from being a product. The sample complexities of these problems are now well-understood for a decision gap $\varepsilon$ in trace distance: in the single-copy measurement setting with $d$-dimensional states, all three tasks can be solved using the same non-adaptive approach, which uses $\Theta(d^{3/2}/\varepsilon^2)$ samples and is optimal in general, even without adaptivity. In this work, we consider decision gaps expressed in fidelity and study possible separations between these problems and how adaptivity can help. We prove that certification with respect to fidelity for a state $\sigma$ of rank $r$ does not benefit from adaptivity and requires $\widetilde{\Theta}(r^{3/2}/\varepsilon)$ samples. For equivalence testing and independence testing, we provide adaptive algorithms using $\widetilde{O}(\min\{d^{3/2}/\varepsilon^2,d^{9/4}/\varepsilon\})$ and $\widetilde{O}(\min\{(d_Ad_C)^{3/2}/\varepsilon^2,d_A^{9/4}d_C^{3/4}/\varepsilon\})$ samples, for $d_A\geq d_C$, respectively. Our main technique is a framework that uses partial learning and a reduction to testing in $\ell_2$-distance, adapted from the distribution testing literature. We show that adaptivity matters for equivalence testing in fidelity by proving that $\widetilde{\Omega}(1/\varepsilon^2)$ samples are necessary in the non-adaptive case even for qubits, showing a separation from certification.

quant-ph

No information transmission through quantum channels above capacity

We show that the capacity of a quantum channel demarcates a phase transition: while reliable transmission below capacity is always possible, any attempt to transmit information above it fails catastrophically. Specifically, we prove exponential strong converse theorems for unassisted quantum and classical communication over arbitrary finite-dimensional memoryless quantum channels. At rates beyond the respective capacity, the entanglement-generation fidelity and the success probability for classical communication decay exponentially with the number of channel uses. This rules out transmission above capacity even when one tolerates arbitrarily large errors. Our proof follows the classical Arimoto strategy, augmented by a crucial new ingredient: integral representations of R\'enyi information measures that lead to asymptotic continuity bounds for R\'enyi capacities.

quant-ph

Strong Converse Exponent of Quantum State Merging

We determine the strong converse exponent for the entanglement cost of quantum state merging, showing that it is characterized by the optimized $\alpha$-$z$ conditional R\'enyi entropies with $z=\alpha/2\in[1/2,1]$. This contrasts with the sandwiched conditional R\'enyi entropies that typically govern strong converse exponents in quantum information theory. As a consequence, we derive the strong converse exponent of the partially smoothed conditional min-entropy in purified distance. This exponent is governed by club-sandwiched conditional entropies, whereas global smoothing leads to a sandwiched expression.

quant-ph

Weak Log-Majorization for Negative Lim-P\'alfia Power Means

For $0 \le \alpha \le 1$ and $-1 \le r < 0$, let $\#_{r,\alpha}$ denote the weighted Kubo-Ando power mean of order $r$ and weight $\alpha$. Ando proved that, for every unitarily invariant norm, $\| A \ \#_{r,\alpha}\ B \| \le \| A \|\ \#_{r,\alpha}\ \| B \|$. We show that this inequality remains valid also for the Schatten $q$-quasi-norms with $0 < q < 1$. More generally, our main result resolves a problem recently posed by Hiai and Lim in the stronger form of weak log-majorization for multivariable Lim-P\'alfia power means of negative order. It yields analogous Schatten quasi-norm inequalities for every finite family of positive definite matrices.

math.FA

A strong converse for stabilizer codes over Pauli channels via the blowing-up lemma

We prove a strong converse for quantum communication over Pauli channels within the class of stabilizer codes. If a code whose code space is a full joint eigenspace of a stabilizer group transmits above the coherent information of its own input state, its entanglement fidelity decays exponentially in the block length; the encoder may be any isometry onto that space and the decoder any channel. For memoryless channels this determines the $\varepsilon$-quantum capacity of the class for every $\varepsilon < 1$, so that tolerating a constant error buys no rate; for antidegradable channels, such as the depolarizing channel with error probability $p \in [1/4, 3/4]$, that capacity is zero, while for $p \in [1/4,1/2)$ partial-transposition bounds provably cannot certify a strong converse. The proof uses neither additivity assumptions nor semidefinite relaxations: optimal decoding succeeds precisely on an event in a product probability space, so the blowing-up lemma of Ahlswede, G\'acs and K\"orner applies, and the side information it produces is charged against the coherent information. The argument also constrains near-deterministic decoding for codes of any kind, and we isolate the encoder-side statement that would extend it to all of them.

quant-ph

Hockey stick $f$-divergences

In this paper we give a systematic and unified treatment and extensions of various results on a new notion of quantum $f$-divergences defined from quantum hockey stick divergences, the theory of which has been developed recently in \cite{BHT_fdiv,HircheTomamichel_integral,LiuHircheCheng2025}. In particular, we consider non-normalized states and hockey stick $f$-divergences defined from more general notions of quantum hockey stick divergences, as well as a somewhat more general form of the integral representation defined in terms of an additional real parameter. We also consider the extension of the theory to general von Neumann algebras, and extend various results from \cite{HircheTomamichel_integral,LiuHircheCheng2025} to this setting. Our main results here are the representation of the hockey stick $f$-divergences in terms of Neyman-Pearson error probabilities, which was given in the finite-dimensional case in \cite{LiuHircheCheng2025}, an extension of Jen\v cov\'a's result \cite{Jencova2023} on the detection of reversibility of a quantum channel on a pair of states in terms of the hockey stick divergences, and an extension of a result in \cite{HircheTomamichel_integral} showing that the regularized hockey stick R\'enyi $\alpha$-divergences coincide with the Petz-type R\'enyi divergences for $\alpha\in(0,1)$ and with the sandwiched R\'enyi divergences for $\alpha>1$. Moreover, we give some partial results on the characterization of when different notions of quantum $f$-divergences give the same value on a pair of quantum states.

quant-ph

Reliability of asymptotic work extraction

Extracting work from quantum states is a fundamental task in quantum thermodynamics. Previous studies have primarily focused on determining the best achievable rate of work extraction, and remarkably, this characterization appeared to remain unchanged regardless of the choice of allowed processes: whether one considers the operationally motivated class of energy-conserving thermal operations, or the axiomatic class of Gibbs-preserving operations, the optimal extractable work is given by the Helmholtz free energy. Here, we challenge this perspective, showing that a more refined analysis of the asymptotic performance of work extraction reveals significant differences in the performance for the two different classes of free operations. Precisely, we focus on the trade-off between the extraction rate and its reliability, characterized by the optimal asymptotic speed at which the extraction error can be suppressed. We establish that the reliability of Gibbs-preserving operations and of thermal operations are respectively characterized by the Petz and the sandwiched R\'enyi relative entropies, demonstrating that the former in general strictly outperforms the latter, and providing new interpretations of several information-theoretic divergences. Our analysis reveals that operational constraints such as energy conservation impose stronger limitations on the achievable precision of quantum tasks than can be inferred from their asymptotic rates, thereby questioning the use of Gibbs-preserving operations as a mathematically convenient substitute for the physically realizable thermal processes.

quant-ph

Learning Pure Quantum States in Any Dimension (Almost) Without Regret

We extend quantum state tomography with minimal cumulative disturbance, first investigated in [arXiv:2406.18370], to arbitrary finite-dimensional pure states. A learner sequentially receives fresh copies of an unknown pure state, chooses a rank-one projector for each copy using the previous outcomes, and performs the corresponding two-outcome projective measurement. The goal is to learn the state while keeping the chosen projectors close to the unknown state in order to minimize disturbance. The qubit solution relies on the special geometry of the Bloch sphere and does not extend directly to qudits, where pure states form a curved manifold. We show that this obstruction can be overcome by working locally on the pure-state manifold. The algorithm proceeds in epochs. In each epoch, it fixes a current estimate, measures pairs of nearby rank-one projectors obtained by moving in opposite tangent directions, and takes differences of the corresponding outcomes. This gives an exact linear observation of the tangent component of the error. The resulting local linear models are combined with a robust variance-adaptive estimator and a hot-start regularization that transfers precision across epochs. For every unknown pure state in dimension \(d\), after \(T\) measured copies, our protocol achieves cumulative regret \(\mathcal{O}(d^3\log^2 T)\), and at each intermediate time \(t\leq T\) its current estimate has online infidelity \(\mathcal{O}(d^3\log(T)/t)\). Hence, pure-state tomography with essentially no cumulative disturbance is not a peculiarity of qubits but a geometric phenomenon that persists for qudits.

quant-ph

Tight Contraction Rates for Primitive Channels under Quantum $f$-Divergences

Data-processing inequalities capture the phenomenon that two probability distributions can only become less distinguishable under any common post-processing. For more fine-grained inequalities, one turns to strong data-processing inequality (SDPI) constants, which give the strongest inequalities for a given channel and reference state for a fixed measure of distinguishability. These quantities have been used to quantify the rate at which time-homogeneous Markov chains contract towards a fixed point both in the classical and quantum setting. In this work, we establish that quantum $f$-divergences satisfy a local reverse Pinsker inequality, which implies the asymptotic contraction rate of a primitive channel to its stationary state is upper bounded by the SDPI constant of any non-commutative $\chi^2$-divergence. Using quantum-detailed balance, we establish a sufficient condition for these bounds to be tight. Finally, we apply these results to Petz, Matsumoto, and Hirche-Tomamichel $f$-divergences, establishing new and strengthening previously known results.

quant-ph

Rethinking quantum smooth entropies: Tight one-shot analysis of quantum privacy amplification

We introduce an improved one-shot characterisation of randomness extraction against quantum side information (privacy amplification), strengthening known one-shot bounds and providing a unified derivation of the tightest known asymptotic constraints. Our main tool is a new class of smooth conditional entropies defined by lifting classical smooth divergences through measurements. A key role is played by the measured smooth R\'enyi relative entropy of order 2, which we show to admit an equivalent variational form: it can be understood as allowing for smoothing over not only states, but also non-positive Hermitian operators. Building on this, we establish a tightened leftover hash lemma, significantly improving over all known smooth min-entropy bounds on extractable randomness and recovering the sharpest classical achievability results. We extend these methods to decoupling, the coherent analogue of privacy amplification, obtaining a corresponding improved one-shot bound. Relaxing our smooth entropy bounds leads to one-shot achievability results in terms of measured R\'enyi divergences, tightening the bounds of [Dupuis, arXiv:2105.05342] and recovering state-of-the-art asymptotic i.i.d. error exponents. We show an approximate optimality of our results by giving a matching one-shot converse bound up to additive logarithmic terms. This yields an optimal second-order asymptotic expansion of privacy amplification under trace distance, establishing a significantly tighter one-shot achievability result than previously shown in [Shen et al., arXiv:2202.11590] and proving its optimality for all hash functions.

quant-ph

Projections with Respect to Bures Distance and Fidelity: Closed-Forms and Applications

We derive simple and unified closed-form expressions for projections with respect to fidelity (equivalently, the Bures and purified distances) onto several sets of interest. These include projections of bipartite positive semidefinite (PSD) matrices onto the set of PSD matrices with a given marginal, and projections of ensembles of PSD matrices onto the set of PSD decompositions of a given matrix, with important special cases corresponding to projections onto the set of quantum channels (via the Choi isomorphism) and onto the set of measurements. We introduce prior-channel decompositions of completely positive (CP) maps, which uniquely decompose any CP map into a prior PSD matrix and a quantum channel. This decomposition generalizes the Choi-Jamiolkowski isomorphism by establishing a bijective correspondence between arbitrary bipartite PSD matrices and channel-state pairs, and we show that it arises naturally from the fidelity projections developed here. As applications, we show that the pretty good measurement - associated with a weighted ensemble - is the fidelity projection of the ensemble onto the set of measurements, and that the Petz recovery map - associated with a reference state and forward channel - is the projection of a CP map (constructed from the channel-state pair) onto the set of reverse quantum channels, thereby recasting the well-known identification of the Petz map with quantum Bayes' rule in information-geometric terms. Our results also provide an information-geometric underpinning of the Leifer-Spekkens quantum state over time formalism [Leifer and Spekkens, Phys. Rev. A 88, 052130 (2013)].

quant-ph

A complete characterisation of conditional entropies

Entropies are fundamental measures of uncertainty with central importance in information theory and statistics and applications across all the quantitative sciences. Under a natural set of operational axioms, the most general form of entropy is captured by the family of R\'enyi entropies, parameterized by a real number $\alpha$. Conditional entropy extends the notion of entropy by quantifying uncertainty from the viewpoint of an observer with access to potentially correlated side information. However, despite their significance and the emergence of various useful definitions, a complete characterization of measures of conditional entropy that satisfy a natural set of operational axioms has remained elusive. In this work, we provide a complete characterization of conditional entropy, defined through a set of axioms that are essential for any operationally meaningful definition: additivity for independent random variables, invariance under relabeling, and monotonicity under conditional mixing channels. We prove that the most general form of conditional entropy is captured by a family of measures that are exponential averages of R\'enyi entropies of the conditioned distribution and parameterized by a real parameter and a probability measure on the positive reals. Finally, we show that these quantities determine the rate of transformation under conditional mixing and provide a set of second laws of quantum thermodynamics with side information for states diagonal in the energy eigenbasis.

cs.IT

The strong converse exponent of composable randomness extraction against quantum side information

We find a tight characterization of the strong converse exponent for randomness extraction against quantum side information. In contrast to previous tight bounds, we employ a composable error criterion given by the fidelity (or purified distance) to a uniform distribution in product with the marginal state. The characterization is in terms of a club-sandwiched conditional entropy recently introduced by Rubboli, Goodarzi and Tomamichel and used by Li, Li and Yu to establish the strong converse exponent for the case of classical side information. This provides the first precise operational interpretation of this family of conditional entropies in the quantum setting.

quant-ph

Conditions for Large-Sample Majorization of Pairs of Flat States in Terms of $\alpha$-z Relative Entropies

We offer the first operational interpretation of the $\alpha$-z relative entropies, a measure of distinguishability between two quantum states introduced by Jak\v{s}i\'c et al. and Audenaert and Datta. We show that these relative entropies appear when formulating conditions for large-sample or catalytic relative majorization of pairs of flat states and certain generalizations of them. Indeed, we show that such transformations exist if and only if all the $\alpha$-z relative entropies for $\alpha$<1 of the two pairs are ordered. In this setting, the $\alpha$ and z parameters are truly independent from each other. These results also yield an expression for the optimal rate of converting one flat state pair into another. Our methods use real-algebraic techniques involving preordered semirings and certain monotone homomorphisms and derivations on them.

quant-ph

Additivity of quantum relative entropies as a single-copy criterion

The fundamental goal of information theory is to characterize complex operational tasks using efficiently computable information quantities, Shannon's capacity formula being the prime example of this. However, many tasks in quantum information can only be characterized by regularized entropic measures that are often not known to be computable and for which efficient approximations are scarce. It is thus of fundamental importance to understand when regularization is not needed, opening the door to an efficiently computable characterization based on additive quantities. Here, we demonstrate that for a large class of problems, the question of whether regularization is needed or not can be determined at the single-copy level. Specifically, we demonstrate that regularization of the Umegaki relative entropy, along with related quantities such as the Petz and sandwiched relative entropies, is not needed if and only if a single-copy optimizer satisfies a certain property. These problems include hypothesis testing with arbitrarily varying hypotheses as well as quantum resource theories used to derive fundamental bounds for entanglement and magic state distillation. We derive the Stein, Chernoff, and Hoeffding exponents for these problems and establish necessary and sufficient conditions for their additivity, while also presenting partial results for the strong converse exponent.

quant-ph

Testing (Conditional) Mutual Information

We investigate the sample complexity of mutual information and conditional mutual information testing. For conditional mutual information testing, given access to independent samples of a triple of random variables $(A, B, C)$ with unknown distribution, we want to distinguish between two cases: (i) $A$ and $C$ are conditionally independent, i.e., $I(A\!:\!C|B) = 0$, and (ii) $A$ and $C$ are conditionally dependent, i.e., $I(A\!:\!C|B) \geq \varepsilon$ for some threshold $\varepsilon$. We establish an upper bound on the number of samples required to distinguish between the two cases with high confidence, as a function of $\varepsilon$ and the three alphabet sizes. We conjecture that our bound is tight and show that this is indeed the case in several parameter regimes. For the special case of mutual information testing (when $B$ is trivial), we establish the necessary and sufficient number of samples required up to polylogarithmic terms. Our technical contributions include a novel method to efficiently simulate weakly correlated samples from the conditionally independent distribution $P_{A|B} P_{C|B} P_B$ given access to samples from an unknown distribution $P_{ABC}$, and a new estimator for equivalence testing that can handle such correlated samples, which might be of independent interest.

cs.DS