Related papers: On the communication complexity of establishing a …
A key goal of quantum communication is to determine the maximum number of bits shared between two quantum systems. An important example of this is in entanglement based quantum key distribution (QKD) schemes. A realistic treatment of this…
We analyse the problem of transmitting a number of unknown quantum states or one composite system in one go. We derive a lower bound on the performance of such process, measured in the entanglement fidelity. The obtained bound is…
Complementarity have been an intriguing feature of physical systems for a long time. In this work we establish a new kind of complimentary relations in the frame work of quantum information processing tasks. In broadcasting of entanglement…
Distributed computing is a standard way to scale up machine learning and data science algorithms to process large amounts of data. In such settings, avoiding communication amongst machines is paramount for achieving high performance. Rather…
An entangled two-mode coherent state is studied within the framework of $2\times 2$ dimensional Hilbert space. An entanglement concentration scheme based on joint Bell-state measurements is worked out. When the entangled coherent state is…
In protocols of distributed quantum information processing, a network of bilateral entanglement is a key resource for efficient communication and computation. We propose a model, efficient both in finite and infinite Hilbert spaces, that…
High-dimensional entangled quantum states improve the performance of quantum technologies compared to qubit-based approaches. In particular, they enable quantum communications with higher information capacities or enhanced imaging…
We study the effect of shared non-signaling correlations for the problem of simulating a channel using noiseless communication in the one-shot setting. For classical channels, we show how to round any non-signaling-assisted simulation…
We study the transport of quantum correlations across a chain of interacting spin-1/2 particles. As a quantitative figure of merit, we choose a symmetric version of quantum discord and compare it with the transported entanglement,…
Suppose that we have two similar files stored on different computers. We need to send the file from the first computer to the second one trying to minimize the number of bits transmitted. This article presents a survey of results known for…
We study the emergence of bipartite entanglement between a pair of spins weakly connected to the ends of a linear disordered $XY$ spin-1/2 channel. We analyze how their concurrence responds to structural and on-site fluctuations embodied by…
The concepts of quantum correlation complexity and quantum communication complexity were recently proposed to quantify the minimum amount of resources needed in generating bipartite classical or quantum states in the single-shot setting.…
We consider the "coded cooperative data exchange problem" for general graphs. In this problem, given a graph G=(V,E) representing clients in a broadcast network, each of which initially hold a (not necessarily disjoint) set of information…
We pose the fundamental question of communication properties of primitives irrespectively of their implementation. To illustrate the idea we introduce the concept of entanglement-swapping boxes, i.e. we consider any quantum operations which…
In this work we focus our attention on distributed optimization problems in the context where the communication time between the server and the workers is non-negligible. We obtain novel methods supporting bidirectional compression (both…
Encoding quantum information in photonic time-bin states is typically considered impractical for moving free-space quantum communication due to the difficulties with phase stabilization of distant quantum time-bin interferometers and…
By exploiting a symmetric scheme for coupling $N$ spin-1/2 constituents (the physical qubits) to states with total angular momentum $N/2-1$, we construct rotationally invariant logical qudits of dimension $d=N-1$. One can encode all qudit…
We show how to distribute with percentage success probabilities almost perfectly entangled qubit memory pairs over repeater channel segments of the order of the optical attenuation distance. In addition to some weak, dispersive light-matter…
We build, using group-theoretic methods, a general framework for approaching multi-particle entanglement. As far as entanglement is concerned, two states of n spin-1/2 particles are equivalent if they are on the same orbit of the group of…
We propose a scheme for encoding logical qubits in a subspace protected against collective rotations around the propagation axis using the polarization and transverse spatial degrees of freedom of single photons. This encoding allows for…