Tight any-shot quantum decoupling

• URL: http://arxiv.org/abs/2602.17430v1
• Date: Thu, 19 Feb 2026 15:01:26 GMT
• Title: Tight any-shot quantum decoupling
• Authors: Mario Berta, Hao-Chung Cheng, Yongsheng Yao,
• Abstract summary: We prove a novel one-shot decoupling theorem formulated in terms of quantum entropy relative distance.<n>We show that this bound is ensemble-tight in quantum relative entropy distance.
• Score: 23.729027844524893
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: 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) a single-letter expression for the exact error exponent of quantum state merging in terms of Petz-Rényi conditional entropies, and (ii) regularized expressions for the achievable error exponent 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.

Related papers

• Error exponents of quantum state discrimination with composite correlated hypotheses [40.82628972269358]
  We study the error exponents in quantum hypothesis testing between two sets of quantum states.<n>We introduce and compare two natural extensions of the quantum Hoeffding divergence and anti-divergence to sets of quantum states.
  arXiv  Detail & Related papers  (2025-08-18T13:04:06Z)
• Efficient approximation of regularized relative entropies and applications [11.59751616011475]
  We show that the regularized relative entropy can be efficiently approximated within an additive error by a quantum relative entropy program of size.<n>This applies to particular to the regularized relative entropy in adversarial quantum channel discrimination.<n>In particular, when the set of interest does not directly satisfy the required structural assumptions, it can be relaxed to one that does.
  arXiv  Detail & Related papers  (2025-02-21T18:29:45Z)
• Generalized quantum asymptotic equipartition [11.59751616011475]
  AEP states that in the limit of a large number of independent and identically distributed (i.i.d.) random experiments, the output sequence is virtually certain to come from the typical set.<n>We prove a generalized quantum AEP beyond the i.i.d. framework where the random samples are drawn from two sets of quantum states.<n>We propose a new framework for quantum resource theory in which state transformations are performed without requiring precise characterization of the states being manipulated.
  arXiv  Detail & Related papers  (2024-11-06T16:33:16Z)
• Joint State-Channel Decoupling and One-Shot Quantum Coding Theorem [16.05946478325466]
  We propose a joint state-channel decoupling approach to obtain a one-shot error exponent bound without smoothing. We establish a one-shot error exponent bound for quantum channel coding given by a sandwiched R'enyi coherent information.
  arXiv  Detail & Related papers  (2024-09-23T15:59:16Z)
• Characterizing randomness in parameterized quantum circuits through expressibility and average entanglement [39.58317527488534]
  Quantum Circuits (PQCs) are still not fully understood outside the scope of their principal application.<n>We analyse the generation of random states in PQCs under restrictions on the qubits connectivities.<n>We place a connection between how steep is the increase on the uniformity of the distribution of the generated states and the generation of entanglement.
  arXiv  Detail & Related papers  (2024-05-03T17:32:55Z)
• Normal quantum channels and Markovian correlated two-qubit quantum errors [77.34726150561087]
  We study general normally'' distributed random unitary transformations. On the one hand, a normal distribution induces a unital quantum channel. On the other hand, the diffusive random walk defines a unital quantum process.
  arXiv  Detail & Related papers  (2023-07-25T15:33:28Z)
• Quantum process tomography of continuous-variable gates using coherent states [49.299443295581064]
  We demonstrate the use of coherent-state quantum process tomography (csQPT) for a bosonic-mode superconducting circuit. We show results for this method by characterizing a logical quantum gate constructed using displacement and SNAP operations on an encoded qubit.
  arXiv  Detail & Related papers  (2023-03-02T18:08:08Z)
• Integral formula for quantum relative entropy implies data processing inequality [0.0]
  We prove the monotonicity of quantum relative entropy under trace-preserving positive linear maps. For a simple application of such monotonicities, we consider any divergence' that is non-increasing under quantum measurements. An argument due to Hiai, Ohya, and Tsukada is used to show that the infimum of such a divergence' on pairs of quantum states with prescribed trace distance is the same as the corresponding infimum on pairs of binary classical states.
  arXiv  Detail & Related papers  (2022-08-25T16:32:02Z)
• Convergence conditions for the quantum relative entropy and other applications of the deneralized quantum Dini lemma [0.0]
  We prove two general dominated convergence theorems and the theorem about preserving local continuity under convex mixtures. A simple convergence criterion for the von Neumann entropy is also obtained.
  arXiv  Detail & Related papers  (2022-05-18T17:55:36Z)
• Improved Quantum Algorithms for Fidelity Estimation [77.34726150561087]
  We develop new and efficient quantum algorithms for fidelity estimation with provable performance guarantees. Our algorithms use advanced quantum linear algebra techniques, such as the quantum singular value transformation. We prove that fidelity estimation to any non-trivial constant additive accuracy is hard in general.
  arXiv  Detail & Related papers  (2022-03-30T02:02:16Z)
• Tight Exponential Analysis for Smoothing the Max-Relative Entropy and for Quantum Privacy Amplification [56.61325554836984]
  The max-relative entropy together with its smoothed version is a basic tool in quantum information theory. We derive the exact exponent for the decay of the small modification of the quantum state in smoothing the max-relative entropy based on purified distance.
  arXiv  Detail & Related papers  (2021-11-01T16:35:41Z)
• Direct Quantum Communications in the Presence of Realistic Noisy Entanglement [69.25543534545538]
  We propose a novel quantum communication scheme relying on realistic noisy pre-shared entanglement. Our performance analysis shows that the proposed scheme offers competitive QBER, yield, and goodput.
  arXiv  Detail & Related papers  (2020-12-22T13:06:12Z)
• Quantum Statistical Complexity Measure as a Signalling of Correlation Transitions [55.41644538483948]
  We introduce a quantum version for the statistical complexity measure, in the context of quantum information theory, and use it as a signalling function of quantum order-disorder transitions. We apply our measure to two exactly solvable Hamiltonian models, namely: the $1D$-Quantum Ising Model and the Heisenberg XXZ spin-$1/2$ chain. We also compute this measure for one-qubit and two-qubit reduced states for the considered models, and analyse its behaviour across its quantum phase transitions for finite system sizes as well as in the thermodynamic limit by using Bethe ansatz.
  arXiv  Detail & Related papers  (2020-02-05T00:45:21Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.