中文
相关论文

相关论文: Violating the Shannon capacity of metric graphs wi…

200 篇论文

The design of error-correcting codes used in modern communications relies on information theory to quantify the capacity of a noisy channel to send information [1]. This capacity can be expressed using the mutual information between input…

量子物理 · 物理学 2019-07-17 M. B. Hastings

Channel capacities quantify the optimal rates of sending information reliably over noisy channels. Usually, the study of capacities assumes that the circuits which sender and receiver use for encoding and decoding consist of perfectly…

量子物理 · 物理学 2024-04-15 Paula Belzig , Matthias Christandl , Alexander Müller-Hermes

The interactive capacity of a noisy channel is the highest possible rate at which arbitrary interactive protocols can be simulated reliably over the channel. Determining the interactive capacity is notoriously difficult, and the best known…

信息论 · 计算机科学 2021-02-03 Assaf Ben-Yishai , Young-Han Kim , Rotem Oshman , Ofer Shayevitz

The optimal rate of reliable communication over a quantum channel can be enhanced by pre-shared entanglement. Whereas the enhancement may be unbounded in infinite-dimensional settings even when the input power is constrained, a…

Coding theorems in quantum Shannon theory express the ultimate rates at which a sender can transmit information over a noisy quantum channel. More often than not, the known formulas expressing these transmission rates are intractable,…

量子物理 · 物理学 2010-06-15 Kamil Bradler , Patrick Hayden , Dave Touchette , Mark M. Wilde

Shannon's Capacity Theorem is the main concept behind the Theory of Communication. It says that if the amount of information contained in a signal is smaller than the channel capacity of a physical media of communication, it can be…

混沌动力学 · 物理学 2009-11-13 M. S. Baptista , J. Kurths

$M$-ary signal transmission over AWGN channel with additive $Q$-ary interference where the sequence of i.i.d. interference symbols is known causally at the transmitter is considered. Shannon's theorem for channels with side information at…

信息论 · 计算机科学 2007-07-13 Hamid Farmanbar , Amir K. Khandani

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…

量子物理 · 物理学 2016-08-18 Runyao Duan , Simone Severini , Andreas Winter

Designing encoding and decoding circuits to reliably send messages over many uses of a noisy channel is a central problem in communication theory. When studying the optimal transmission rates achievable with asymptotically vanishing error…

量子物理 · 物理学 2024-11-07 Matthias Christandl , Alexander Müller-Hermes

We describe two quantum channels that individually cannot send any information, even classical, without some chance of decoding error. But together a single use of each channel can send quantum information perfectly reliably. This proves…

量子物理 · 物理学 2011-12-19 Jianxin Chen , Toby S. Cubitt , Aram W. Harrow , Graeme Smith

This work deals with the scattering entropy of quantum graphs in many different circumstances. We first consider the case of the Shannon entropy and then the R\'enyi and Tsallis entropies, which are more adequate to study distinct…

量子物理 · 物理学 2024-07-30 Alison A. Silva , Fabiano M. Andrade , D. Bazeia

We derive exact values and new bounds for the Shannon capacity of two families of graphs: the $q$-Kneser graphs and the tadpole graphs. We also construct a countably infinite family of connected graphs whose Shannon capacity is not attained…

组合数学 · 数学 2026-01-28 Nitay Lavi , Igal Sason

The two-way capacities of quantum channels determine the ultimate entanglement and secret-key distribution rates achievable by two distant parties that are connected by a noisy transmission line, in absence of quantum repeaters. Since…

量子物理 · 物理学 2025-01-27 Francesco Anna Mele , Ludovico Lami , Vittorio Giovannetti

We investigate the effect of the well-known Mycielski construction on the Shannon capacity of graphs and on one of its most prominent upper bounds, the (complementary) Lov\'asz theta number. We prove that if the Shannon capacity of a graph,…

组合数学 · 数学 2023-12-15 Bence Csonka , Gábor Simonyi

Entangled inputs can enhance the capacity of quantum channels, this being one of the consequences of the celebrated result showing the non-additivity of several quantities relevant for quantum information science. In this work, we answer…

量子物理 · 物理学 2015-05-20 Fernando G. S. L. Brandao , Jens Eisert , Michal Horodecki , Dong Yang

Basing on unified approach to {\it all} kinds of quantum capacities we show that the rate of quantum information transmission is bounded by the maximal attainable rate of coherent information. Moreover, we show that, if for any bipartite…

量子物理 · 物理学 2009-11-06 Michal Horodecki , Pawel Horodecki , Ryszard Horodecki

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…

量子物理 · 物理学 2007-05-23 Garry Bowen , Rajagopal Nagarajan

Using the concept of discrete noiseless channels, it was shown by Shannon in A Mathematical Theory of Communication that the ultimate performance of an encoder for a constrained system is limited by the combinatorial capacity of the system…

信息论 · 计算机科学 2008-09-09 Georg Böcherer , Valdemar Cardoso da Rocha , Cecilio Pimentel

When transmitting information over a noisy channel, two approaches, dating back to Shannon's work, are common: assuming the channel errors are independent of the transmitted content and devising an error-correcting code, or assuming the…

信息论 · 计算机科学 2015-01-22 Ohad Elishco , Tom Meyerovitch , Moshe Schwartz

The primary objective of quantum Shannon theory is to evaluate the capacity of quantum channels. In spite of the existence of rigorous coding theorems that quantify the transmission of information through quantum channels, superadditivity…

量子物理 · 物理学 2024-01-17 Rajiuddin Sk , Prasanta K. Panigrahi