English
Related papers

Related papers: Random coding exponents galore via decoupling

200 papers

Randomized exponential backoff is a widely deployed technique for coordinating access to a shared resource. A good backoff protocol should, arguably, satisfy three natural properties: (i) it should provide constant throughput, wasting as…

Distributed, Parallel, and Cluster Computing · Computer Science 2015-07-14 Michael A. Bender , Jeremy T. Fineman , Seth Gilbert , Maxwell Young

In source coding, either with or without side information at the decoder, the ultimate performance can be achieved by means of random binning. Structured binning into cosets of performing channel codes has been successfully employed in…

Information Theory · Computer Science 2010-08-03 Lorenzo Cappellari

We consider a system in which two nodes take correlated measurements of a random source with time-varying and unknown statistics. The observations of the source at the first node are to be losslessly replicated with a given probability of…

Information Theory · Computer Science 2016-10-27 Fangzhou Chen , Bin Li , Can Emre Koksal

Finding exponential separation between quantum and classical information tasks is like striking gold in quantum information research. Such an advantage is believed to hold for quantum computing but is proven for quantum communication…

Quantum information protocols are inevitably affected by decoherence which is associated with the leakage of quantum information into an environment. In this paper we address the possibility of recovering the quantum information from an…

Quantum Physics · Physics 2015-05-14 Metin Sabuncu , Radim Filip , Gerd Leuchs , Ulrik L. Andersen

This paper proposes two new full-duplex quantum communication protocols to exchange classical or quantum information between two remote parties simultaneously without transferring a physical particle over the quantum channel. The first…

Quantum Physics · Physics 2021-09-28 Fakhar Zaman , Hyundong Shin , Moe Z. Win

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

Error probability distribution associated with a given Clifford measurement circuit is described exactly in terms of the circuit error-equivalence group, or the circuit subsystem code previously introduced by Bacon, Flammia, Harrow, and…

Quantum Physics · Physics 2020-08-12 Leonid P. Pryadko

We define the error exponent of the typical random code as the long-block limit of the negative normalized expectation of the logarithm of the error probability of the random code, as opposed to the traditional random coding error exponent,…

Information Theory · Computer Science 2017-08-25 Neri Merhav

The concept of multiple particle interference is discussed, using insights provided by the classical theory of error correcting codes. This leads to a discussion of error correction in a quantum communication channel or a quantum computer.…

Quantum Physics · Physics 2009-10-30 Andrew Steane

The development and use of large-scale quantum computers relies on integrating quantum error-correcting (QEC) schemes into the quantum computing pipeline. A fundamental part of the QEC protocol is the decoding of the syndrome to identify a…

In this paper we present quantum key distribution protocol that, instead of single qubits, uses mesoscopic coherent states of light $|\alpha\rangle$ to encode bit values of a randomly generated key. Given the reference value…

Quantum Physics · Physics 2017-05-04 G. A. Barbosa , J. van de Graaf , P. Mateus , N. Paunković

Network coding is a highly efficient data dissemination mechanism for wireless networks. Since network coded information can only be recovered after delivering a sufficient number of coded packets, the resulting decoding delay can become…

Information Theory · Computer Science 2016-11-17 Rui A. Costa , Daniele Munaretto , Joerg Widmer , Joao Barros

A realistic Quantum Key Distribution (QKD) protocol necessarily deals with finite resources, such as the number of signals exchanged by the two parties. We derive a bound on the secret key rate which is expressed as an optimization problem…

Quantum Physics · Physics 2011-10-13 Silvestre Abruzzo , Hermann Kampermann , Markus Mertz , Dagmar Bruß

The concept of the smoothing parameter plays a crucial role in both lattice-based and code-based cryptography, primarily due to its effectiveness in achieving nearly uniform distributions through the addition of noise. Recent research by…

Information Theory · Computer Science 2024-05-17 Hao Yan , Cong Ling

We consider the problem of optimally decoding a quantum error correction code -- that is to find the optimal recovery procedure given the outcomes of partial "check" measurements on the system. In general, this problem is NP-hard. However,…

Quantum Physics · Physics 2009-11-13 David Poulin

Physical qubits in a quantum computer are often represented by superposition states of single particles or excitations. Decay of the excitation itself is a fundamental error channel that is difficult to overcome via external drive or…

Quantum Physics · Physics 2025-10-23 Shruti Shirol , Sean van Geldern , Hanzhe Xi , Chen Wang

Quantum information can be processed using large ensembles of ultracold and trapped neutral atoms, building naturally on the techniques developed for high-precision spectroscopy and metrology. This article reviews some of the most important…

Quantum Physics · Physics 2007-05-23 P. S. Jessen , I. H. Deutsch , R. Stock

We introduce two dual, purely quantum protocols: for entanglement distillation assisted by quantum communication (``mother'' protocol) and for entanglement assisted quantum communication (``father'' protocol). We show how a large class of…

Quantum Physics · Physics 2009-11-10 I. Devetak , A. W. Harrow , A. Winter

Due to the short and bursty incoming messages, channel access activities in a wireless random access system are often fractional. The lack of frequent data support consequently makes it difficult for the receiver to estimate and track the…

Information Theory · Computer Science 2011-10-11 Zheng Wang , Jie Luo
‹ Prev 1 4 5 6 7 8 10 Next ›