相关论文: Locally accessible information from multipartite e…
We consider universal methods for obtaining (uniform) continuity bounds for characteristics of multipartite quantum systems. We pay a special attention to infinite-dimensional multipartite quantum systems under the energy constraints. By…
In this work, we consider an upper bound for the quantum mutual information in thermal states of a bipartite quantum system. This bound is related with the interaction energy and logarithm of the partition function of the system. We…
We investigate local distinguishability of quantum states by use of the convex analysis about joint numerical range of operators on a Hilbert space. We show that any two orthogonal pure states are distinguishable by local operations and…
Coding theorems and (strong) converses for memoryless quantum communication channels and quantum sources are proved: for the quantum source the coding theorem is reviewed, and the strong converse proven. For classical information…
In this correspondence we present a new proof of Holevo's coding theorem for transmitting classical information through quantum channels, and its strong converse. The technique is largely inspired by Wolfowitz's combinatorial approach using…
This work investigates the general two-user Compound Broadcast Channel (BC) where an encoder wishes to transmit common and private messages to two receivers while being oblivious to two possible channel realizations controlling the…
Holographic systems require monogamous mutual information for validity of semiclassical geometry. This is encoded by the sign of the tripartite information ($I3$). We investigate the behaviour of $I3$ for all partitionings of systems in…
We study the entanglement of a multipartite quantum state. An inequality between the bipartite concurrence and the multipartite concurrence is obtained. More effective lower and upper bounds of the multipartite concurrence are obtained. By…
We study analytically and numerically decoding properties of finite rate hypergraph-product quantum LDPC codes obtained from random (3,4)-regular Gallager codes, with a simple model of independent X and Z errors. Several non-trival lower…
An orthogonal set of states in multipartite systems is called to be strong quantum nonlocality if it is locally irreducible under every bipartition of the subsystems…
Multipartite information principles are needed to understand nonlocal quantum correlations. Towards that end, we provide optimal bounds on genuine multipartite nonlocality for classes of THRESHOLD games using the LOCCG (Local Operations…
We explicate conditions under which, the two magnon state becomes highly entangled and is useful for several quantum communication protocols. This state, which is experimentally realizable in quantum dots using Heisenberg exchange…
Several recent works in communication systems have proposed to leverage the power of neural networks in the design of encoders and decoders. In this approach, these blocks can be tailored to maximize the transmission rate based on…
It is shown that while entanglement remains a significant factor in discriminating a set of mutually orthogonal entangled states perfectly by local operations and classical communication (LOCC), entanglement content is not. In particular,…
A state-dependent discrete memoryless multiple access channel is considered to model an integrated sensing and communication system, where two transmitters wish to convey messages to a receiver while simultaneously estimating the state…
We show how to use properties of the quantum conditional mutual information to obtain continuity bounds for information characteristics of quantum channels depending on their input dimension. First we prove tight estimates for variation of…
Motivated by a greedy approach for generating {\it{information stable}} processes, we prove a universal maximum likelihood (ML) upper bound on the capacities of discrete information stable channels, including the binary erasure channel…
We consider bipartite quantum state discrimination and present a quantum data-hiding scheme utilizing an orthogonal separable state ensemble. Using a bound on local minimum-error discrimination, we provide a sufficient condition for the…
In previous work, an ordering result was given for the symbolwise probability of error using general Markov channels, under iterative decoding of LDPC codes. In this paper, the ordering result is extended to mutual information, under the…
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…