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.26123

Quantum Information Decoupling Beyond Finite Dimensions

Hayata Yamasaki

quant-phSubmitted Jul 28, 2026• Announced Jul 30, 2026• 1 citation
arXivHTMLPDF

Abstract

Quantum information decoupling is a pillar of quantum information theory, underlying quantum communication, error correction, and information recovery. However, its existing formulations rely on random unitary operations tied to finite-dimensional assumptions on quantum systems. Here we establish a decoupling framework for arbitrary separable, possibly infinite-dimensional systems. For finite-dimensional inputs and arbitrary separable reference/output systems, we derive error bounds on one-shot decoupling for completely positive maps in terms of sandwiched Rényi conditional entropies. For partial-trace decoupling with finite-dimensional references, the error exponent is optimal up to the known critical rate. To handle infinite-dimensional inputs, we assume finite entropy of the manipulated system. We construct finite-rank projections on independent and identically distributed (IID) states to restrict randomization to a projected finite-dimensional subspace, while ensuring high success probability by including auxiliary components in the discarded subsystem at asymptotically negligible cost. This leads to an infinite-dimensional IID partial-trace decoupling protocol achieving optimal asymptotic dimension rates. As an application, we construct an infinite-dimensional quantum-state-merging protocol, a mother protocol of quantum information theory. Under finite entropy of Alice's marginal, it achieves the same quantum-communication and total-cost rates as in finite dimensions, governed by mutual information and conditional entropy. These results show that the operational interpretation of entropic quantities through these achievable rates constitutes a universal principle beyond finite dimensions. More broadly, our framework provides foundational tools for exploring quantum information regardless of whether we model the physical world using finite- or infinite-dimensional spaces.

Comments
109 pages, no figure

Related papers

Tight any-shot quantum decoupling

Mario Berta, Hao-Chung Cheng, Yongsheng Yao

Quantum information decoupling is a fundamental primitive in quantum information theory, underlying various applications in quantum physics. We prove a novel one-shot decoupling theorem formulated in terms of quantum relative entropy distance, with the decoupling error bounded by two sandwiched Rényi conditional entropies. In the asymptotic i.i.d. setting of standard information decoupling via partial trace, we show that this bound is ensemble-tight in quantum relative entropy distance and thereby yields a characterization of the associated decoupling error exponent in the low-cost-rate regime. Leveraging this framework, we derive several operational applications formulated in terms of purified distance: (i) single-letter expressions for the exact error exponents of quantum state merging in the low-entanglement-cost and high-entanglement-distillation-rate regimes, in terms of Petz-Rényi conditional entropies, and (ii) regularized expressions for achievable error exponents of entanglement distillation and quantum channel coding in terms of Petz-Rényi coherent informations. We further prove that these achievable bounds are tight for maximally correlated states and generalized dephasing channels, respectively, for the high distillation-rate/coding-rate regimes.

quant-pharXiv:2602.17430•Feb 20, 2026•13 citations

Error exponent of quantum information decoupling

Mario Berta, Hao-Chung Cheng, Yongsheng Yao

Quantum information decoupling is a fundamental tool in quantum information theory with broad applications in quantum physics. In this paper, we establish a one-shot upper bound on the decoupling error under the quantum relative entropy, expressed in terms of the sandwiched Rényi conditional entropy. This bound yields an achievability result for the corresponding error exponent in the i.i.d. setting. We further derive a one-shot lower bound on the decoupling error in terms of an information-spectrum quantity, which leads to a converse bound on the error exponent. We show that this converse matches the achievability bound whenever the decoupling rate lies below a critical threshold. As a consequence, we obtain an exact characterization of the decoupling error exponent in the low-rate regime.

IEEE International Symposium on Information Theory (ISIT)•Jun 1, 2026•0 citations

Entanglement Cost for Infinite-Dimensional Physical Systems

Hayata Yamasaki, Kohdai Kuroiwa, Patrick M. Hayden +1 more

Abstract We prove that the entanglement cost equals the regularized entanglement of formation for any infinite-dimensional quantum state $$\rho _{AB}$$ ρ AB with finite quantum entropy on at least one of the subsystems A or B . This generalizes a foundational result in quantum information theory that was previously formulated only for operations and states on finite-dimensional systems. The extension to infinite-dimensional systems is nontrivial because the conventional tools for establishing both the direct and converse bounds, i.e., strong typicality, monotonicity, and asymptotic continuity, are no longer directly applicable. To address this problem, we construct a new entanglement dilution protocol for infinite-dimensional states implementable by local operations and a finite amount of one-way classical communication (one-way LOCC), using weak and strong typicality multiple times. We also prove the optimality of this protocol among all protocols, even under infinite-dimensional separable operations, by developing an argument based on alternative forms of monotonicity and asymptotic continuity of the entanglement of formation for infinite-dimensional states. Along the way, we derive a new integral representation for the quantum entropy of infinite-dimensional states, which we believe to be of independent interest. Our results allow us to fully characterize an important operational entanglement measure—the entanglement cost—for all infinite-dimensional physical systems.

