While the ultimate limits on the rate of quantum communication over noisy channels are well-established, very few efficient coding schemes achieving these limits are known. This contrasts sharply with transmitting classical data over classical channels, where polar codes and low-density parity-check codes both efficiently achieve the classical capacity of any noisy channel. In this work we construct an efficient entanglement generation scheme which achieves the coherent information for a broad class of channels. For degradable channels in the class, which includes truncated versions of the pure loss Bosonic channel, the resulting scheme achieves the quantum capacity. The construction makes use of polar codes for two kinds of classical-input, quantum-output (CQ) channels: those with commuting outputs and those whose outputs are heralded mixtures of pure states. The former case is amenable to decoding by classical polar decoding algorithms, the latter by the belief propagation with quantum messages (BPQM) algorithm. To our knowledge, this construction is the first explicit and efficiently decodable protocol that achieves the energy-constrained quantum capacity of the pure-loss Bosonic channel.
This work presents an entanglement-assisted encoding and decoding strategy that yields a channel with higher worst-case fidelity than all of the given channels, and is universal, in the sense that the improvement holds regardless of what channels are given.
This paper reports the proof of a strong converse for the unconstrained quantum capacity of the pure-loss bosonic channel. At every fixed rate above capacity, the entanglement-generation fidelity of every code is bounded by a constant times the reciprocal of the number of channel uses. The bound holds without an energy...
A quantum channel can transmit quantum states, classical messages, or classical messages that remain secret from its environment. We prove exponential strong converses for all three tasks over arbitrary finite-dimensional memoryless quantum channels, at their respective regularized capacities and allowing arbitrary ent...
Determining a noisy quantum channel's classical capacity and entanglement cost generally requires regularization over many channel uses. We remove both regularizations for every qubit-to-qubit channel admitting a pure output. For each such channel, Holevo information, channel entanglement of formation, and parallel ent...
Ziao Tang, Cheng-Kai Zhu, Ge Bai et al.· 3 citations· ⚡2
The classical capacity of a noisy optical channel is the maximum rate at which information can be transmitted reliably, given a constraint on the mean input energy. For the ubiquitous bosonic Gaussian channels, which include standard models of loss and noise in fibre and free-space optical links, determining this rate...
G. Adesso, Ludovico Lami, V. Giovannetti· 0 citations
Entanglement distillation from noisy bipartite states and reliable quantum communication over noisy channels are fundamental tasks in quantum information theory, yet optimal coding schemes typically rely on prior knowledge of the underlying state or channel. Here, through Schur-Weyl duality, we establish a universal qu...
Jacopo Rizzo, Ludovico Lami, Jens Eisert et al.· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.