• Home
  • Search
  • Quantum soft-covering lemma with applications to rate-distortion coding, resolvability and identification via quantum channels
  • Cite Icon10
  • https://doi.org/10.1142/s0219749924400136Copy DOI Icon

Quantum soft-covering lemma with applications to rate-distortion coding, resolvability and identification via quantum channels

Show More
  • Abstract
  • Literature Map
  • References
  • Citations
  • Similar Papers
Abstract

We propose a quantum soft-covering problem for a given general quantum channel and one of its output states, which consists in finding the minimum rank of an input state needed to approximate the given channel output. We then prove a one-shot quantum covering lemma in terms of smooth min-entropies by leveraging decoupling techniques from quantum Shannon theory. This covering result is shown to be equivalent to a coding theorem for rate distortion under a posterior (reverse) channel distortion criterion by two of the present authors. Both one-shot results directly yield corollaries about the i.i.d. asymptotics, in terms of the coherent information of the channel. The power of our quantum covering lemma is demonstrated by two additional applications: first, we formulate a quantum channel resolvability problem, and provide one-shot as well as asymptotic upper and lower bounds. Second, we provide new upper bounds on the unrestricted and simultaneous identification capacities of quantum channels, in particular separating for the first time the simultaneous identification capacity from the unrestricted one, proving a long-standing conjecture of the last author.

Similar Papers
  • Book Chapter

The Packing Lemma

  • Apr 18, 2013
  • Mark M Wilde
  • Research Article
  • Citations3

Quantum channel capacity by simulated annealing

  • Apr 05, 2005
  • Physical Review A
  • Frederick H Willeboordse +2
  • Research Article
  • Citations29

Control power of high-dimensional controlled dense coding

  • May 12, 2022
  • Physical Review A
  • Wen-Xin Duan +1
  • Research Article
  • Citations16

Complexity and Capacity Bounds for Quantum Channels

  • Oct 01, 2018
  • IEEE Transactions on Information Theory
  • Rupert H Levene +2
  • Research Article
  • Citations10

Unified-entropy trade-off relations for a single quantum channel

  • Jun 27, 2013
  • Journal of Physics A: Mathematical and Theoretical
  • Alexey E Rastegin
  • Research Article
  • Citations1

The use of the output states generated by the broadcasting of entanglement in quantum teleportation

  • May 22, 2023
  • Physics Letters A
  • Iulia Ghiu +2
  • Conference Article
  • Citations4

Quantum channel capacity for OAM-based free-space optical communications

  • Oct 15, 2012
  • Proceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIE
  • Ivan B Djordjevic +2
  • Research Article
  • Citations9

High dimensional quantum network coding based on prediction mechanism over the butterfly network

  • Nov 11, 2021
  • Quantum Science & Technology
  • Xingbo Pan +4
  • PDF
  • Research Article
  • Citations4

Tensorization of the strong data processing inequality for quantum chi-square divergences

  • Oct 28, 2019
  • Quantum
  • Yu Cao +1
  • Research Article
  • Citations53

Private and quantum capacities of more capable and less noisy quantum channels

  • Jan 24, 2012
  • Physical Review A
  • Shun Watanabe
  • Conference Article

Classical Capacity Regions for Generalized Pauli Channels

  • Oct 20, 2021
  • Junaid Ur Rehman +2
  • Research Article
  • Citations3

Influence of surge movement in non-uniform water flow on performance of underwater quantum communication

  • Jan 01, 2018
  • Acta Physica Sinica
  • Nie Min +6
  • Research Article
  • Citations15

Classical capacity of quantum channels with memory

  • Mar 17, 2009
  • Physical Review A
  • Tony Dorlas +1
  • Research Article
  • Citations63

Quantum Capacity under Adversarial Quantum Noise: Arbitrarily Varying Quantum Channels

  • Nov 20, 2012
  • Communications in Mathematical Physics
  • Rudolf Ahlswede +3
  • Research Article
  • Citations11

Uniform finite-dimensional approximation of basic capacities of energy-constrained channels

  • Oct 15, 2018
  • Quantum Information Processing
  • M E Shirokov
Cactus Communications logo

Copyright 2026 Cactus Communications. All rights reserved.