English
Related papers

Related papers: Rate limits in quantum networks with lossy repeate…

200 papers

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…

Quantum Physics · Physics 2025-01-27 Francesco Anna Mele , Ludovico Lami , Vittorio Giovannetti

Quantum repeater networks are a fundamental of any future quantum Internet and long-distance quantum communications. The entangled quantum nodes can communicate through several different levels of entanglement, leading to a heterogeneous,…

Quantum Physics · Physics 2018-08-24 Laszlo Gyongyosi , Sandor Imre

All-photonic quantum repeaters are essential for establishing long-range quantum entanglement. Within repeater nodes, reliably performing entanglement swapping is a key component of scalable quantum communication. To tackle the challenge of…

Quantum Physics · Physics 2025-05-14 Bikun Li , Kenneth Goodenough , Filip Rozpędek , Liang Jiang

The rate and security of quantum communications between users placed at arbitrary points of a quantum communication network depend on the structure of the network, on its extension and on the nature of the communication channels. In this…

Quantum Physics · Physics 2024-05-20 Lorenzo Cirigliano , Valentina Brosco , Claudio Castellano , Claudio Conti , Laura Pilozzi

Quantum relays are central to both quantum communication and distributed quantum computing, enabling long-distance transmission and modular architectures. Unlike classical repeaters, quantum repeaters preserve coherence without amplifying…

Quantum Physics · Physics 2025-09-03 Yigal Ilin , Uzi Pereg

This paper presents a stochastic geometry model for the investigation of fundamental information theoretic limitations in wireless networks. We derive a new unified multi-parameter cut-set bound on the capacity of networks of arbitrary…

Information Theory · Computer Science 2013-05-02 Georgios Rodolakis

This article explores the application of coding techniques for fault-tolerant quantum computation and extends their usage to fault-tolerant quantum communication. We review repeater-based quantum networks, emphasizing the roles of coding…

Quantum Physics · Physics 2024-08-08 Ching-Yi Lai , Kao-Yueh Kuo

The problem of computing a linear combination of sources over a multiple access channel is studied. Inner and outer bounds on the optimal tradeoff between the communication rates are established when encoding is restricted to random…

Information Theory · Computer Science 2018-10-30 Pinar Sen , Sung Hoon Lim , Young-Han Kim

This paper focuses on the capacity of peer-to-peer relay communications wherein the transmitter are assisted by an arbitrary number of parallel relays, i.e. there is no link and cooperation between the relays themselves. We detail the…

Information Theory · Computer Science 2014-04-08 Farshad Shams , Marco Luise

With the rise of critical machine-to-machine applications, next generation wireless communication systems must be designed with strict constraints on the latency and reliability. A key question in this context relates to channel state…

Information Theory · Computer Science 2017-06-06 Sebastian Schiessl , Hussein Al-Zubaidy , Mikael Skoglund , James Gross

The scaling laws of the achievable communication rates and the corresponding upper bounds of distributed reception in the presence of an interfering signal are investigated. The scheme includes one transmitter communicating to a remote…

Information Theory · Computer Science 2009-12-08 Amichai Sanderovich , Michael Peleg , Shlomo Shamai

Standard communication systems have transmission spectra that characterize their ability to perform frequency multiplexing over a finite bandwidth. Realistic quantum signals in quantum communication systems like transducers are inherently…

Quantum Physics · Physics 2025-02-14 Aditya Gandotra , Zhaoyou Wang , Aashish A. Clerk , Liang Jiang

We consider the problem of error control in a coded, multicast network, focusing on the scenario where the errors can occur only on a proper subset of the network edges. We model this problem via an adversarial noise, presenting a formal…

Information Theory · Computer Science 2022-05-31 Allison Beemer , Altan Berdan Kilic , Alberto Ravagnani

We consider scaling laws for maximal energy efficiency of communicating a message to all the nodes in a wireless network, as the number of nodes in the network becomes large. Two cases of large wireless networks are studied -- dense random…

Information Theory · Computer Science 2009-05-26 Aman Jain , Sanjeev R. Kulkarni , Sergio Verdu

The optimal rate region for interference networks is characterized when encoding is restricted to random code ensembles with superposition coding and time sharing. A simple simultaneous nonunique decoding rule, under which each receiver…

Information Theory · Computer Science 2016-11-15 Bernd Bandemer , Abbas El Gamal , Young-Han Kim

We propose a novel one-way quantum repeater architecture based on photonic tree-cluster states. Encoding a qubit in a photonic tree-cluster protects the information from transmission loss and enables long-range quantum communication through…

Since 1984, various optical quantum key distribution (QKD) protocols have been proposed and examined. In all of them, the rate of secret key generation decays exponentially with distance. A natural and fundamental question is then whether…

Quantum Physics · Physics 2016-03-29 Masahiro Takeoka , Saikat Guha , Mark M. Wilde

Quantum repeaters represent one possible way to achieve long-distance quantum key distribution. Collins et al. in [Phys. Rev. Lett. 98, 060502 (2007)] proposed multiplexing as method to increase the repeater rate and to decrease the…

Quantum Physics · Physics 2014-01-08 Silvestre Abruzzo , Hermann Kampermann , Dagmar Bruß

We develop a framework that we call compressive rate estimation. We assume that the composite channel gain matrix (i.e. the matrix of all channel gains between all network nodes) is compressible which means it can be approximated by a…

Information Theory · Computer Science 2015-04-29 Jan Schreck , Peter Jung , Sławomir Stańczak

We present novel bounds on the capacity of the independent and identically distributed binary deletion channel. Four upper bounds are obtained by providing the transmitter and the receiver with genie-aided information on suitably-defined…

Information Theory · Computer Science 2008-10-07 Dario Fertonani , Tolga M. Duman
‹ Prev 1 4 5 6 7 8 10 Next ›