Quantum Soft Covering and Decoupling with Relative Entropy Criterion

• URL: http://arxiv.org/abs/2402.11112v1
• Date: Fri, 16 Feb 2024 22:31:38 GMT
• Title: Quantum Soft Covering and Decoupling with Relative Entropy Criterion
• Authors: Xingyi He, Touheed Anwar Atif, S. Sandeep Pradhan
• Abstract summary: We prove covering lemmas by deriving one-shot bounds on the rates in terms of smooth min-entropies and smooth max-divergences. We present a one-shot quantum decoupling theorem with relative entropy criterion.
• Score: 11.987004396261241
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: We propose quantum soft covering problems for fully quantum channels and classical-quantum (CQ) channels using relative entropy as a criterion of operator closeness. We prove covering lemmas by deriving one-shot bounds on the rates in terms of smooth min-entropies and smooth max-divergences, respectively. In the asymptotic regime, we show that for quantum channels, the rate infimum defined as the logarithm of the minimum rank of the input state is the coherent information between the reference and output state; for CQ channels, the rate infimum defined as the logarithm of the minimum number of input codewords is the Helovo information between the input and output state. Furthermore, we present a one-shot quantum decoupling theorem with relative entropy criterion. Our results based on the relative-entropy criterion are tighter than the corresponding results based on the trace norm considered in the literature due to the Pinsker inequality.

Related papers

• Reducing the sampling complexity of energy estimation in quantum many-body systems using empirical variance information [45.18582668677648]
  We consider the problem of estimating the energy of a quantum state preparation for a given Hamiltonian in Pauli decomposition. We construct an adaptive estimator using the state's actual variance.
  arXiv  Detail & Related papers  (2025-02-03T19:00:01Z)
• Quantum entanglement as an extremal Kirkwood-Dirac nonreality [0.0]
  We discuss a link between quantum entanglement and the anomalous or nonclassical nonreal values of Kirkwood-Dirac (KD) quasiprobability. We first construct an entanglement monotone for a pure bipartite state based on the nonreality of the KD quasiprobability. We then construct a bipartite entanglement monotone for generic quantum states using the convex roof extension.
  arXiv  Detail & Related papers  (2025-01-07T20:53:30Z)
• Quantum Homogenization as a Quantum Steady State Protocol on NISQ Hardware [42.52549987351643]
  Quantum homogenization is a reservoir-based quantum state approximation protocol. We extend the standard quantum homogenization protocol to the dynamically-equivalent ($mathttSWAP$)$alpha$ formulation. We show that our proposed protocol yields a completely positive, trace preserving (CPTP) map under which the code subspace is correctable.
  arXiv  Detail & Related papers  (2024-12-19T05:50:54Z)
• Contraction of Private Quantum Channels and Private Quantum Hypothesis Testing [5.211732144306638]
  We study contraction coefficient for hockey-stick divergence under privacy constraints. We also show how private quantum channels provide fairness and Holevo information stability in quantum learning settings.
  arXiv  Detail & Related papers  (2024-06-26T18:00:03Z)
• 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)
• Simple and Tighter Derivation of Achievability for Classical Communication over Quantum Channels [7.88657961743755]
  In this work, we show that the pretty-good measurement naturally plays a role as the union bound as well. A judicious application of it considerably simplifies the derivation of one-shot achievability for classical-quantum (c-q) channel coding via an elegant three-line proof. The proposed method applies to deriving one-shot achievability for classical data compression with quantum side information, entanglement-assisted classical communication over quantum channels, and various quantum network information-processing protocols.
  arXiv  Detail & Related papers  (2022-08-03T15:12:01Z)
• Computable lower bounds on the entanglement cost of quantum channels [8.37609145576126]
  A class of lower bounds for the entanglement cost of any quantum state was recently introduced in [arXiv:2111.02438]. Here we extend their definitions to point-to-point quantum channels, establishing a lower bound for the quantum entanglement cost of any channel. This leads to a bound that is computable as a semidefinite program and that can outperform previously known lower bounds.
  arXiv  Detail & Related papers  (2022-01-23T13:05:36Z)
• 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)
• Shannon theory for quantum systems and beyond: information compression for fermions [68.8204255655161]
  We show that entanglement fidelity in the fermionic case is capable of evaluating the preservation of correlations. We introduce a fermionic version of the source coding theorem showing that, as in the quantum case, the von Neumann entropy is the minimal rate for which a fermionic compression scheme exists.
  arXiv  Detail & Related papers  (2021-06-09T10:19:18Z)
• Sampling Overhead Analysis of Quantum Error Mitigation: Uncoded vs. Coded Systems [69.33243249411113]
  We show that Pauli errors incur the lowest sampling overhead among a large class of realistic quantum channels. We conceive a scheme amalgamating QEM with quantum channel coding, and analyse its sampling overhead reduction compared to pure QEM.
  arXiv  Detail & Related papers  (2020-12-15T15:51:27Z)
• Using Quantum Metrological Bounds in Quantum Error Correction: A Simple Proof of the Approximate Eastin-Knill Theorem [77.34726150561087]
  We present a proof of the approximate Eastin-Knill theorem, which connects the quality of a quantum error-correcting code with its ability to achieve a universal set of logical gates. Our derivation employs powerful bounds on the quantum Fisher information in generic quantum metrological protocols.
  arXiv  Detail & Related papers  (2020-04-24T17:58: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.