On the Power of PPT-Preserving and Non-Signalling Codes

@article{Leung2015OnTP,
  title={On the Power of PPT-Preserving and Non-Signalling Codes},
  author={Debbie Leung and William Matthews},
  journal={IEEE Transactions on Information Theory},
  year={2015},
  volume={61},
  pages={4486-4499}
}
  • Debbie Leung, William Matthews
  • Published 2015
  • Computer Science, Physics, Mathematics
  • IEEE Transactions on Information Theory
  • We derive one-shot upper bounds for quantum noisy channel codes. We do so by regarding a channel code as a bipartite operation with an encoder belonging to the sender and a decoder belonging to the receiver, and imposing constraints on the bipartite operation. We investigate the power of codes whose bipartite operation is non-signalling from Alice to Bob, positive-partial transpose (PPT) preserving, or both, and derive a simple semidefinite program for the achievable entanglement fidelity… CONTINUE READING

    Paper Mentions

    BLOG POST
    BLOG POST

    Citations

    Publications citing this paper.
    SHOWING 1-10 OF 40 CITATIONS

    Semidefinite Programming Strong Converse Bounds for Classical Capacity

    VIEW 9 EXCERPTS
    CITES BACKGROUND & METHODS
    HIGHLY INFLUENCED

    A semidefinite programming upper bound of quantum capacity

    • Xin Wang, Runyao Duan
    • Computer Science, Physics, Mathematics
    • 2016 IEEE International Symposium on Information Theory (ISIT)
    • 2016
    VIEW 4 EXCERPTS
    CITES BACKGROUND
    HIGHLY INFLUENCED

    Semidefinite programming converse bounds for classical communication over quantum channels

    VIEW 7 EXCERPTS
    CITES BACKGROUND & METHODS
    HIGHLY INFLUENCED

    A Minimax Converse for Quantum Channel Coding

    VIEW 7 EXCERPTS
    CITES METHODS
    HIGHLY INFLUENCED

    Converse Bounds for Classical Communication Over Quantum Broadcast Channels and Quantum Multi-Access Channels

    • Wei Xie, Xin Wang, Runyao Duan
    • Computer Science
    • 2018 IEEE International Symposium on Information Theory (ISIT)
    • 2018
    VIEW 3 EXCERPTS
    CITES BACKGROUND & METHODS

    Semidefinite Programming Converse Bounds for Quantum Communication

    • Xin Wang, Kun Fang, Runyao Duan
    • Computer Science, Mathematics, Physics
    • IEEE Transactions on Information Theory
    • 2019
    VIEW 4 EXCERPTS
    CITES BACKGROUND & METHODS
    HIGHLY INFLUENCED

    Quantum Channel Simulation and the Channel's Smooth Max-Information

    VIEW 1 EXCERPT
    CITES BACKGROUND

    FILTER CITATIONS BY YEAR

    2015
    2020

    CITATION STATISTICS

    • 5 Highly Influenced Citations

    • Averaged 8 Citations per year from 2018 through 2020

    References

    Publications referenced by this paper.
    SHOWING 1-10 OF 66 REFERENCES

    Finite Blocklength Converse Bounds for Quantum Channels

    VIEW 6 EXCERPTS

    One-Shot Entanglement-Assisted Quantum and Classical Communication

    VIEW 2 EXCERPTS

    Noisy Channel Coding via Privacy Amplification and Information Reconciliation

    VIEW 4 EXCERPTS
    HIGHLY INFLUENTIAL

    Mixed-state entanglement and quantum error correction.

    A semidefinite program for distillable entanglement

    • Eric M. Rains
    • Mathematics, Physics, Computer Science
    • IEEE Trans. Inf. Theory
    • 2001
    VIEW 4 EXCERPTS
    HIGHLY INFLUENTIAL

    The private classical capacity and quantum capacity of a quantum channel

    • Igor Devetak
    • Mathematics, Computer Science, Physics
    • IEEE Transactions on Information Theory
    • 2005
    VIEW 4 EXCERPTS
    HIGHLY INFLUENTIAL