Error Exponent and Strong Converse for Quantum Soft Covering

• URL: http://arxiv.org/abs/2202.10995v1
• Date: Tue, 22 Feb 2022 15:57:16 GMT
• Title: Error Exponent and Strong Converse for Quantum Soft Covering
• Authors: Hao-Chung Cheng, Li Gao
• Abstract summary: We use a random codebook with codewords independently sampled from a prior distribution to approximate the target state. When the rate of the codebook size is below the quantum mutual information, the trace distance converges to one exponentially fast. That is, we show that even when the rate of the codebook size approaches the quantum mutual information moderately quickly, the trace distance still vanishes.
• Score: 23.18400586573435
• License: http://creativecommons.org/publicdomain/zero/1.0/
• Abstract: How well can we approximate a quantum channel output state using a random codebook with a certain size? In this work, we study the quantum soft covering problem. Namely, we use a random codebook with codewords independently sampled from a prior distribution and send it through a classical-quantum channel to approximate the target state. When using a random codebook sampled from an independent and identically distributed prior with a rate above the quantum mutual information, we show that the expected trace distance between the codebook-induced state and the target state decays with exponent given by the sandwiched R\'enyi information. On the other hand, when the rate of the codebook size is below the quantum mutual information, the trace distance converges to one exponentially fast. We obtain similar results when using a random constant composition codebook, whereas the sandwiched Augustin information expresses the error exponent. In addition to the above large deviation analysis, our results also hold in the moderate deviation regime. That is, we show that even when the rate of the codebook size approaches the quantum mutual information moderately quickly, the trace distance still vanishes asymptotically.

Related papers

• On estimates of trace-norm distance between quantum Gaussian states [0.0]
  Estimates for the trace-norm distance between two quantum Gaussian states in terms of the mean vectors and covariance matrices were derived. In the present paper we obtain different estimates; our proof is based on a fidelity-like quantity which we call states overlap. They do not depend on number of modes and hence can be extended to the case of bosonic field with infinite number of modes.
  arXiv  Detail & Related papers  (2024-08-21T07:51:49Z)
• 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)
• Importance sampling for stochastic quantum simulations [68.8204255655161]
  We introduce the qDrift protocol, which builds random product formulas by sampling from the Hamiltonian according to the coefficients. We show that the simulation cost can be reduced while achieving the same accuracy, by considering the individual simulation cost during the sampling stage. Results are confirmed by numerical simulations performed on a lattice nuclear effective field theory.
  arXiv  Detail & Related papers  (2022-12-12T15:06:32Z)
• Optimal Second-Order Rates for Quantum Soft Covering and Privacy Amplification [19.624719072006936]
  We study quantum soft covering and privacy amplification against quantum side information. For both tasks, we use trace distance to measure the closeness between the processed state and the ideal target state. Our results extend to the moderate deviation regime, which are the optimal rates when the trace distances vanish at sub-exponential speed.
  arXiv  Detail & Related papers  (2022-02-23T16:02:31Z)
• Strong Converse for Privacy Amplification against Quantum Side Information [19.624719072006936]
  We establish a one-shot strong converse bound for privacy amplification against quantum side information using trace distance as a security criterion. The result has an application to bounding the information leakage of classical-quantum wiretap channel coding and private communication over quantum channels.
  arXiv  Detail & Related papers  (2022-02-21T14:28:01Z)
• Average-case Speedup for Product Formulas [69.68937033275746]
  Product formulas, or Trotterization, are the oldest and still remain an appealing method to simulate quantum systems. We prove that the Trotter error exhibits a qualitatively better scaling for the vast majority of input states. Our results open doors to the study of quantum algorithms in the average case.
  arXiv  Detail & Related papers  (2021-11-09T18:49:48Z)
• 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)
• Pauli channels can be estimated from syndrome measurements in quantum error correction [0.7264378254137809]
  We show that a stabilizer code can be used to estimate Pauli channels with correlations across a number of qubits given by the pure distance. It also allows for measurement errors within the framework of quantum data-syndrome codes. It is our hope that this work opens up interesting applications, such as the online adaptation of a decoder to time-varying noise.
  arXiv  Detail & Related papers  (2021-07-29T18:01:10Z)
• 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)
• Describing quantum metrology with erasure errors using weight distributions of classical codes [9.391375268580806]
  We consider using quantum probe states with a structure that corresponds to classical $[n,k,d]$ binary block codes of minimum distance. We obtain bounds on the ultimate precision that these probe states can give for estimating the unknown magnitude of a classical field.
  arXiv  Detail & Related papers  (2020-07-06T16:22:40Z)
• Jumptime unraveling of Markovian open quantum systems [68.8204255655161]
  We introduce jumptime unraveling as a distinct description of open quantum systems. quantum jump trajectories emerge, physically, from continuous quantum measurements. We demonstrate that quantum trajectories can also be ensemble-averaged at specific jump counts.
  arXiv  Detail & Related papers  (2020-01-24T09:35:32Z)

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.