Related papers: Quantum Compression for Distributed Entanglement
The distribution of entanglement of typical multiparty quantum states is not uniform over the range of the measure utilized for quantifying the entanglement. We intend to find the response to disorder in the state parameters on this…
In the past decades, quantum entanglement has been recognized to be the basic resource in quantum information theory. A fundamental need is then the understanding its qualification and its quantification: Is the quantum state entangled, and…
We prove a powerful theorem for tripartite remote entanglement distribution protocols that establishes an upper bound on the amount of entanglement of formation that can be created between two single-qubit nodes of a quantum network. Our…
In this paper we propose a technique for distributing entanglement in architectures in which interactions between pairs of qubits are constrained to a fixed network $G$. This allows for two-qubit operations to be performed between qubits…
We investigate the relation between the amount of entanglement localized on a chosen subsystem of a multi-qubit system via local measurements on the rest of the system, and the bipartite entanglement that is lost during this measurement…
A major challenge of today's quantum communication systems lies in the transmission of quantum information with high rates over long distances in the presence of unavoidable losses. Thereby the achievable quantum communication rate is…
Coherent information quantifies the achievable rate of the reliable quantum information transmission through a communication channel. Use of the correlated quantum states instead of the factorized ones may result in an increase in the…
Entanglement is a striking feature of quantum mechanics, and it has a key property called unextendibility. In this paper, we present a framework for quantifying and investigating the unextendibility of general bipartite quantum states.…
We investigate the effect of noisy channels in a classical information transfer through a multipartite state which acts as a substrate for the distributed quantum dense coding protocol between several senders and two receivers. The…
The Schmidt coefficients capture all entanglement properties of a pure bipartite state and therefore determine its usefulness for quantum information processing. While the quantification of the corresponding properties in mixed states is…
Genuine entanglement is the strongest form of multipartite entanglement. Genuinely entangled pure states contain entanglement in every bipartition and as such can be regarded as a valuable resource in the protocols of quantum information…
We consider quantum key distribution (QKD) and entanglement distribution using a single-sender multiple-receiver pure-loss bosonic broadcast channel. We determine the unconstrained capacity region for the distillation of bipartite…
Distributed computing, involving multiple servers collaborating on designated computations, faces a critical challenge in optimizing inter-server communication -- an issue central to the study of communication complexity. Quantum resources…
We investigate a family of qubit-oscillator states as resources for hybrid quantum communication. They result from a mechanism of qubit-controlled displacement on the oscillator. For large displacements, we obtain analytical formulas for…
We present a scheme of probabilistic dense coding via a quantum channel of non-maximally entangled three-particle state. The quantum dense coding will be succeeded with a certain probability if the sender introduces an auxiliary particle…
Ideal dense coding protocols allow one to use prior maximal entanglement to send two bits of classical information by the physical transfer of a single encoded qubit. We investigate the case when the prior entanglement is not maximal and…
One of the fundamental tasks in quantum information theory is quantum data compression, which can be realized via quantum autoencoders that first compress quantum states to low-dimensional ones and then recover to the original ones with a…
The goal of this thesis is to study the compression problems arising in distributed computing systematically. In the first part of the thesis, we study gradient compression for distributed first-order optimization. We begin by establishing…
In this article we study lossless compression of strings of pure quantum states of indeterminate-length quantum codes which were introduced by Schumacher and Westmoreland. Past work has assumed that the strings of quantum data are prepared…
Distributed quantum computation is often proposed to increase the scalability of quantum hardware, as it reduces cooperative noise and requisite connectivity by sharing quantum information between distant quantum devices. However, such…