首页/论文/quant-ph/0203077

arXiv quant-ph/02030772002-03quant-ph

A low-rate bound on the reliability of a quantum discrete memoryless channel

Alexander Barg

备注：: 9 pages, 1 figure. Changes in version 2: argument on the random coding bound expanded, minor errors corrected

英文摘要：

We extend a low-rate improvement of the random coding bound on the reliability of a classical discrete memoryless channel to its quantum counterpart. The key observation that we make is that the problem of bounding below the error exponent for a quantum channel relying on the class of stabilizer codes is equivalent to the problem of deriving error exponents for a certain symmetric classical channel.

机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。

阅读原文

阅读 PDF ↗

arXiv 页面 ↗HTML 原文 ↗

本文内容

英文摘要相关论文

机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。

继续探索

相关论文

Some Effects of Classical Feedback on the Classical Capacity of a Memoryless Quantum Channel

Classical feedback is defined here as the knowledge by the transmitter of the quantum state of the qubit received by the receiver. Such classical feedback doubles capacities of certain memoryless quantum channels without preexisting entanglement between transmitter and receiver. The increase in capacity, which is absent on classical memoryless channels, occurs because we can transform an entangled qubit pair into any other entangled state by applying a unitary operator to only one of the qubits.

2004-03-29quant-ph

Creating quantum correlations through local non-unitary memoryless channels

We show that two qubits, initially in a fully classical state, can develop significant quantum correlations as measured by the quantum discord (QD) under the action of a local memoryless noise (specifically we consider the case of a Markovian amplitude-damping channel). This is analytically proven after deriving in a compact form the QD for the class of separable states involved in such a process. We provide a picture in the Bloch sphere that unambiguously highlights the physical mechanism behind the effect regardless of the specific measure of QCs adopted.

2012-02-09quant-ph

Lower bound for the quantum capacity of a discrete memoryless quantum channel

We generalize the random coding argument of stabilizer codes and derive a lower bound on the quantum capacity of an arbitrary discrete memoryless quantum channel. For the depolarizing channel, our lower bound coincides with that obtained by Bennett et al. We also slightly improve the quantum Gilbert-Varshamov bound for general stabilizer codes, and establish an analogue of the quantum Gilbert-Varshamov bound for linear stabilizer codes. Our proof is restricted to the binary quantum channels, but its extension of to l-adic channels is straightforward.

2002-07-25quant-ph

Lower Bounds on the Quantum Capacity and Highest Error Exponent of General Memoryless Channels

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 positive linear map, where the dimension of the underlying Hilbert space is a prime number. On such a quantum channel, the highest fidelity of a quantum error-correcting code of length $n$ and rate R is proven to be lower bounded by 1 - \exp [-n E(R) + o(n)] for some function E(R). The E(R) is positive below some threshold R', which implies R' is a lower bou…

2002-06-21quant-ph

Quantum Feedback Channels

In Shannon information theory the capacity of a memoryless communication channel cannot be increased by the use of feedback. In quantum information theory the no-cloning theorem means that noiseless copying and feedback of quantum information cannot be achieved. In this paper, quantum feedback is defined as the unlimited use of a noiseless quantum channel from receiver to sender. Given such quantum feedback, it is shown to provide no increase in the entanglement--assisted capacities of a memoryless quantum channel, in direct analogy to the classical case. It is also shown that in various cases…

2004-04-02quant-ph

Information Rates Achievable with Algebraic Codes on Quantum Discrete Memoryless Channels

The highest information rate at which quantum error-correction schemes work reliably on a channel, which is called the quantum capacity, is proven to be lower bounded by the limit of the quantity termed coherent information maximized over the set of input density operators which are proportional to the projections onto the code spaces of symplectic stabilizer codes. Quantum channels to be considered are those subject to independent errors and modeled as tensor products of copies of a completely positive linear map on a Hilbert space of finite dimension, and the codes that are proven to have th…

2002-12-30quant-ph

更多相关论文收起更多论文

General formulas for capacity of classical-quantum channels

The capacity of a classical-quantum channel (or in other words the classical capacity of a quantum channel) is considered in the most general setting, where no structural assumptions such as the stationary memoryless property are made on a channel. A capacity formula as well as a characterization of the strong converse property is given just in parallel with the corresponding classical results of Verdú-Han which are based on the so-called information-spectrum method. The general results are applied to the stationary memoryless case with or without cost constraint on inputs, whereby a deep rela…

2003-02-28quant-ph

Commitment Capacity of Discrete Memoryless Channels

In extension of the bit commitment task and following work initiated by Crepeau and Kilian, we introduce and solve the problem of characterising the optimal rate at which a discrete memoryless channel can be used for bit commitment. It turns out that the answer is very intuitive: it is the maximum equivocation of the channel (after removing trivial redundancy), even when unlimited noiseless bidirectional side communication is allowed. By a well-known reduction, this result provides a lower bound on the channel's capacity for implementing coin tossing, which we conjecture to be an equality. The…

