Joint State-Channel Decoupling and One-Shot Quantum Coding Theorem

• URL: http://arxiv.org/abs/2409.15149v1
• Date: Mon, 23 Sep 2024 15:59:16 GMT
• Title: Joint State-Channel Decoupling and One-Shot Quantum Coding Theorem
• Authors: Hao-Chung Cheng, Frédéric Dupuis, Li Gao,
• Abstract summary: 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.
• Score: 16.05946478325466
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: In this work, we consider decoupling a bipartite quantum state via a general quantum channel. We propose a joint state-channel decoupling approach to obtain a one-shot error exponent bound without smoothing, in which trace distance is used to measure how good the decoupling is. The established exponent is expressed in terms of a sum of two sandwiched R{\'e}nyi entropies, one quantifying the amount of initial correlation between the state and environment, while the other characterizing the effectiveness of the quantum channel. This gives an explicit exponential decay of the decoupling error in the whole achievable region, which was missing in the previous results [Commun. Math. Phys. 328, 2014]. Moreover, it strengthens the error exponent bound obtained in a recent work [IEEE Trans. Inf. Theory, 69(12), 2023], for exponent from the channel part. As an application, we establish a one-shot error exponent bound for quantum channel coding given by a sandwiched R\'enyi coherent information.

Related papers

• A Lie Algebraic Theory of Barren Plateaus for Deep Parameterized Quantum Circuits [37.84307089310829]
  Variational quantum computing schemes train a loss function by sending an initial state through a parametrized quantum circuit. Despite their promise, the trainability of these algorithms is hindered by barren plateaus. We present a general Lie algebra that provides an exact expression for the variance of the loss function of sufficiently deep parametrized quantum circuits.
  arXiv  Detail & Related papers  (2023-09-17T18:14:10Z)
• 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 soft-covering lemma with applications to rate-distortion coding, resolvability and identification via quantum channels [7.874708385247353]
  We prove a one-shot quantum covering lemma in terms of smooth min-entropies. We provide new upper bounds on the unrestricted and simultaneous identification capacities of quantum channels.
  arXiv  Detail & Related papers  (2023-06-21T17:53:22Z)
• Tight One-Shot Analysis for Convex Splitting with Applications in Quantum Information Theory [23.18400586573435]
  We establish a one-shot error exponent and a one-shot strong converse for convex splitting with trace distance as an error criterion. This leads to new one-shot exponent results in various tasks such as communication over quantum wiretap channels, secret key distillation, one-way quantum message compression, quantum measurement simulation, and quantum channel coding with side information at the transmitter.
  arXiv  Detail & Related papers  (2023-04-24T12:47:37Z)
• Fidelity-based distance bounds for $N$-qubit approximate quantum error correction [0.0]
  Eastin-Knill theorem states that a quantum code cannot correct errors exactly, possess continuous symmetries, and implement a universal set of gates transversely. It is common to employ a complementary measure of fidelity as a way to quantify quantum state distinguishability and benchmark approximations in error correction. We address two distance measures based on the sub- and superfidelities as a way to bound error approximations, which in turn require a lower computational cost.
  arXiv  Detail & Related papers  (2022-12-08T16:10:58Z)
• Noise effects on purity and quantum entanglement in terms of physical implementability [27.426057220671336]
  Quantum decoherence due to imperfect manipulation of quantum devices is a key issue in the noisy intermediate-scale quantum (NISQ) era. Standard analyses in quantum information and quantum computation use error rates to parameterize quantum noise channels. We propose to characterize the decoherence effect of a noise channel by the physical implementability of its inverse.
  arXiv  Detail & Related papers  (2022-07-04T13:35:17Z)
• 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)
• Reliable Simulation of Quantum Channels: the Error Exponent [5.8303977553652]
  We study the error exponent of quantum channel simulation, which characterizes the optimal speed of exponential convergence. We obtain an achievability bound for quantum channel simulation in the finite-blocklength setting.
  arXiv  Detail & Related papers  (2021-12-08T18:55:54Z)
• Stochastic approximate state conversion for entanglement and general quantum resource theories [41.94295877935867]
  An important problem in any quantum resource theory is to determine how quantum states can be converted into each other. Very few results have been presented on the intermediate regime between probabilistic and approximate transformations. We show that these bounds imply an upper bound on the rates for various classes of states under probabilistic transformations. We also show that the deterministic version of the single copy bounds can be applied for drawing limitations on the manipulation of quantum channels.
  arXiv  Detail & Related papers  (2021-11-24T17:29:43Z)
• 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)
• One-Shot Triple-Resource Trade-Off in Quantum Channel Coding [9.137554315375919]
  We analyze a task in which classical and quantum messages are simultaneously communicated via a noisy quantum channel. We derive direct and converse bounds for the one-shot capacity region, represented by the smooth conditional entropies and the error tolerance.
  arXiv  Detail & Related papers  (2020-04-27T06:20:10Z)

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.