Related papers: Communication Complexity Reduction from Globally U…
Efficient distributed computing offers a scalable strategy for solving resource-demanding tasks such as parallel computation and circuit optimisation. Crucially, the communication overhead introduced by the allotment process should be…
We consider properties of states of many qubits, which arise after sending certain entangled states via various noisy channels (white noise, coloured noise, local depolarization, dephasing and amplitude damping). Entanglement of these…
Simulation tasks are insightful tools to compare information-theoretic resources. Considering a generalization of usual Bell scenarios where external quantum inputs are provided to the parties, we show that any entangled quantum state…
It is known from Bell's theorem that quantum predictions for some entangled states cannot be mimicked using local hidden variable (LHV) models. From a computer science perspective, LHV models may be interpreted as classical computers…
Entanglement is a powerful resource for processing quantum information. In this context pure, maximally entangled states have received considerable attention. In the case of bipartite qubit-systems the four orthonormal Bell-states are of…
We prove that for every Bell's inequality and for a broad class of protocols, there always exists a multi-party communication complexity problem, for which the protocol assisted by states which violate the inequality is more efficient than…
States that strongly violate Bell's inequalities are required in many quantum informational protocols as, for example, in cryptography, secret sharing and the reduction of communication complexity. We investigate families of such states…
We review the status of Bell's inequalities in quantum information, stressing mainly the links with quantum key distribution and distillation of entanglement. We also prove that for all the eavesdropping attacks using one qubit, and for a…
Maximally entangled states are a key resource in many quantum communication and computation tasks, and their certification is a crucial element to guarantee the desired functionality. We introduce collective strategies for the efficient,…
Bell inequalities constitute a key tool in quantum information theory: they not only allow one to reveal nonlocality in composite quantum systems, but, more importantly, they can be used to certify relevant properties thereof. We provide a…
Bell inequalities have traditionally been used to demonstrate that quantum theory is nonlocal, in the sense that there exist correlations generated from composite quantum states that cannot be explained by means of local hidden variables.…
We formulate a two-party communication complexity problem and present its quantum solution that exploits the entanglement between two qutrits. We prove that for a broad class of protocols the entangled state can enhance the efficiency of…
We consider a variation of the multi-party communication complexity scenario where the parties are supplied with an extra resource: particles in an entangled quantum state. We show that, although a prior quantum entanglement cannot be used…
Quantum information science has profoundly changed the ways we understand, store, and process information. A major challenge in this field is to look for an efficient means for classifying quantum state. For instance, one may want to…
A set of Bell inequalities classifying the quantum entanglement of four-qubit states is presented. These inequalities involve only two measurement settings per observer and can characterize fully separable, bi-separable and tri-separable…
We introduce a set of Bell inequalities for a three-qubit system. Each inequality within this set is violated by all generalized GHZ states. More entangled a generalized GHZ state is, more will be the violation. This establishes a relation…
Identifying Bell states without destroying it is frequently dealt with in nowadays quantum technologies such as quantum communication and quantum computing. In practice, quantum entangled states are often distributed among distant parties,…
Communication complexity problems (CCPs) are tasks in which separated parties attempt to compute a function whose inputs are distributed among the parties. Their communication is limited so that not all inputs can be sent. We show that…
Deviations from classical physics when distant quantum systems become correlated are interesting both fundamentally and operationally. There exist situations where the correlations enable collaborative tasks that are impossible within the…
Quantum correlations which violate a Bell inequality are presumed to power better-than-classical protocols for solving communication complexity problems (CCPs). How general is this statement? We show that violations of correlation-type Bell…