2003-04-10cs.CRquant-ph

On Feedback and the Classical Capacity of a Noisy Quantum Channel

In Shannon information theory the capacity of a memoryless communication channel cannot be increased by the use of feedback from receiver to sender. In this paper the use of classical feedback is shown to provide no increase in the unassisted classical capacity of a memoryless quantum channel when feedback is used across non-entangled input states, or when the channel is an entanglement--breaking channel. This gives a generalization of the Shannon theory for certain classes of feedback protocols when transmitting through noisy quantum communication channels.

2003-05-29quant-ph

Classical capacities of memoryless but not identical quantum channels

We study quantum channels that vary on time in a deterministic way, that is, they change in an independent but not identical way from one to another use. We derive coding theorems for the classical entanglement assisted and unassisted capacities. We then specialize the theory to lossy bosonic quantum channels and show the existence of contrasting examples where capacities can or cannot be drawn from the limiting behavior of the lossy parameter.

2020-11-06math-phmath.MPquant-ph

Removing correlations in signals transmitted over a quantum memory channel

We consider a model of bosonic memory channel, which induces correlations among the transmitted signals. The application of suitable unitary transformations at encoding and decoding stages allows the complete removal of correlations, mapping the memory channel into a memoryless one. However, such transformations, being global over an arbitrary large number of bosonic modes, are not realistically implementable. We then introduce a family of efficiently realizable transformations which can be used to partially remove correlations among errors, and we quantify the reduction of the gap with memory…

2011-11-09quant-ph

Parrondo's paradox and superactivation of classical and quantum capacity of communication channels with memory

There exist memoryless zero-capacity quantum channels that when used jointly result in the channel with positive capacity. This phenomenon is called superactivation. Making use of Parrondo's paradox, we exhibit examples of superactivation-like effect for the capacity of classical communication channels as well as quantum and private capacity of quantum channels with memory. There are several ingredients necessary for superactivation of quantum capacity to occur in memoryless case. The first one is the requirement for the quantum channels which are amenable for superactivation to come from two …

2013-05-06quant-ph

Calculating a maximizer for quantum mutual information

We obtain a maximizer for the quantum mutual information for classical information sent over the quantum qubit amplitude damping channel. This is achieved by limiting the ensemble of input states to antipodal states, in the calculation of the product-state capacity for the channel, the resulting maximizing ensemble consisting of just two non-orthogonal states. We also consider the product-state capacity of a convex combination of two memoryless channels and demonstrate in particular that it is in general not given by the minimum of the capacities of the respective memoryless channels.

2011-07-19quant-ph

One-Shot Classical-Quantum Capacity and Hypothesis Testing

The one-shot classical capacity of a quantum channel quantifies the amount of classical information that can be transmitted through a single use of the channel such that the error probability is below a certain threshold. In this work, we show that this capacity is well approximated by a relative-entropy-type measure defined via hypothesis testing. Combined with a quantum version of Stein's lemma, our results give a conceptually simple proof of the well-known Holevo-Schumacher-Westmoreland theorem for the capacity of memoryless channels. More generally, we obtain tight capacity formulas for ar…

2013-01-24quant-ph

Finite blocklength converse bounds for quantum channels

We derive upper bounds on the rate of transmission of classical information over quantum channels by block codes with a given blocklength and error probability, for both entanglement-assisted and unassisted codes, in terms of a unifying framework of quantum hypothesis testing with restricted measurements. Our bounds do not depend on any special property of the channel (such as memorylessness) and generalise both a classical converse of Polyanskiy, Poor, and Verdú as well as a quantum converse of Renner and Wang, and have a number of desirable properties. In particular our bound on entanglement…

2014-06-27quant-ph

Fluctuation and dissipation in memoryless open quantum evolutions

Von Neumann entropy rate for open quantum systems is, in general, written in terms of entropy production and entropy flow rates, encompassing the second law of thermodynamics. When the open-quantum-system evolution corresponds to a quantum dynamical semigroup, we find a decomposition of the infinitesimal generator of the dynamics, that allows to relate the von Neumann entropy rate with the divergence-based quantum Fisher information, at any time. Applied to quantum Gaussian channels that are dynamical semigroups, our decomposition leads to the quantum analog of the generalized classical de Bru…

2021-07-30cs.ITmath.ITquant-ph

Quantum rate distortion, reverse Shannon theorems, and source-channel separation

We derive quantum counterparts of two key theorems of classical information theory, namely, the rate distortion theorem and the source-channel separation theorem. The rate-distortion theorem gives the ultimate limits on lossy data compression, and the source-channel separation theorem implies that a two-stage protocol consisting of compression and channel coding is optimal for transmitting a memoryless source over a memoryless channel. In spite of their importance in the classical domain, there has been surprisingly little work in these areas for quantum information theory. In the present pape…

2012-08-19cs.ITmath.ITquant-ph