Position-based coding and convex splitting for private communication over quantum channels

DOI10.1007/S11128-017-1718-4zbMATH Open1387.81199arXiv1703.01733OpenAlexW2593939157WikidataQ59832385 ScholiaQ59832385MaRDI QIDQ1702253FDOQ1702253

Authors: Mark M. Wilde 

Publication date: 28 February 2018

Published in: Quantum Information Processing (Search for Journal in Brave)

Abstract: The classical-input quantum-output (cq) wiretap channel is a communication model involving a classical sender $X$, a legitimate quantum receiver $B$, and a quantum eavesdropper $E$. The goal of a private communication protocol that uses such a channel is for the sender $X$ to transmit a message in such a way that the legitimate receiver $B$ can decode it reliably, while the eavesdropper $E$ learns essentially nothing about which message was transmitted. The $varepsilon$-one-shot private capacity of a cq wiretap channel is equal to the maximum number of bits that can be transmitted over the channel, such that the privacy error is no larger than $varepsilonin(0,1)$. The present paper provides a lower bound on the $varepsilon$-one-shot private classical capacity, by exploiting the recently developed techniques of Anshu, Devabathini, Jain, and Warsi, called position-based coding and convex splitting. The lower bound is equal to a difference of the hypothesis testing mutual information between $X$ and $B$ and the "alternate" smooth max-information between $X$ and $E$. The one-shot lower bound then leads to a non-trivial lower bound on the second-order coding rate for private classical communication over a memoryless cq wiretap channel.

Full work available at URL: https://arxiv.org/abs/1703.01733

Recommendations

• Quantum privacy and quantum wiretap channels
• Applications of position-based coding to classical communication over quantum channels
• Universal coding for transmission of private information
• Secure coding for type II quantum wiretap channel
• On the near-optimality of one-shot classical communication over quantum channels

zbMATH Keywords

private classical communicationhypothesis testing mutual informationquantum wiretap channelsecond-order coding ratesmooth MAX-mutual information

Mathematics Subject Classification ID

Cryptography (94A60) Quantum coding (general) (81P70) Quantum cryptography (quantum-theoretic aspects) (81P94) Channel models (including quantum) in information and communication theory (94A40)

Cites Work

• Quantum cryptography: public key distribution and coin tossing
• The transition probability in the state space of a \(^*\)-algebra
• Second-order asymptotics for quantum hypothesis testing
• The Private Classical Capacity and Quantum Capacity of a Quantum Channel
• A Fully Quantum Asymptotic Equipartition Property
• Min- and Max-Relative Entropies and a New Entanglement Monotone
• Second-order asymptotics for the classical capacity of image-additive quantum channels
• On the second-order asymptotics for entanglement-assisted communication
• Title not available (Why is that?)
• General formulas for capacity of classical-quantum channels
• Broadcast channels with confidential messages
• Channel Coding Rate in the Finite Blocklength Regime
• A Hierarchy of Information Quantities for Finite Block Length Analysis of Quantum Tasks
• Conditional expectation in an operator algebra. IV. Entropy and information
• Second-Order Asymptotics for Source Coding, Dense Coding, and Pure-State Entanglement Conversions
• The Wire-Tap Channel
• Quantum privacy and quantum wiretap channels
• General Paradigm for Distilling Classical Key From Quantum States
• Converse Bounds for Private Communication Over Quantum Channels
• Noisy Channel Coding via Privacy Amplification and Information Reconciliation
• The Quantum Capacity of Channels With Arbitrarily Correlated Noise
• Quantum continuous variables. A primer of theoretical methods
• Decoding quantum information via the Petz recovery map
• An upper bound on the second order asymptotic expansion for the quantum communication cost of state redistribution
• General nonasymptotic and asymptotic formulas in channel resolvability and identification capacity and their application to the wiretap channel
• Energy-Constrained Private and Quantum Capacities of Quantum Channels
• Tight Exponential Analysis of Universally Composable Privacy Amplification and Its Applications

Cited In (9)

• Universal superposition codes: capacity regions of compound quantum broadcast channel with confidential messages
• Secure coding for type II quantum wiretap channel
• Union bound for quantum information processing
• Universal coding for transmission of private information
• Efficient quantum private communication based on dynamic control code sequence
• Entanglement-assisted private communication over quantum broadcast channels
• Applications of position-based coding to classical communication over quantum channels
• Classical capacities of memoryless but not identical quantum channels
• On the near-optimality of one-shot classical communication over quantum channels

This page was built for publication: Position-based coding and convex splitting for private communication over quantum channels

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1702253)