Related papers: The Generations of Classical Correlations via Quan…
Two QKD protocols with limited classical Bob who performs only limited classical operations (preparing a (fresh) qubit in the classical basis and send it or doing nothing) are presented and are proved completely robust. As limited classical…
The notion of distance defined on the set of states of a composite quantum system can be used to quantify total, quantum and classical correlations in a unifying way. We provide new closed formulae for classical and total correlations of…
A classical decision tree is completely based on splitting measures, which utilize the occurrence of random events in correspondence to its class labels in order to optimally segregate datasets. However, the splitting measures are based on…
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…
In this paper we study the problem of correlation clustering under fairness constraints. In the classic correlation clustering problem, we are given a complete graph where each edge is labeled positive or negative. The goal is to obtain a…
We reveal key connections between non-locality and advantage in correlation-assisted classical communication. First, using the wire-cutting technique, we provide a Bell inequality tailored to any correlation-assisted bounded classical…
We prove the condition for local trace-preserving channels to create quantum correlation from initially classical states. For two-qubit states, the necessary and sufficient condition for a channel that cannot create quantum correlation in…
The k-pair problem in network coding theory asks to send k messages simultaneously between k source-target pairs over a directed acyclic graph. In a previous paper [ICALP 2009, Part I, pages 622--633] the present authors showed that if a…
In the task of assisted coherence distillation via the set of operations X, where X is either local incoherent operations and classical communication (LICC), local quantum-incoherent operations and classical communication (LQICC), separable…
While efficient algorithms are known for solving many important problems related to groups, no efficient algorithm is known for determining whether two arbitrary groups are isomorphic. The particular case of 2-nilpotent groups, a special…
We present a method that allows the study of classical and quantum correlations in networks with causally-independent parties, such as the scenario underlying entanglement swapping. By imposing relaxations of factorization constraints in a…
Quantum properties of correlations have a key role in disparate fields of physics, from quantum information processing, to quantum foundations, to strongly correlated systems. We tackle a specific aspect of the fundamental quantum marginal…
Bell-CHSH-like inequalities have been very successful in benchmarking {\it spatial} quantum correlations. However, as this paper illustrates, they are in general not sufficient for benchmarking {\it temporal} quantum correlations. To show…
In a recent paper (Phys. Rev. Lett. 109, 160501 (2012). arXiv:1201.0849), it is claimed that any quantum protocol for classical two-sided computation between Alice and Bob can be proven completely insecure for Alice if it is secure against…
We analyze utility of communication channels in absence of any short of quantum or classical correlation shared between the sender and the receiver. To this aim, we propose a class of two-party communication games, and show that the games…
We present an optimal scheme to realize the transformations between single copies of two bipartite entangled states without classical communication between the sharing parties. The scheme achieves the upper bound for the success…
In this paper we consider the following question: how many bits of classical communication and shared random bits are necessary to simulate a quantum protocol involving Alice and Bob where they share k entangled quantum bits and do not…
Lin and Lin have recently shown how starting with a classical query algorithm (decision tree) for a function, we may find upper bounds on its quantum query complexity. More precisely, they have shown that given a decision tree for a…
A school of thought contends that human decision making exhibits quantum-like logic. While it is not known whether the brain may indeed be driven by actual quantum mechanisms, some researchers suggest that the decision logic is…
In this work we study the sets of two-party correlations generated from a Bell scenario involving two spatially separated systems with respect to various physical models. We show that the sets of classical, quantum, no-signaling and…