English
Related papers

Related papers: Decoding quantum information via the Petz recovery…

200 papers

The calculation of the error threshold of quantum error correcting codes typically proceeds as follows. First, syndromes are measured. Then, a decoder infers the error chain and the corresponding correction is applied. The threshold is then…

Quantum Physics · Physics 2026-03-09 Sun Woo P. Kim

The quantum capacity of a memoryless channel is often used as a single figure of merit to characterize its ability to transmit quantum information coherently. The capacity determines the maximal rate at which we can code reliably over…

Quantum Physics · Physics 2016-05-10 Marco Tomamichel , Mario Berta , Joseph M. Renes

Tradeoffs between the information rate and fidelity of quantum error-correcting codes are discussed. Quantum channels to be considered are those subject to independent errors and modeled as tensor products of copies of a general completely…

Quantum Physics · Physics 2016-11-18 Mitsuru Hamada

Quantum capacity gives the fundamental limit of information transmission through a channel. However, evaluating the quantum capacities of a continuous-variable bosonic quantum channel, as well as finding an optimal code to achieve the…

Quantum Physics · Physics 2025-10-03 Adam Taylor , Michael Hanks , Hyukjoon Kwon , M. S. Kim

The Petz recovery map provides a near-optimal reversal of quantum noise, yet proposals for its implementation are only recent. We propose a physical realization of the exact state-specific Petz map in an ion trap for qubit decoherence…

Quantum Physics · Physics 2025-09-19 Wen-Han Png , Valerio Scarani

Fast quantum data transmission faces several shortcomings such as the indistinguishability of some partly overlapping signals, the channel noises, and so on. Based on the encoded quantum data transmission protocol, an unconventional scheme…

Quantum Physics · Physics 2017-08-31 Weidong Tang , Sixia Yu

Encoding schemes and error-correcting codes are widely used in information technology to improve the reliability of data transmission over real-world communication channels. Quantum information protocols can further enhance the performance…

We analyze the quantum capacity of a unital quantum channel, using ideas from the proof of near-optimality of Petz recovery map [Barnum and Knill 2000] and give an upper bound on the quantum capacity in terms of regularized output $2$-norm…

Quantum Physics · Physics 2018-03-07 Anurag Anshu

Quantum communications promises reliable transmission of quantum information, efficient distribution of entanglement and generation of completely secure keys. For all these tasks, we need to determine the optimal point-to-point rates that…

Quantum Physics · Physics 2017-04-27 Stefano Pirandola , Riccardo Laurenza , Carlo Ottaviani , Leonardo Banchi

We show that no source encoding is needed in the definition of the capacity of a quantum channel for carrying quantum information. This allows us to use the coherent information maximized over all sources and and block sizes, but not…

Quantum Physics · Physics 2011-07-19 H. Barnum , J. A. Smolin , B. M. Terhal

We demonstrate that there exists a universal, near-optimal recovery map---the transpose channel---for approximate quantum error-correcting codes, where optimality is defined using the worst-case fidelity. Using the transpose channel, we…

Quantum Physics · Physics 2013-05-29 Hui Khoon Ng , Prabha Mandayam

The quantum channel capacity gives the ultimate limit for the rate at which quantum data can be reliably transmitted through a noisy quantum channel. Degradable quantum channels are among the few channels whose quantum capacities are known.…

Quantum Physics · Physics 2011-03-31 Markus Grassl , Zhengfeng Ji , Zhaohui Wei , Bei Zeng

The optimal performance of a communication network is limited not only by the quality of point-to-point channels, but by the efficacy of its constituent technologies. Understanding the limits of quantum networks requires an understanding of…

Quantum Physics · Physics 2022-07-13 Cillian Harney , Stefano Pirandola

We show that it is possible to transmit and preserve information at short time scales over an n-fold composition of quantum channels $(\Xi^n)_{n \in \mathbb{N}}$ modelled as a discrete quantum Markov semigroup, long enough to generate…

Quantum Physics · Physics 2025-09-04 Archishna Bhattacharyya

In this thesis, we are interested in the limits of quantum communication with and without entanglement, and with and without noise assumptions on the communication setup. When a sender and a receiver are connected by a communication line…

Quantum Physics · Physics 2024-12-31 Paula Belzig

We establish that, in an appropriate limit, qubits of communication should be regarded as composite resources, decomposing cleanly into independent correlation and transmission components. Because qubits of communication can establish ebits…

Quantum Physics · Physics 2020-08-12 Patrick Hayden , Geoffrey Penington

Transmitting data reliably over noisy communication channels is one of the most important applications of information theory, and well understood when the channel is accurately modelled by classical physics. However, when quantum effects…

In analogy with its classical counterpart, a noisy quantum channel is characterized by a loss, a quantity that depends on the channel input and the quantum operation performed by the channel. The loss reflects the transmission quality: if…

Quantum Physics · Physics 2011-07-19 Nicolas J. Cerf

Quantum network is the key to enable distributed quantum information processing. As the single-link communication rate decays exponentially with the distance, to enable reliable end-to-end quantum communication, the number of nodes needs to…

Quantum Physics · Physics 2021-08-17 Quntao Zhuang , Bingzhi Zhang

We show that the amount of coherent quantum information that can be reliably transmitted down a dephasing channel with memory is maximized by separable input states. In particular, we model the channel as a Markov chain or a multimode…

Quantum Physics · Physics 2007-09-09 Antonio D'Arrigo , Giuliano Benenti , Giuseppe Falci
‹ Prev 1 2 3 10 Next ›