Related papers: Optimal dense coding with arbitrary pure entangled…
Quantum communication in general helps deter potential eavesdropping in the course of transmission of bits to enable secure communication between two or more parties. In this paper, we propose a novel quasi-deterministic secure quantum…
We study the maximum $k$-set coverage problem in the following distributed setting. A collection of sets $S_1,\ldots,S_m$ over a universe $[n]$ is partitioned across $p$ machines and the goal is to find $k$ sets whose union covers the most…
We study entanglement and other correlation properties of random states in high-dimensional bipartite systems. These correlations are quantified by parameters that are subject to the "concentration of measure" phenomenon, meaning that on a…
Entanglement detection is one of the most conventional tasks in quantum information processing. While most experimental demonstrations of high-dimensional entanglement rely on fidelity-based witnesses, these are powerless to detect…
We consider graph states of arbitrary number of particles undergoing generic decoherence. We present methods to obtain lower and upper bounds for the system's entanglement in terms of that of considerably smaller subsystems. For an…
A controlled quantum dense coding scheme is investigated with a four-particle non-maximal quantum channel. The amount of classical information is shown to be capable of being controlled by the controllers through adjustments of the local…
Consensus is a common method for computing a function of the data distributed among the nodes of a network. Of particular interest is distributed average consensus, whereby the nodes iteratively compute the sample average of the data stored…
The performance of maximum-likelihood (ML) decoded binary linear block codes is addressed via the derivation of tightened upper bounds on their decoding error probability. The upper bounds on the block and bit error probabilities are valid…
In this work, we consider the fundamental task of quantum state certification: given copies of an unknown quantum state $\rho$, test whether it matches some target state $\sigma$ or is $\epsilon$-far from it. For certifying $d$-dimensional…
Transmitting unknown quantum states to distant locations is crucial for distributed quantum information protocols. The seminal quantum teleportation scheme achieves this feat while requiring prior maximal entanglement between the sender and…
We study the super dense coding capacity in the presence of quantum channels with correlated noise. We investigate both the cases of unitary and non-unitary encoding. Pauli channels for arbitrary dimensions are treated explicitly. The super…
We investigate optimal encoding and retrieval of digital data, when the storage/communication medium is described by quantum mechanics. We assume an m-ary alphabet with arbitrary prior distribution, and an n-dimensional quantum system.…
Dynamics of coded information over Bloch channels is investigated for different values of the channel's parameters. We show that, the suppressing of the travelling coded information over Bloch channel can be increased by decreasing the…
We study the fully entangled fraction of quantum states. An upper bound is obtained for arbitrary dimensional bipartite systems. This bound is shown to be exact for the case of two-qubit systems. An inequality related the fully entangled…
We study maximally entangled states and fully entangled fraction in general d'\otimes d (d'\geq d) systems. Necessary and sufficient conditions for maximally entangled pure and mixed states are presented. As a natural generalization of the…
We study a continuous variable (CV) dense-coding protocol, originally proposed to employ a two-mode squeezed state, using a general two-mode Gaussian state as a quantum channel. We particularly obtain conditions to manifest quantum…
The efficacies of maximally and that of non-maximally entangled mixed states as teleportation channels have been studied. A new class of non-maximally entangled mixed states have been proposed also. Their advantages as quantum teleportation…
We propose upper and lower bounds on the maximum success probability for discriminating given quantum states. The proposed upper bound is obtained from a suboptimal solution to the dual problem of the corresponding optimal state…
An example is given of an interaction that produces an infinite amount of entanglement in an infinitely short time, but only a finite amount in longer times. The interaction arises from a standard Kerr nonlinearity and a 50/50 beamsplitter,…
The famous superdense coding protocol of Bennett and Wiesner demonstrates that it is possible to communicate two bits of classical information by sending only one qubit and using a shared EPR pair. Our first result is that an arbitrary…