Optimal conclusive discrimination of two states can be achieved locally

Optimal local discrimination of two multipartite pure states

In a recent paper, Walgate et al. (Phys. Rev. Lett. 85 (2000) 4972) demonstrated that any two orthogonal multipartite pure states can be optimally distinguished using only local operations. We utilise their result to show that this is true for any two multipartite pure states, in the sense of inconclusive discrimination. There are also certain regimes of conclusive discrimination for which the ...

What Can Be Computed Locally?

1 Summary The paper [1] deals with locality on several levels: It introduces a model for distributed computations and the notion of locally checkable labelings (LCLs). It proves properties about algorithms for locally checkable labeling problems. Two algorithms are analyzed in detail: One for the Weak Coloring problem and one for the Formal Dining Philosophers problem. The paper shows fundament...

What Can Be Verified Locally?

We are considering distributed network computing, in which computing entities are connected by a network modeled as a connected graph. These entities are located at the nodes of the graph, and they exchange information by message-passing along its edges. In this context, we are adopting the classical framework for local distributed decision, in which nodes must collectively decide whether their...

What Can be Sampled Locally?

The local computation of Linial [FOCS’87] and Naor and Stockmeyer [STOC’93] concerns with the question of whether a locally definable distributed computing problem can be solved locally: more specifically, for a given local CSP whether a CSP solution can be constructed by a distributed algorithm using local information. In this paper, we consider the problem of sampling a uniform CSP solution b...

Optimal discrimination of single-qubit mixed states