arXiv:2401.09554•Communications in Mathematical Physics•Oct 3, 2025•20 citations

Optimal Second-Order Rates for Quantum Information Decoupling

Yuchen Shen, Gao Li, Hao–Chung Cheng

In this paper, we consider the standard quantum information decoupling, in which Alice aims to decouple her system from the environment by discarding some of her systems. To achieve an ε-decoupling with trace distance as the error criterion, we establish a one-shot characterization for the largest size of the remainder system in terms of the conditional (1 − ε)-hypothesis-testing entropy. When the underlying system is independent and identically prepared, our result leads to the matched second-order rate as well as the moderate deviation rate.

arXiv:2403.14338•IEEE International Symposium on Information Theory (ISIT)•Jun 25, 2023•1 citation

Min- and Max-Entropy in Infinite Dimensions

Fabian Furrer, Johan Åberg, Renato Renner

We consider an extension of the conditional min- and max-entropies to infinite-dimensional separable Hilbert spaces. We show that these satisfy characterizing properties known from the finite-dimensional case, and retain information-theoretic operational interpretations, e.g., the min-entropy as maximum achievable quantum correlation, and the max-entropy as decoupling accuracy. We furthermore generalize the smoothed versions of these entropies and prove an infinite-dimensional quantum asymptotic equipartition property. To facilitate these generalizations we show that the min- and max-entropy can be expressed in terms of convergent sequences of finite-dimensional min- and max-entropies, which provides a convenient technique to extend proofs from the finite to the infinite-dimensional setting.

arXiv:1004.1386•Communications in Mathematical Physics•Jun 25, 2011•57 citations

Reliability Function of Quantum Information Decoupling

Ke Li, Yongsheng Yao

Quantum information decoupling is an important quantum information processing task, which has found broad applications. In this paper, we characterize the performance of catalytic quantum information decoupling regarding the exponential rate under which perfect decoupling is approached, namely, the reliability function. We have obtained the exact formula when the decoupling cost is not larger than a critical value. In the situation of high cost, we provide upper and lower bounds. This result is then applied to quantum state merging and correlation erasure, exploiting their connection to decoupling. As technical tools, we derive the exponents for smoothing the conditional min-entropy and max-information, and we prove a novel bound for the convex-split lemma. Our results are given in terms of the sandwiched Renyi divergence, providing it with operational meanings in characterizing how fast the performance of quantum information tasks approach the perfect.

