Related papers: Error exponents for entanglement transformations f…
We examine the problem of using local operations and classical communication (LOCC) to distinguish a known pure state from an unknown (possibly mixed) state, bounding the error probability from above and below. We study the asymptotic rate…
In this paper, we study error exponents for a concatataned coding based class of DNA storage codes in which the number of reads performed can be variable. That is, the decoder can sequentially perform reads and choose whether to output the…
The analysis of stochastic loss networks has long been of interest in computer and communications networks and is becoming important in the areas of service and information systems. In traditional settings, computing the well known Erlang…
A way to characterize quantum nonlocality is to see difference in the figure of merit between LOCC optimal protocol and globally optimal protocol in doing certain task, e.g., state estimation, state discrimination, cloning and broadcasting.…
In this paper we investigate the effect of superposition of states on local conversion of pure bipartite states under deterministic LOCC. We are able to form a bridge between comparable and incomparable classes of states through the linear…
We derive a single-letter upper bound to the mismatched-decoding capacity for discrete memoryless channels. The bound is expressed as the mutual information of a transformation of the channel, such that a maximum-likelihood decoding error…
Local quantum operations relating multiqubit flip (0-1) and exchange symmetric (FES) states, with the maximum possible probability of success, have been determined by assuming that the states are converted via one-shot FES transformations.…
Based on Jaynes' maximum entropy principle, exponential random graphs provide a family of principled models that allow the prediction of network properties as constrained by empirical data (observables). However, their use is often hindered…
Motivated by the recent discovery of a quantum Chernoff theorem for asymptotic state discrimination, we investigate the distinguishability of two bipartite mixed states under the constraint of local operations and classical communication…
In this work, we consider decoupling a bipartite quantum state via a general quantum channel. We propose a joint state-channel decoupling approach to obtain a one-shot error exponent bound without smoothing, in which trace distance is used…
Recent advances have led towards first prototypes of quantum networks in which entanglement is distributed by sources producing bipartite entangled states. This raises the question of which states can be generated in quantum networks based…
Nonlocality exhibited by ensembles of composite quantum states, wherein local operations and classical communication (LOCC) yield suboptimal discrimination probabilities compared to global strategies, is one of the striking nonclassical…
The class of quantum operations known as Local Operations and Classical Communication (LOCC) induces a partial ordering on quantum states. We present the results of systematic numerical computations related to the volume (with respect to…
Randomized backoff protocols, such as exponential backoff, are a powerful tool for managing access to a shared resource, often a wireless communication channel (e.g., [1]). For a wireless device to transmit successfully, it uses a backoff…
Quantum entanglement distillation protocols are LOCC protocols between Alice and Bob that convert imperfect EPR pairs, or, in general, partially entangled bipartite states into perfect or near-perfect EPR pairs. The classical communication…
We consider communication over binary-input memoryless output-symmetric channels using low-density parity-check codes and message-passing decoding. The asymptotic (in the length) performance of such a combination for a fixed number of…
This paper studies the concentration properties of random codes. Specifically, we show that, for discrete memoryless channels, the error exponent of a randomly generated code with pairwise-independent codewords converges in probability to…
We introduce a new entanglement measure based on optimal entanglement witness. First of all, we show that the entanglement measure satisfies some necessary properties, including zero entanglements for all separable states, convexity,…
We study large-scale distributed cooperative systems that use optimistic replication. We represent a system as a graph of actions (operations) connected by edges that reify semantic constraints between actions. Constraint types include…
We derive a sphere-packing error exponent for coded transmission over discrete memoryless channels with a fixed decoding metric. By studying the error probability of the code over an auxiliary channel, we find a lower bound to the…