arXiv:2610.06842
Quantum information processing under maximal distance measures
Bartosz Regula, Ludovico Lami, Mario Berta, Marco Tomamichel
Abstract
The measures of distance frequently used in quantum information, such as trace distance or fidelity-based purified distance, are the smallest extensions of the corresponding distance measures in classical information theory. However, this way of extending classical distances is not unique, and a whole spectrum of other extensions can be defined. Here we study the question of how quantum information processing tasks are affected by a change of the error metrics to the maximal extensions of the classical distance measures, imposing more demanding error requirements on operational tasks. We find that the performance of some tasks, such as channel coding or quantum resource distillation, is not affected whatsoever by this change. However, for other tasks such as channel simulation and quantum resource dilution, we show that the rates are now given not by functions of the standard (Umegaki) quantum relative entropy, but ones based on the Belavkin-Staszewski relative entropy. Our results connect the Belavkin-Staszewski relative entropy with operational tasks and reveal that known reversibility results in quantum information, including the reverse Shannon theorem and the asymptotic reversibility of quantum resource transformations, no longer hold under maximal distance measures.
AI Summary
The paper asks whether asymptotic quantum-information processing rates depend on how classical error distances are extended to quantum states. It replaces trace and purified distance—the minimal extensions—with their maximal data-processing-compatible extensions, imposing stricter error criteria. Distillation and channel coding retain their standard performance whenever suitable free twirling operations exist; the equivalence holds even one-shot. Consequently, entanglement-assisted and no-signalling-assisted quantum capacities remain $I(\mathcal N)/2$. Dilution can change: under Gibbs-preserving operations, work cost becomes the Belavkin–Staszewski relative entropy $\widehat D(\rho\|\gamma)$, while extraction remains governed by Umegaki relative entropy. Pure-state entanglement cost under non-entangling or asymptotically non-entangling operations becomes $S_{1/2}(\psi_A)=2\log\operatorname{Tr}\sqrt{\psi_A}$, versus distillation yield $S(\psi_A)$. These gaps rule out the corresponding reversibility statements under maximal errors. The technical basis is a maximal extension of smooth max-relative entropy, semidefinite variational formulas, and a fixed-error asymptotic equipartition property converging to $\widehat D$. Bounds follow by optimizing classical inequalities over reverse preparation tests; twirling establishes the unchanged distillation results. No-signalling-assisted channel simulation is characterized by a regularized smooth maximal information. It equals $\widehat I(\mathcal N)/2$ for pure-output classical–quantum channels and qubit amplitude damping; the latter costs $\log(1+\sqrt{1-\gamma})$ qubits per use. Explicit mixed-output counterexamples show that $\widehat I$ is nonadditive, precluding this single-letter formula generally. General simulation rates remain regularized, and exact dilution results use the specified operation classes. Higher-order asymptotics are left open. The maximal trace distance also need not satisfy the triangle inequality and assigns distance one to distinct pure states.
The examples of channels in Section~\ref{sec:additivity_examples} and Appendix~\ref{sec:nonadditivity_examples} were obtained by consulting the omniscient oracle in the form of ChatGPT 6 Astra.
Error found: The exact one-shot no-signalling simulation formulas omit rounding to an integer communication dimension, yielding approximately 0.339 qubits for an example whose cost under the stated definition is 1 qubit.
Written by gpt-6.1-sol from the paper's full text. Automated: it can be wrong.
- Comments
- 28+4 pages