•Nov 11, 2021•4 citations
Quantum information decoupling is a pillar of quantum information theory, underlying quantum communication, error correction, and information recovery. However, its existing formulations rely on random unitary operations tied to finite-dimensional assumptions on quantum systems. Here we establish a decoupling framework for arbitrary separable, possibly infinite-dimensional systems. For finite-dimensional inputs and arbitrary separable reference/output systems, we derive error bounds on one-shot decoupling for completely positive maps in terms of sandwiched Rényi conditional entropies. For partial-trace decoupling with finite-dimensional references, the error exponent is optimal up to the known critical rate. To handle infinite-dimensional inputs, we assume finite entropy of the manipulated system. We construct finite-rank projections on independent and identically distributed (IID) states to restrict randomization to a projected finite-dimensional subspace, while ensuring high success probability by including auxiliary components in the discarded subsystem at asymptotically negligible cost. This leads to an infinite-dimensional IID partial-trace decoupling protocol achieving optimal asymptotic dimension rates. As an application, we construct an infinite-dimensional quantum-state-merging protocol, a mother protocol of quantum information theory. Under finite entropy of Alice's marginal, it achieves the same quantum-communication and total-cost rates as in finite dimensions, governed by mutual information and conditional entropy. These results show that the operational interpretation of entropic quantities through these achievable rates constitutes a universal principle beyond finite dimensions. More broadly, our framework provides foundational tools for exploring quantum information regardless of whether we model the physical world using finite- or infinite-dimensional spaces.
Quantum information decoupling is a fundamental primitive in quantum information theory, underlying various applications in quantum physics. We prove a novel one-shot decoupling theorem formulated in terms of quantum relative entropy distance, with the decoupling error bounded by two sandwiched Rényi conditional entropies. In the asymptotic i.i.d. setting of standard information decoupling via partial trace, we show that this bound is ensemble-tight in quantum relative entropy distance and thereby yields a characterization of the associated decoupling error exponent in the low-cost-rate regime. Leveraging this framework, we derive several operational applications formulated in terms of purified distance: (i) single-letter expressions for the exact error exponents of quantum state merging in the low-entanglement-cost and high-entanglement-distillation-rate regimes, in terms of Petz-Rényi conditional entropies, and (ii) regularized expressions for achievable error exponents of entanglement distillation and quantum channel coding in terms of Petz-Rényi coherent informations. We further prove that these achievable bounds are tight for maximally correlated states and generalized dephasing channels, respectively, for the high distillation-rate/coding-rate regimes.
Quantum information decoupling is a fundamental tool in quantum information theory with broad applications in quantum physics. In this paper, we establish a one-shot upper bound on the decoupling error under the quantum relative entropy, expressed in terms of the sandwiched Rényi conditional entropy. This bound yields an achievability result for the corresponding error exponent in the i.i.d. setting. We further derive a one-shot lower bound on the decoupling error in terms of an information-spectrum quantity, which leads to a converse bound on the error exponent. We show that this converse matches the achievability bound whenever the decoupling rate lies below a critical threshold. As a consequence, we obtain an exact characterization of the decoupling error exponent in the low-rate regime.
Abstract We prove that the entanglement cost equals the regularized entanglement of formation for any infinite-dimensional quantum state ρAB\rho _{AB}ρAB​ ρ AB with finite quantum entropy on at least one of the subsystems A or B . This generalizes a foundational result in quantum information theory that was previously formulated only for operations and states on finite-dimensional systems. The extension to infinite-dimensional systems is nontrivial because the conventional tools for establishing both the direct and converse bounds, i.e., strong typicality, monotonicity, and asymptotic continuity, are no longer directly applicable. To address this problem, we construct a new entanglement dilution protocol for infinite-dimensional states implementable by local operations and a finite amount of one-way classical communication (one-way LOCC), using weak and strong typicality multiple times. We also prove the optimality of this protocol among all protocols, even under infinite-dimensional separable operations, by developing an argument based on alternative forms of monotonicity and asymptotic continuity of the entanglement of formation for infinite-dimensional states. Along the way, we derive a new integral representation for the quantum entropy of infinite-dimensional states, which we believe to be of independent interest. Our results allow us to fully characterize an important operational entanglement measure—the entanglement cost—for all infinite-dimensional physical systems.
In this paper, we consider the standard quantum information decoupling, in which Alice aims to decouple her system from the environment by discarding some of her systems. To achieve an ε-decoupling with trace distance as the error criterion, we establish a one-shot characterization for the largest size of the remainder system in terms of the conditional (1 − ε)-hypothesis-testing entropy. When the underlying system is independent and identically prepared, our result leads to the matched second-order rate as well as the moderate deviation rate.
We consider an extension of the conditional min- and max-entropies to infinite-dimensional separable Hilbert spaces. We show that these satisfy characterizing properties known from the finite-dimensional case, and retain information-theoretic operational interpretations, e.g., the min-entropy as maximum achievable quantum correlation, and the max-entropy as decoupling accuracy. We furthermore generalize the smoothed versions of these entropies and prove an infinite-dimensional quantum asymptotic equipartition property. To facilitate these generalizations we show that the min- and max-entropy can be expressed in terms of convergent sequences of finite-dimensional min- and max-entropies, which provides a convenient technique to extend proofs from the finite to the infinite-dimensional setting.
Quantum information decoupling is an important quantum information processing task, which has found broad applications. In this paper, we characterize the performance of catalytic quantum information decoupling regarding the exponential rate under which perfect decoupling is approached, namely, the reliability function. We have obtained the exact formula when the decoupling cost is not larger than a critical value. In the situation of high cost, we provide upper and lower bounds. This result is then applied to quantum state merging and correlation erasure, exploiting their connection to decoupling. As technical tools, we derive the exponents for smoothing the conditional min-entropy and max-information, and we prove a novel bound for the convex-split lemma. Our results are given in terms of the sandwiched Renyi divergence, providing it with operational meanings in characterizing how fast the performance of quantum information tasks approach the perfect.