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:2304.12114 · Communications in Mathematical Physics

Decoupling by Local Random Unitaries without Simultaneous Smoothing, and Applications to Multi-user Quantum Information Tasks

Pau Colomer, Andreas Winter

Published Nov 6, 2024• 20 citations
arXivHTMLPDF

Abstract

Abstract We show that a simple telescoping sum trick, together with the triangle inequality and a tensorisation property of expected-contractive coefficients of random channels, allow us to achieve general simultaneous decoupling for multiple users via local actions. Employing both old (Dupuis et al. in Commun Math Phys 328:251–284, 2014) and new methods (Dupuis in IEEE Trans Inf Theory 69:7784–7792, 2023), we obtain bounds on the expected deviation from ideal decoupling either in the one-shot setting in terms of smooth min-entropies, or the finite block length setting in terms of Rényi entropies. These bounds are essentially optimal without the need to address the simultaneous smoothing conjecture, which remains unresolved. This leads to one-shot, finite block length, and asymptotic achievability results for several tasks in quantum Shannon theory, including local randomness extraction of multiple parties, multi-party assisted entanglement concentration, multi-party quantum state merging, and quantum coding for the quantum multiple access channel. Because of the one-shot nature of our protocols, we obtain achievability results without the need for time-sharing, which at the same time leads to easy proofs of the asymptotic coding theorems. We show that our one-shot decoupling bounds furthermore yield achievable rates (so far only conjectured) for all four tasks in compound settings, which are additionally optimal for entanglement of assistance and state merging.

DOI
10.1007/s00220-024-05156-7

Related papers

One-shot multi-sender decoupling and simultaneous decoding for the quantum MAC

Chakraborty, Sayantan, Aditya Nema, Sen, Pranab

In this work, we prove a novel one-shot multi-sender decoupling theorem generalising Dupuis result. We start off with a multipartite quantum state, say on A1 A2 R, where A1, A2 are treated as the two sender systems and R is the reference system. We apply independent Haar random unitaries in tensor product on A1 and A2 and then send the resulting systems through a quantum channel. We want the channel output B to be almost in tensor with the untouched reference R. Our main result shows that this is indeed the case if suitable entropic conditions are met. An immediate application of our main result is to obtain a one-shot simultaneous decoder for sending quantum information over a k-sender entanglement unassisted quantum multiple access channel (QMAC). The rate region achieved by this decoder is the natural one-shot quantum analogue of the pentagonal classical rate region. Assuming a simultaneous smoothing conjecture, this one-shot rate region approaches the optimal rate region of Yard, Dein the asymptotic iid limit. Our work is the first one to obtain a non-trivial simultaneous decoder for the QMAC with limited entanglement assistance in both one-shot and asymptotic iid settings; previous works used unlimited entanglement assistance.

arXiv:2102.02187•Feb 3, 2021•4 citations

A multi-sender decoupling theorem and simultaneous decoding for the quantum MAC

Sayantan Chakraborty, Aditya Nema, Pranab Sen

In this work, we prove a novel one-shot ‘multi-sender’ decoupling theorem generalising Dupuis' seminal single sender decoupling theorem. We start off with a multipartite quantum state, say on$A_{1}A_{2}R$, where$A_{1}, A_{2}$are treated as the two ‘sender’ systems and$R$is the reference system. We apply independent Haar random unitaries in tensor product on$A_{1}$and$A_{2}$and then send the resulting systems through a quantum channel. We want the channel output$B$to be almost in tensor with the untouched reference$R$. Our main result shows that this is indeed the case if suitable entropic conditions are met. An immediate application of our main result is to obtain a one-shot simultaneous decoder for sending quantum information over a$k$-sender entanglement unassisted quantum multiple access channel (QMAC). The rate region achieved by this decoder is the natural one-shot quantum analogue of the pentagonal classical rate region. Assuming a simultaneous smoothing conjecture, this one-shot rate region approaches the optimal rate region of Yard et al. [20] in the asymptotic iid limit. Our work is the first one to obtain a non-trivial simultaneous decoder for the QMAC with limited entanglement assistance in both one-shot and asymptotic iid settings; previous works used unlimited entanglement assistance.

IEEE International Symposium on Information Theory (ISIT)•Jul 12, 2021•3 citations

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

Bartosz Regula, Marco Tomamichel

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ényi 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ényi 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-pharXiv:2603.04493•Mar 6, 2026•11 citations

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

Randomized Partial Decoupling Unifies One-Shot Quantum Channel Capacities

Eyuri Wakakuwa, Yoshifumi Nakata

We analyze a task in which classical and quantum messages are simultaneously communicated via a noisy quantum channel, assisted with a limited amount of shared entanglement. We derive the direct and converse bounds for the one-shot capacity region. The bounds are represented in terms of the smooth conditional entropies and the error tolerance, and coincide in the asymptotic limit of infinitely many uses of the channel. The direct and converse bounds for various communication tasks are obtained as corollaries, both for one-shot and asymptotic scenarios. The proof is based on the randomized partial decoupling theorem, which is a generalization of the decoupling theorem. Thereby we provide a unified decoupling approach to the one-shot quantum channel coding, by fully incorporating classical communication, quantum communication and shared entanglement.

•Apr 27, 2020•5 citations

One-Shot Randomized and Nonrandomized Partial Decoupling

Eyuri Wakakuwa, Yoshifumi Nakata

