Related papers: The Generations of Classical Correlations via Quan…
We investigate whether it is possible to teleport the coherence of an unknown quantum state from Alice to Bob by communicating a lesser number of classical bits in comparison to what is required for teleporting an unknown quantum state. We…
We consider the task of distilling local purity from a noisy quantum state $\rho^{ABC}$, wherein we provide a protocol for three parties, Alice, Bob and Charlie, to distill local purity (at a rate $P$) from many independent copies of a…
We prove that the correlations present in a multipartite quantum state have an \emph{operational} quantum character as soon as the state does not simply encode a multipartite classical probability distribution, i.e. does not describe the…
In a variant of communication tasks, players cooperate in choosing their local strategies to compute a given task later, working separately. Utilizing quantum bits for communication and sharing entanglement between parties is a recognized…
We consider the problem of deciding if a given three-party entangled pure state can be converted, with a non-zero success probability, into a given two-party pure state through local quantum operations and classical communication. We show…
We study the one-way two-party communication complexity of Maximum Matching in the semi-robust setting where the edges of a maximum matching are randomly partitioned between Alice and Bob, but all remaining edges of the input graph are…
The quantum correlations, including entanglement and discord with its geometric measure, and classical correlation are studied for a bipartite partition of a open or closed quantum system. It is found that the purity of the initial state…
We derive a classification and a measure of classical- and quantum-correlation of multipartite qubit, qutrit, and in general, $n$-level systems, in terms of SU$(n)$ representations of density matrices. We compare the measure for the case of…
Although the foundations of quantum and classical physics are much different, it is often difficult to pinpoint which features of a particular system are intrinsically "quantum". Perhapse, the most clear-cut distinction between "classical"…
We study various types of multipartite states lying near the quantum-classical boundary. The class of so-called classical states are precisely those in which each party can perform a projective measurement to identify a locally held state…
In communication complexity the input of a function $f:X\times Y\rightarrow Z$ is distributed between two players Alice and Bob. If Alice knows only $x\in X$ and Bob only $y\in Y$, how much information must Alice and Bob share to be able to…
In correlation clustering, we are given $n$ objects together with a binary similarity score between each pair of them. The goal is to partition the objects into clusters so to minimise the disagreements with the scores. In this work we…
When the 4-state or the 6-state protocol of quantum cryptography is carried out on a noisy (i.e. realistic) quantum channel, then the raw key has to be processed to reduce the information of an adversary Eve down to an arbitrarily low…
We consider the pooling of quantum states when Alice and Bob both have one part of a tripartite system and, on the basis of measurements on their respective parts, each infers a quantum state for the third part S. We denote the conditioned…
Bell scenarios are multipartite scenarios that exclude any communication between parties. This constraint leads to a strict hierarchy of correlation sets in such scenarios, namely, classical, quantum, and nonsignaling. However, without any…
Building communication links among multiple users in a scalable and robust way is a key objective in achieving large-scale quantum networks. In realistic scenario, noise from the coexisting classical light is inevitable and can ultimately…
We prove that any perfect quantum strategy for the two-prover game encoding a constraint satisfaction problem (CSP) can be simulated via a perfect classical strategy with an extra classical communication channel, whose size depends only on…
An operational probabilistic theory where all systems are classical, and all pure states of composite systems are entangled, is constructed. The theory is endowed with a rule for composing an arbitrary number of systems, and with a…
We discuss the problem of coexistence of genuine quantum multipartite correlations and classical multipartite correlations. We introduce a postulate which any measure of genuine multipartite classical correlations should satisfy. We show…
Communication complexity is the amount of communication needed to compute a function when the function inputs are distributed over multiple parties. In its simplest form, one-way communication complexity, Alice and Bob compute a function…