Rex A. C. Medeiros, Francisco M. De Assis
We define here a new kind of quantum channel capacity by extending the concept of zero-error capacity for a noisy quantum channel. The necessary requirement for which a quantum channel has zero-error capacity greater than zero is given. Finally, we point out some directions on how to calculate the zero-error capacity of such channels.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
继续探索
We define the quantum zero-error capacity, a new kind of classical capacity of a noisy quantum channel. Moreover, the necessary requirement for which a quantum channel has zero-error capacity greater than zero is also given.
Channel capacities of quantum channels can be nonadditive even if one of two quantum channels has no channel capacity. We call this phenomenon \emph{activation} of the channel capacity. In this paper, we show that when we use a quantum channel on a qubit system, only a noiseless qubit channel can generate the activation of the zero-error classical capacity. In particular, we show that the zero-error classical capacity of two quantum channels on qubit systems cannot be activated. Furthermore, we present a class of examples showing the activation of the zero-error classical capacity in low-dimen…
The zero-error capacity of quantum channels was defined as the least upper bound of rates at which classical information can be transmitted through a quantum channel with probability of error equal to zero. This paper investigates some properties of input states and measurements used to attain the quantum zero-error capacity. We start by reformulating the problem of finding the zero-error capacity in the language of graph theory. This alternative definition is used to prove that the zero-error capacity of any quantum channel can be reached by using tensor products of pure states as channel inp…
Communication over a noisy quantum channel introduces errors in the transmission that must be corrected. A fundamental bound on quantum error correction is the quantum capacity, which quantifies the amount of quantum data that can be protected. We show theoretically that two quantum channels, each with a transmission capacity of zero, can have a nonzero capacity when used together. This unveils a rich structure in the theory of quantum communications, implying that the quantum capacity does not uniquely specify a channel's ability for transmitting quantum information.
We study encodings that give the best known thresholds for the non-zero capacity of quantum channels, i.e., the upper bound for correctable noise, using an entropic approach to calculation of the threshold values. Our results show that Pauli noise is correctable up to the hashing bound. For a depolarizing channel, this approach allows one to achieve a non-zero capacity for a fidelity (probability of no error) of f=0.80870.
Quantum Lovász number is a quantum generalization of the Lovász number in graph theory. It is the best known efficiently computable upper bound of the entanglement-assisted zero-error classical capacity of a quantum channel. However, it remains an intriguing open problem whether quantum entanglement can always enhance the zero-error capacity to achieve the quantum Lovász number. In this paper, by constructing a particular class of qutrit-to-qutrit channels, we show that there exists a strict gap between the entanglement-assisted zero-error capacity and the quantum Lovász number. Interestingly,…
It was shown [T.S. Cubitt et al., IEEE Trans. Inform. Theory 57, 8114 (2011)] that there exist quantum channels where a single use cannot transmit classical information perfectly yet two uses can. This phenomenon is called the superactivation of the zero-error classical capacity which does not occur in classical channels. In this paper, it is shown that qubit channels cannot generate the superactivation.
There are only two known kinds of zero-capacity channels. The first kind produces entangled states that have positive partial transpose, and the second one - states that are cloneable. We consider the family of 'hybrid' quantum channels, which lies in the intersection of the above classes of channels and investigate its properties. It gives rise to the first explicit examples of the channels, which create bound entangled states that have the property of being cloneable to the arbitrary finite number of parties. Hybrid channels provide the first example of highly cloneable binding entanglement …
The superactivation of zero-capacity quantum channels makes it possible to use two zero-capacity quantum channels with a positive joint capacity at the output. Currently, we have no theoretical background for describing all possible combinations of superactive zero-capacity channels; hence, there may be many other possible combinations. In this PhD Thesis I provide an algorithmic solution to the problem of superactivation and prove that superactivation effect is rooted in information geometric issues.
Sufficient conditions for additivity of the zero-error classical capacity of quantum channels
研究量子信道零误差经典容量可加性，通过建立独立数乘法性的充分条件及研究非交换图块形式，给出满足条件的量子信道例子，推导相关条件，为零误差量子通信基本限制提供新见解。
We prove unconditional security for a quantum key distribution (QKD) protocol based on distilling pbits (twisted ebits) [quant-ph/0309110] from an arbitrary untrusted state that is claimed to contain distillable key. Our main result is that we can verify security using only public communication -- via parameter estimation of the given untrusted state. The technique applies even to bound entangled states, thus extending QKD to the regime where the available quantum channel has zero quantum capacity. We also show how to convert our purification-based QKD schemes to prepare-measure schemes.
We study various super-activation effects in the following zero-error communication scenario: One sender wants to send classical or quantum information through a noisy quantum channel to one receiver with zero probability of error. First we show that there are quantum channels of which a single use is not able to transmit classical information perfectly yet two uses can. This is achieved by employing entangled input states between different uses of the given channel and thus cannot happen for classical channels. Second we exhibit a class of quantum channel with vanishing zero-error classical c…
One of the main problems in quantum complexity theory is that our understanding of the theory of QMA-completeness is not as rich as its classical analogue, the NP- completeness. In this paper we consider the clique problem in graphs, which is NP- complete, and try to find its quantum analogue. We show that, quantum clique problem can be defined as follows; Given a quantum channel, decide whether there are k states that are distinguishable, with no error, after passing through channel. This definition comes from reconsidering the clique problem in terms of the zero-error capacity of graphs, and…
Superadditivity of Zero-Error Capacity in Noisy Classical and Perfect Quantum Channel Pairs
该研究展示了在噪声经典和完美量子信道并行使用时，零误差容量的超加性现象，并揭示了量子优势源于Kochen-Specker上下文性。
Quantum Entanglement Assistance Improves the Capacity and Activates the Zero-Error Capacity of Classical Channels with Causal CSIT
研究显示，在存在因果信道状态信息的情况下，量子纠缠可提升经典信道容量并激活零错误容量。
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 are involved, we do not know how to compute channel capacities. The capacity to transmit quantum information is essential to quantum cryptography and computing, but the formula involves maximising the coherent information over arbitrarily many channel uses. This is because entanglement across channel uses can increase the coherent information, even from zero t…
Nonlocality-Assisted Enhancement of Error-Free Communication in Noisy Classical Channels
本文研究贝尔场景中非局域关联对噪声经典信道零错误通信的增强作用，构造出零错误容量为零的信道，借助极值非局域关联可实现1比特或log m比特无误传输，强调其多功能效用。
Channel capacity describes the size of the nearly ideal channels, which can be obtained from many uses of a given channel, using an optimal error correcting code. In this paper we collect and compare minor and major variations in the mathematically precise statements of this idea which have been put forward in the literature. We show that all the variations considered lead to equivalent capacity definitions. In particular, it makes no difference whether one requires mean or maximal errors to go to zero, and it makes no difference whether errors are required to vanish for any sequence of block …
We study the possible difference between the quantum and the private capacities of a quantum channel in the zero-error setting. For a family of channels introduced by arXiv:1312.4989, we demonstrate an extreme difference: the zero-error quantum capacity is zero, whereas the zero-error private capacity is maximum given the quantum output dimension.
A condition for the zero-error capacity of quantum channels
本文提出量子信道零误差容量为正的一个条件：Kraus算子共有至少两个特征态，该条件作为零误差容量的下界，且易于验证。
One of the main figures of merit for quantum memories and quantum communication devices is their quantum capacity. It has been studied for arbitrary kinds of quantum channels, but its practical estimation has so far been limited to devices that implement independent and identically distributed (i.i.d.) quantum channels, where each qubit is affected by the same noise process. Real devices, however, typically exhibit correlated errors. Here, we overcome this limitation by presenting protocols that estimate a channel's one-shot quantum capacity for the case where the device acts on (an arbitrary …
One of the most surprising recent results in quantum Shannon theory is the superactivation of the quantum capacity of a quantum channel. This phenomenon has its roots in the extreme violation of additivity of the channel capacity and enables to reliably transmit quantum information over zero-capacity quantum channels. In this work we demonstrate a similar effect for the classical capacity of a quantum channel which previously was thought to be impossible. We show that a nonzero classical capacity can be achieved for all zero-capacity quantum channels and it only requires the assistance of an e…
Quantum mechanics is compatible with scenarios where the relative order between two events can be indefinite. Here we show that two independent instances of a noisy process can behave as a perfect quantum communication channel when used in a coherent superposition of two alternative orders. This phenomenon occurs even if the original process has zero capacity to transmit quantum information. In contrast, perfect quantum communication does not occur when the message is sent directly from the sender to the receiver through a superposition of alternative paths, with an independent noise process a…
The superactivation of zero-capacity quantum channels makes it possible to use two zero-capacity quantum channels with a positive joint capacity for their output. Currently, we have no theoretical background to describe all possible combinations of superactive zero-capacity channels; hence, there may be many other possible combinations. In practice, to discover such superactive zero-capacity channel-pairs, we must analyze an extremely large set of possible quantum states, channel models, and channel probabilities. There is still no extremely efficient algorithmic tool for this purpose. This pa…
Superactivation is the property that two channels with zero quantum capacity can be used together to yield positive capacity. Here we demonstrate that this effect exists for a wide class of inequivalent channels, none of which can simulate each other. We also consider the case where one of two zero capacity channels are applied, but the sender is ignorant of which one is applied. We find examples where the greater the entropy of mixing of the channels, the greater the lower bound for the capacity. Finally, we show that the effect of superactivation is rather generic by providing example of sup…
The highest fidelity of quantum error-correcting codes 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) on noisy quantum channels that are subject to not necessarily independent errors. The E(R) is positive below some threshold R', which implies R' is a lower bound on the quantum capacity. This work is an extension of the author's previous works [M. Hamada, Phys. Rev. A, 65, 052305, 2002 (e-Print quant-ph/0109114, LANL, 2001), and M. Hamada, submitted to IEEE Trans. Inf. Theory, 2002 (e-Print quant-ph/0112103, LANL, 2001)], which presented …
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…
We demonstrate that the presence of entanglement in macroscopic bodies (e.g. solids) in thermodynamical equilibrium could be revealed by measuring heat-capacity. The idea is that if the system were in a separable state, then for certain Hamiltonians heat capacity would not tend asymptotically to zero as the temperature approaches absolute zero. Since this would contradict the third law of thermodynamics, one concludes that the system must contain entanglement. The separable bounds are obtained by minimization of the heat capacity over separable states and using its universal low-temperature be…
Experimentally realizable quantum computers are rapidly approaching the threshold of quantum supremacy. Quantum Hamiltonian simulation promises to be one of the first practical applications for which such a device could demonstrate an advantage over all classical systems. However, these early devices will inevitably remain both noisy and small, precluding the use of quantum error correction. We use high-performance classical tools to construct, optimize, and simulate quantum circuits subject to realistic error models in order to empirically determine the "simulation capacity" of near-term simu…
Recently M.E. Shirokov introduced the non-commutative operator graph depending on the complex parameter $θ$ to construct channels with positive quantum zero-error capacity having vanishing n-shot capacity. We study the algebraic structure of this graph. The relations for the algebra generated by the graph are derived. In the limiting case $θ=\pm1$ the graph becomes abelian and degenerates into the direct sum of four one-dimensional irreducible representations of the Klein group.
Optimizing bias-tailored quantum error correction beyond code-capacity noise
研究显示，在考虑电路级噪声后，偏置定制量子纠错的优势大幅降低；引入偏置滤波CNOT门可部分恢复优势。
Establishing the strong converse theorem for a communication channel confirms that the capacity of that channel, that is, the maximum achievable rate of reliable information communication, is the ultimate limit of communication over that channel. Indeed, the strong converse theorem for a channel states that coding at a rate above the capacity of the channel results in the convergence of the error to its maximum value 1 and that there is no trade-off between communication rate and decoding error. Here we prove that the strong converse theorem holds for the product-state capacity of quantum chan…
Recently there has been considerable activity on the subject of additivity of various quantum channel capacities. Here, we construct a family of channels with sharply bounded classical, hence private capacity. On the other hand, their quantum capacity when combined with a zero private (and zero quantum) capacity erasure channel, becomes larger than the previous classical capacity. As a consequence, we can conclude for the first time that the classical private capacity is non-additive. In fact, in our construction even the quantum capacity of the tensor product of two channels can be greater th…
The zero-error capacity of a classical channel is expressed in terms of the independence number of some graph and its tensor powers. This quantity is hard to compute even for small graphs such as the cycle of length seven, so upper bounds such as the Lovasz theta function play an important role in zero-error communication. In this paper, we show that the Lovasz theta function is an upper bound on the zero-error capacity even in the presence of entanglement between the sender and receiver.
We show that unbounded number of channel uses may be necessary for perfect transmission of quantum information. For any n we explicitly construct low-dimensional quantum channels ($d_A$=4, $d_E$=2 or 4) whose quantum zero-error capacity is positive but the corresponding n-shot capacity is zero. We give estimates for quantum zero-error capacity of such channels (as a function of n) and show that these channels can be chosen in any small vicinity (in the cb-norm) of a classical-quantum channel. Mathematically, this property means appearance of an ideal (noiseless) subchannel only in sufficiently…
Bosonic qubits encoded in continuous-variable systems provide a promising alternative to two-level qubits for quantum computation and communication. So far, photon loss has been the dominant source of errors in bosonic qubits, but the significant reduction of photon loss in recent bosonic qubit experiments suggests that dephasing errors should also be considered. However, a detailed understanding of the combined photon loss and dephasing channel is lacking. Here, we show that, unlike its constituent parts, the combined loss-dephasing channel is non-degradable, pointing towards a richer structu…
We investigate the classical communication over quantum channels when assisted by no-signaling (NS) and positive-partial-transpose-preserving (PPT) codes, for which both the optimal success probability of a given transmission rate and the one-shot $ε$-error capacity are formalized as semidefinite programs (SDPs). Based on this, we obtain improved SDP finite blocklength converse bounds of general quantum channels for entanglement-assisted codes and unassisted codes. Furthermore, we derive two SDP strong converse bounds for the classical capacity of general quantum channels: for any code with a …
The zero-error classical capacity of a quantum channel is the asymptotic rate at which it can be used to send classical bits perfectly, so that they can be decoded with zero probability of error. We show that there exist pairs of quantum channels, neither of which individually have any zero-error capacity whatsoever (even if arbitrarily many uses of the channels are available), but such that access to even a single copy of both channels allows classical information to be sent perfectly reliably. In other words, we prove that the zero-error classical capacity can be superactivated. This result …
Bounding the Graph Capacity with Quantum Mechanics and Finite Automata
本文提出零错误酉容量作为量子博弈张量积值，通过有限自动机结构证明其与零错误容量相差可控因子，并利用平方和层级给出收敛上界，在特定猜想下可计算零错误容量。
Programming the Kennedy Receiver for Capacity Maximization versus Minimizing One-shot Error Probability
该研究优化肯尼迪接收机的符号先验和检测前位移以最大化相干态BPSK容量，发现最优位移与最小化单次错误概率的位移不同。
As with classical information, error-correcting codes enable reliable transmission of quantum information through noisy or lossy channels. In contrast to the classical theory, imperfect quantum channels exhibit a strong kind of synergy: there exist pairs of discrete memoryless quantum channels, each of zero quantum capacity, which acquire positive quantum capacity when used together. Here we show that this "superactivation" phenomenon also occurs in the more realistic setting of optical channels with attenuation and Gaussian noise. This paves the way for its experimental realization and applic…
Shannon's theory of zero-error communication is re-examined in the broader setting of using one classical channel to simulate another exactly, and in the presence of various resources that are all classes of non-signalling correlations: Shared randomness, shared entanglement and arbitrary non-signalling correlations. Specifically, when the channel being simulated is noiseless, this reduces to the zero-error capacity of the channel, assisted by the various classes of non-signalling correlations. When the resource channel is noiseless, it results in the "reverse" problem of simulating a noisy ch…
We determine the secrecy capacities of AVQCs (arbitrarily varying quantum channels). Both secrecy capacity with average error probability and with maximal error probability are derived. Both derivations are based on one common code construction. The code we construct fulfills a stringent secrecy requirement, which is called the strong code concept. We determine when the secrecy capacity is a continuous function of the system parameters and completely characterize its discontinuity points both for average error criterion and for maximal error criterion. Furthermore, we prove the phenomenon "sup…
We work out a theory of approximate quantum error correction that allows us to derive a general lower bound for the entanglement fidelity of a quantum code. The lower bound is given in terms of Kraus operators of the quantum noise. This result is then used to analyze the average error correcting performance of codes that are randomly drawn from unitarily invariant code ensembles. Our results confirm that random codes of sufficiently large block size are highly suitable for quantum error correction. Moreover, employing a lemma of Bennett, Shor, Smolin, and Thapliyal, we prove that random coding…
The zero-error capacity of a channel is the rate at which it can send information perfectly, with zero probability of error, and has long been studied in classical information theory. We show that the zero-error capacity of quantum channels exhibits an extreme form of non-additivity, one which is not possible for classical channels, or even for the usual capacities of quantum channels. By combining probabilistic arguments with algebraic geometry, we prove that there exist channels E1 and E2 with no zero-error classical capacity whatsoever, C_0(E1) = C_0(E2) = 0, but whose joint zero-error quan…
We study the activated quantum no-signalling-assisted zero-error classical capacity by first allowing the assistance from some noiseless forward communication channel and later paying back the cost of the helper. This activated communication model considers the additional forward noiseless channel as a catalyst for communication. First, we show that the one-shot activated capacity can be formulated as a semidefinite program and we derive a number of striking properties of this capacity. We further present a sufficient condition under which a noisy channel can be activated. Second, we show that…
Duan and Winter studied the one-shot zero-error classical capacity of a quantum channel assisted by quantum non-signalling correlations, and formulated this problem as a semidefinite program depending only on the Kraus operator space of the channel. For the class of classical-quantum channels, they showed that the asymptotic zero-error classical capacity assisted by quantum non-signalling correlations, minimized over all classical-quantum channels with a confusability graph $G$, is exactly $\log \vartheta(G)$, where $\vartheta(G)$ is the celebrated Lovász theta function. In this paper, we show…
In this paper, we explicitly evaluate the one-shot quantum non-signalling assisted zero-error classical capacities $\M_0^{\mathrm{QNS}}$ for qubit channels. In particular, we show that for nonunital qubit channels, $\M_0^{\mathrm{QNS}}=1$, which implies that in the one-shot setting, nonunital qubit channels cannot transmit any information with zero probability of error even when assisted by quantum non-signalling correlations. Furthermore, we show that for qubit channels, $\M_0^{\mathrm{QNS}}$ equals to the one-shot entanglement-assisted zero-error classical capacities. This means that for a s…
Private communication via zero-private-capacity quantum channels
本文通过构造两个零私有容量信道的联合使用实现超激活，证明私有容量不能单独决定信道安全通信价值，并给出超过0.0001903私有比特的编码方案。
We study the one-shot zero-error classical capacity of a quantum channel assisted by quantum no-signalling correlations, and the reverse problem of exact simulation of a prescribed channel by a noiseless classical one. Quantum no-signalling correlations are viewed as two-input and two-output completely positive and trace preserving maps with linear constraints enforcing that the device cannot signal. Both problems lead to simple semidefinite programmes (SDPs) that depend only on the Kraus operator space of the channel. In particular, we show that the zero-error classical simulation cost is pre…
We begin with a detailed description of a low dimensional quantum channel ($d_A=4, d_E=3$) demonstrating the symmetric form of superactivation of one-shot zero-error quantum capacity. This means appearance of a noiseless (perfectly reversible) subchannel in the tensor square of a channel having no noiseless subchannels. Then we describe a quantum channel $Φ$ such that $\,\bar{Q}_0(Φ)=0$ and $\,\bar{Q}_0(Φ\otimesΦ)\geq\log n\,$ for any $\,n\leq+\infty$. We also show that the superactivation of one-shot zero-error quantum capacity of a channel can be reformulated in terms of quantum measurements…
We consider a setting where qubits are processed sequentially, and derive fundamental limits on the rate at which classical information can be transmitted using quantum states that decohere in time. Specifically, we model the sequential processing of qubits using a single server queue, and derive explicit expressions for the capacity of such a `queue-channel.' We also demonstrate a sweet-spot phenomenon with respect to the arrival rate to the queue, i.e., we show that there exists a value of the arrival rate of the qubits at which the rate of information transmission (in bits/sec) through the …
Error Resilience of Fracton Codes and Near Saturation of Code-Capacity Threshold in Three Dimensions
研究分数子码，尤其是checkerboard码，通过统计力学映射和并行退火蒙特卡罗模拟，发现其码容量阈值约为0.107(3)，接近理论极限，验证了双互双模型的广义熵关系。
We consider a model of communication via a fully quantum jammer channel with quantum jammer, quantum sender and quantum receiver, which we dub quantum arbitrarily varying channel (QAVC). Restricting to finite dimensional user and jammer systems, we show, using permutation symmetry and a de Finetti reduction, how the random coding capacity (classical and quantum) of the QAVC is reduced to the capacity of a naturally associated compound channel, which is obtained by restricting the jammer to i.i.d. input states. Furthermore, we demonstrate that the shared randomness required is at most logarithm…
A unified approach to prove the converses for the quantum channel capacity theorems is presented. These converses include the strong converse theorems for classical or quantum information transfer with error exponents and novel explicit upper bounds on the fidelity measures reminiscent of the Wolfowitz strong converse for the classical channel capacity theorems. We provide a new proof for the error exponents for the classical information transfer. A long standing problem in quantum information theory has been to find out the strong converse for the channel capacity theorem when quantum informa…
We investigate entanglement transmission over an unknown channel in the presence of a third party (called the adversary), which is enabled to choose the channel from a given set of memoryless but non-stationary channels without informing the legitimate sender and receiver about the particular choice that he made. This channel model is called arbitrarily varying quantum channel (AVQC). We derive a quantum version of Ahlswede's dichotomy for classical arbitrarily varying channels. This includes a regularized formula for the common randomness-assisted capacity for entanglement transmission of an …
A strong converse theorem for channel capacity establishes that the error probability in any communication scheme for a given channel necessarily tends to one if the rate of communication exceeds the channel's capacity. Establishing such a theorem for the quantum capacity of degradable channels has been an elusive task, with the strongest progress so far being a so-called "pretty strong converse". In this work, Morgan and Winter proved that the quantum error of any quantum communication scheme for a given degradable channel converges to a value larger than $1/\sqrt{2}$ in the limit of many cha…
We initiate the study of zero-error communication via quantum channels when the receiver and sender have at their disposal a noiseless feedback channel of unlimited quantum capacity, generalizing Shannon's zero-error communication theory with instantaneous feedback. We first show that this capacity is a function only of the linear span of Choi-Kraus operators of the channel, which generalizes the bipartite equivocation graph of a classical channel, and which we dub "non-commutative bipartite graph". Then we go on to show that the feedback-assisted capacity is non-zero (with constant activating…
扫码添加微信好友，提出您的宝贵建议 👇
💡 备注请填写：网站反馈
发表机构由 AI 从论文文本抽取，如发现错误，欢迎反馈修正建议。