Abstract We introduce a task that we call partial decoupling, in which a bipartite quantum state is transformed by a unitary operation on one of the two subsystems and then is subject to the action of a quantum channel. We assume that the subsystem is decomposed into a direct-sum-product form, which often appears in the context of quantum information theory. The unitary is chosen at random from the set of unitaries having a simple form under the decomposition. The goal of the task is to make the final state, for typical choices of the unitary, close to the averaged final state over the unitaries. We consider a one-shot scenario, and derive upper and lower bounds on the average distance between the two states. The bounds are represented simply in terms of smooth conditional entropies of quantum states involving the initial state, the channel and the decomposition. Thereby we provide generalizations of the one-shot decoupling theorem. The obtained result would lead to further development of the decoupling approaches in quantum information theory and fundamental physics.

arXiv:1903.05796•Communications in Mathematical Physics•Jul 16, 2021•14 citations
Abstract We show that a simple telescoping sum trick, together with the triangle inequality and a tensorisation property of expected-contractive coefficients of random channels, allow us to achieve general simultaneous decoupling for multiple users via local actions. Employing both old (Dupuis et al. in Commun Math Phys 328:251–284, 2014) and new methods (Dupuis in IEEE Trans Inf Theory 69:7784–7792, 2023), we obtain bounds on the expected deviation from ideal decoupling either in the one-shot setting in terms of smooth min-entropies, or the finite block length setting in terms of Rényi entropies. These bounds are essentially optimal without the need to address the simultaneous smoothing conjecture, which remains unresolved. This leads to one-shot, finite block length, and asymptotic achievability results for several tasks in quantum Shannon theory, including local randomness extraction of multiple parties, multi-party assisted entanglement concentration, multi-party quantum state merging, and quantum coding for the quantum multiple access channel. Because of the one-shot nature of our protocols, we obtain achievability results without the need for time-sharing, which at the same time leads to easy proofs of the asymptotic coding theorems. We show that our one-shot decoupling bounds furthermore yield achievable rates (so far only conjectured) for all four tasks in compound settings, which are additionally optimal for entanglement of assistance and state merging.
In this work, we prove a novel one-shot multi-sender decoupling theorem generalising Dupuis result. We start off with a multipartite quantum state, say on A1 A2 R, where A1, A2 are treated as the two sender systems and R is the reference system. We apply independent Haar random unitaries in tensor product on A1 and A2 and then send the resulting systems through a quantum channel. We want the channel output B to be almost in tensor with the untouched reference R. Our main result shows that this is indeed the case if suitable entropic conditions are met. An immediate application of our main result is to obtain a one-shot simultaneous decoder for sending quantum information over a k-sender entanglement unassisted quantum multiple access channel (QMAC). The rate region achieved by this decoder is the natural one-shot quantum analogue of the pentagonal classical rate region. Assuming a simultaneous smoothing conjecture, this one-shot rate region approaches the optimal rate region of Yard, Dein the asymptotic iid limit. Our work is the first one to obtain a non-trivial simultaneous decoder for the QMAC with limited entanglement assistance in both one-shot and asymptotic iid settings; previous works used unlimited entanglement assistance.
In this work, we prove a novel one-shot ‘multi-sender’ decoupling theorem generalising Dupuis' seminal single sender decoupling theorem. We start off with a multipartite quantum state, say onA1A2RA_{1}A_{2}RA1​A2​R, whereA1,A2A_{1}, A_{2}A1​,A2​are treated as the two ‘sender’ systems andRRRis the reference system. We apply independent Haar random unitaries in tensor product onA1A_{1}A1​andA2A_{2}A2​and then send the resulting systems through a quantum channel. We want the channel outputBBBto be almost in tensor with the untouched referenceRRR. Our main result shows that this is indeed the case if suitable entropic conditions are met. An immediate application of our main result is to obtain a one-shot simultaneous decoder for sending quantum information over akkk-sender entanglement unassisted quantum multiple access channel (QMAC). The rate region achieved by this decoder is the natural one-shot quantum analogue of the pentagonal classical rate region. Assuming a simultaneous smoothing conjecture, this one-shot rate region approaches the optimal rate region of Yard et al. [20] in the asymptotic iid limit. Our work is the first one to obtain a non-trivial simultaneous decoder for the QMAC with limited entanglement assistance in both one-shot and asymptotic iid settings; previous works used unlimited entanglement assistance.
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ényi 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ényi 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.
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.
We analyze a task in which classical and quantum messages are simultaneously communicated via a noisy quantum channel, assisted with a limited amount of shared entanglement. We derive the direct and converse bounds for the one-shot capacity region. The bounds are represented in terms of the smooth conditional entropies and the error tolerance, and coincide in the asymptotic limit of infinitely many uses of the channel. The direct and converse bounds for various communication tasks are obtained as corollaries, both for one-shot and asymptotic scenarios. The proof is based on the randomized partial decoupling theorem, which is a generalization of the decoupling theorem. Thereby we provide a unified decoupling approach to the one-shot quantum channel coding, by fully incorporating classical communication, quantum communication and shared entanglement.
Abstract We introduce a task that we call partial decoupling, in which a bipartite quantum state is transformed by a unitary operation on one of the two subsystems and then is subject to the action of a quantum channel. We assume that the subsystem is decomposed into a direct-sum-product form, which often appears in the context of quantum information theory. The unitary is chosen at random from the set of unitaries having a simple form under the decomposition. The goal of the task is to make the final state, for typical choices of the unitary, close to the averaged final state over the unitaries. We consider a one-shot scenario, and derive upper and lower bounds on the average distance between the two states. The bounds are represented simply in terms of smooth conditional entropies of quantum states involving the initial state, the channel and the decomposition. Thereby we provide generalizations of the one-shot decoupling theorem. The obtained result would lead to further development of the decoupling approaches in quantum information theory and fundamental physics.