Related papers: LOCC protocols with bounded width per round optimi…
We theoretically investigate schemes to discriminate between two nonorthogonal quantum states given multiple copies. We consider a number of state discrimination schemes as applied to nonorthogonal, mixed states of a qubit. In particular,…
We consider optimal state discrimination in a general convex operational framework, so-called generalized probabilistic theories (GPTs), and present a general method of optimal discrimination by applying the complementarity problem from…
Distributed quantum information processing is essential for building quantum networks and enabling more extensive quantum computations. In this regime, several spatially separated parties share a multipartite quantum system, and the most…
Despite multipartite entanglement being a global property of a quantum state, a number of recent works have made it clear that it can be quantified using only local measurements. This is appealing because local measurements are the easiest…
A way to characterize quantum nonlocality is to see difference in the figure of merit between LOCC optimal protocol and globally optimal protocol in doing certain task, e.g., state estimation, state discrimination, cloning and broadcasting.…
This paper discusses distributed approaches for the solution of random convex programs (RCP). RCPs are convex optimization problems with a (usually large) number N of randomly extracted constraints; they arise in several applicative areas,…
We consider the actions of protocols involving local quantum operations and classical communication (LQCC) on a single system consisting of two separated qubits. We give a complete description of the orbits of the space of states under LQCC…
Machine learning algorithms in high-dimensional settings are highly susceptible to the influence of even a small fraction of structured outliers, making robust optimization techniques essential. In particular, within the…
Logconcave functions represent the current frontier of efficient algorithms for sampling, optimization and integration in R^n. Efficient sampling algorithms to sample according to a probability density (to which the other two problems can…
Deterministic discrimination of nonorthogonal states is forbidden by quantum measurement theory. However, if we do not want to succeed all the time, i.e. allow for inconclusive outcomes to occur, then unambiguous discrimination becomes…
Entanglement distillation, the process of converting weakly entangled states into maximally entangled ones using Local Operations and Classical Communication (LOCC), is pivotal for robust entanglement-assisted quantum information processing…
We consider deeply the relation between the orthogonality and the distinguishability of a set of arbitrary states (including multi-partite states). It is shown that if a set of arbitrary states can be distinguished by local operations and…
We revisit the problem of discriminating orthogonal quantum states within the local quantum operation and classical communication (LOCC) paradigm. Our particular focus is on the asymptotic situation where the parties have infinite resources…
Differentially private (DP) stochastic convex optimization (SCO) is a fundamental problem, where the goal is to approximately minimize the population risk with respect to a convex loss function, given a dataset of $n$ i.i.d. samples from a…
We consider the task of minimizing the sum of smooth and strongly convex functions stored in a decentralized manner across the nodes of a communication network whose links are allowed to change in time. We solve two fundamental problems for…
By incorporating the asymmetry of local protocols, i.e., some party has to start with a nontrivial measurement, into an operational method of detecting the local indistinguishability proposed by Horodecki {\it et al.} [Phys.Rev.Lett. 90…
We consider the problem of minimizing a $d$-dimensional Lipschitz convex function using a stochastic gradient oracle. We introduce and motivate a setting where the noise of the stochastic gradient is isotropic in that it is bounded in every…
An ensemble of product states is said to exhibit "quantum nonlocality without entanglement" if the states cannot be optimally discriminated by local operations and classical communication (LOCC). We show that this property can depend on the…
Suppose a set of $m$-partite, $m\geq3$, pure orthogonal fully separable states is given. We consider the task of distinguishing these states perfectly by local operations and classical communication (LOCC) in different $k$-partitions,…
More than two multipartite orthogonal states cannot always be discriminated (with certainty) if only local operations and classical communication (LOCC) are allowed. Using an existing inequality among the measures of entanglement, we show…