Postselected communication over quantum channels (2308.02583v3)
Abstract: The single-letter characterisation of the entanglement-assisted capacity of a quantum channel is one of the seminal results of quantum information theory. In this paper, we consider a modified communication scenario in which the receiver is allowed an additional, `inconclusive' measurement outcome, and we employ an error metric given by the error probability in decoding the transmitted message conditioned on a conclusive measurement result. We call this setting postselected communication and the ensuing highest achievable rates the postselected capacities. Here, we provide a precise single-letter characterisation of postselected capacities in the setting of entanglement assistance as well as the more general nonsignalling assistance, establishing that they are both equal to the channel's projective mutual information -- a variant of mutual information based on the Hilbert projective metric. We do so by establishing bounds on the one-shot postselected capacities, with a lower bound that makes use of a postselected teleportation-based protocol and an upper bound in terms of the postselected hypothesis testing relative entropy. As such, we obtain fundamental limits on a channel's ability to communicate even when this strong resource of postselection is allowed, implying limitations on communication even when the receiver has access to postselected closed timelike curves.
- A. S. Holevo. Bounds for the quantity of information transmitted by a quantum communication channel. Problemy Peredachi Informatsii, 9(3):3–11, 1973. (English translation: Problems of Information Transmission 9, 177 (1973)).
- C. E. Shannon. A Mathematical Theory of Communication. Bell System Technical Journal, 27:379–423, 1948.
- Elements of Information Theory. Wiley, 2006.
- A. S. Holevo. The capacity of the quantum channel with general signal states. IEEE Transactions on Information Theory, 44(1):269–273, 1998.
- B. Schumacher and M. D. Westmoreland. Sending classical information via noisy quantum channels. Physical Review A, 56:131–138, 1997.
- S. Lloyd. Capacity of the noisy quantum channel. Physical Review A, 55:1613–1622, 1997.
- P. Shor. Lecture notes. MSRI Workshop on Quantum Computation, 2002.
- I. Devetak. The private classical capacity and quantum capacity of a quantum channel. IEEE Transactions on Information Theory, 51(1):44–55, 2005.
- Mixed-state entanglement and quantum error correction. Physical Review A, 54:3824–3851, 1996.
- Entanglement-assisted classical capacity of noisy quantum channels. Physical Review Letters, 83:3081–3084, October 1999.
- Entanglement-assisted capacity of a quantum channel and the reverse Shannon theorem. IEEE Transactions on Information Theory, 48:2637–2655, 2002.
- A. S. Holevo. On entanglement-assisted classical capacity. Journal of Mathematical Physics, 43(9):4326–4333, August 2002.
- P. W. Shor. The additivity conjecture in quantum information theory. Current Developments in Mathematics, 2005:173–190, 2005.
- M. B. Hastings. Superadditivity of communication capacity using entangled inputs. Nature Physics, 5:255–257, 2009.
- Quantum communication with zero-capacity channels. Science, 321(5897):1812–1815, 2008.
- Quantum communication with Gaussian channels of zero quantum capacity. Nature Photonics, 5:624–627, 2011.
- The Quantum Reverse Shannon Theorem and Resource Tradeoffs for Simulating Quantum Channels. IEEE Transactions on Information Theory, 60:2926–2959, 2014.
- The Quantum Reverse Shannon Theorem Based on One-Shot Information Theory. Communications in Mathematical Physics, 306:579, 2011.
- Garry Bowen. Quantum feedback channels. IEEE Transactions on Information Theory, 50(10):2429–2434, 2004.
- C. E. Shannon. The zero error capacity of a noisy channel. IRE Transactions on Information Theory, 2(3):8–19, 1956.
- D. Leung and W. Matthews. On the Power of PPT-Preserving and Non-Signalling Codes. IEEE Transactions on Information Theory, 61:4486–4499, 2015.
- No-Signalling-Assisted Zero-Error Capacity of Quantum Channels and an Information Theoretic Interpretation of the Lovász Number. IEEE Transactions on Information Theory, 62:891–914, 2016.
- Masahito Hayashi. Quantum Information Theory: Mathematical Foundation. Springer, 2nd edition, 2017.
- Mark M. Wilde. Quantum Information Theory. Cambridge University Press, Cambridge, 2nd edition, 2017.
- John Watrous. The Theory of Quantum Information. Cambridge University Press, Cambridge, 2018.
- Alexander S. Holevo. Quantum Systems, Channels, Information: A Mathematical Introduction. de Gruyter, second edition, 2019.
- Principles of Quantum Communication Theory: A Modern Approach. arXiv:2011.04672.
- Postselected quantum hypothesis testing. IEEE Transactions on Information Theory, 2024. arXiv:2209.10550.
- G. Forney. Exponential error bounds for erasure, list, and decision feedback schemes. IEEE Transactions on Information Theory, 14(2):206–220, 1968.
- Neri Merhav. Error exponents of erasure/list decoding revisited via moments of distance enumerators. IEEE Transactions on Information Theory, 54(10):4439–4447, 2008.
- Vincent Y. F. Tan and Pierre Moulin. Second-order capacities of erasure and list decoding. In 2014 IEEE International Symposium on Information Theory, pages 1887–1891. 2014.
- Masahito Hayashi and Vincent Y. F. Tan. Asymmetric evaluations of erasure and undetected error probabilities. IEEE Transactions on Information Theory, 61(12):6560–6577, 2015.
- I. D. Ivanovic. How to differentiate between non-orthogonal states. Physics Letters A, 123:257–259, 1987.
- D. Dieks. Overlap and distinguishability of quantum states. Physics Letters A, 126:303–306, 1988.
- Asher Peres. How to differentiate between non-orthogonal states. Physics Letters A, 128:19, 1988.
- Strategies for discriminating between non-orthogonal quantum states. Journal of Modern Optics, 45:1295–1302, 1998.
- Optimal discrimination of mixed quantum states involving inconclusive results. Physical Review A, 67:012321, 2003.
- Unambiguous discrimination of mixed states. Physical Review A, 68:010301, 2003.
- Maximum Confidence Quantum Measurements. Physical Review Letters, 96:070401, 2006.
- Optimum unambiguous discrimination of two mixed quantum states. Physical Review A, 71:050301, 2005.
- Ulrike Herzog. Discrimination of two mixed quantum states with maximum confidence and minimum probability of inconclusive results. Physical Review A, 79:032323, 2009.
- Scott Aaronson. Quantum computing, postselection, and probabilistic polynomial-time. Proceedings of the Royal Society A, 461:3473–3482, 2005.
- Jaromír Fiurášek. Optimal probabilistic estimation of quantum states. New Journal of Physics, 8:192–192, 2006.
- Beating noise with abstention in state estimation. New Journal of Physics, 14:105015, 2012.
- Quantum limits on postselected, probabilistic quantum metrology. Physical Review A, 89:052117, 2014.
- Cost of postselection in decision theory. Physical Review A, 92:022117, 2015.
- Quantum advantage in postselected metrology. Nature Communications, 11:3775, 2020.
- N. Gisin. Hidden quantum nonlocality revealed by local filters. Physics Letters A, 210:151–156, 1996.
- Adrian Kent. Entangled Mixed States and Local Purification. Physical Review Letters, 81:2839–2841, 1998.
- General teleportation channel, singlet fraction, and quasidistillation. Physical Review A, 60:1888–1898, 1999.
- Hilbert’s projective metric in quantum information theory. Journal of Mathematical Physics, 52:082201, 2011.
- Bartosz Regula. Probabilistic Transformations of Quantum Resources. Physical Review Letters, 128:110505, 2022.
- Bartosz Regula. Tight constraints on probabilistic convertibility of quantum states. Quantum, 6:817, 2022.
- Closed Timelike Curves via Postselection: Theory and Experimental Test of Consistency. Physical Review Letters, 106:040403, 2011.
- Quantum mechanics of time travel through post-selected teleportation. Physical Review D, 84(2):025007, July 2011.
- Perfect State Distinguishability and Computational Speedups with Postselected Closed Timelike Curves. Foundations of Physics, 42:341–361, 2012.
- Quantum computational supremacy. Nature, 549:203–209, 2017.
- N. Datta. Min- and Max-Relative Entropies and a New Entanglement Monotone. IEEE Transactions on Information Theory, 55:2816–2826, 2009.
- Quantum hypothesis testing and the operational interpretation of the quantum Rényi relative entropies. Communications in Mathematical Physics, 334(3):1617–1648, September 2015.
- Approaches for approximate additivity of the Holevo information of quantum channels. Physical Review A, 97:012332, January 2018.
- Using and reusing coherence to realize quantum processes. Quantum, 2:100, 2018.
- Amortized channel divergence for asymptotic quantum channel discrimination. Letters in Mathematical Physics, 110:2277–2336, 2020.
- P. J. Bushell. Hilbert’s metric and positive contraction mappings in a Banach space. Archive for Rational Mechanics and Analysis, 52:330–338, 1973.
- Transforming quantum operations: Quantum supermaps. EPL (Europhysics Letters), 83:30004, 2008.
- Necessary and sufficient conditions on measurements of quantum channels. Proceedings of the Royal Society A, 476:20190832, 2020.
- Sergey N. Filippov. Capacity of trace decreasing quantum operations and superadditivity of coherent information for a generalized erasure channel. Journal of Physics A: Mathematical and Theoretical, 54(25):255301, May 2021.
- Sergey N. Filippov. Multipartite entanglement to boost superadditivity of coherent information in quantum communication lines with polarization-dependent losses. Physical Review A, 105:062606, June 2022.
- Quantum Channel Simulation and the Channel’s Smooth Max-Information. IEEE Transactions on Information Theory, 66:2129–2140, 2020.
- Application of the Resource Theory of Channels to Communication Scenarios. Physical Review Letters, 124:120502, 2020.
- Gilad Gour. Comparison of Quantum Channels by Superchannels. IEEE Transactions on Information Theory, 65:5880–5904, 2019.
- Quantum resource theories. Reviews of Modern Physics, 91:025001, 2019.
- Peter W. Shor. Quantum Information, Statistics, Probability (Dedicated to A. S. Holevo on the occasion of his 60th birthday), chapter The classical capacity achievable by a quantum channel assisted by limited entanglement, pages 144–152. Rinton Press, 2004.
- Entanglement-assisted capacity of quantum multiple-access channels. IEEE Transactions on Information Theory, 54(7):3078–3090, July 2008. arXiv:quant-ph/0511228.
- Building blocks for communication over noisy quantum networks. IEEE Transactions on Information Theory, 65(2):1287–1306, 2019.
- Applications of position-based coding to classical communication over quantum channels. Journal of Physics A: Mathematical and Theoretical, 51(44):444002, October 2018.
- Communication via one- and two-particle operators on Einstein-Podolsky-Rosen states. Physical Review Letters, 69:2881–2884, 1992.
- On the second-order asymptotics for entanglement-assisted communication. Quantum Information Processing, 15(6):2569–2591, March 2016.
- Second-order coding rates for key distillation in quantum key distribution. October 2019. arXiv:1910.03883.
- On feedback and the classical capacity of a noisy quantum channel. IEEE Transactions on Information Theory, 51:320–324, January 2005.
- Strong converse for the feedback-assisted classical capacity of entanglement-breaking channels. Problems of Information Transmission, 54:1–19, 2018.
- Strong Converse Exponents for a Quantum Channel Discrimination Problem and Quantum-Feedback-Assisted Communication. Communications in Mathematical Physics, 344:797–829, 2016.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.