Miguel Navascues

A convergent hierarchy of semidefinite programs characterizing the set of quantum correlations

We are interested in the problem of characterizing the correlations that arise when performing local measurements on separate quantum systems. In a previous work (Navascues et al 2007 Phys. Rev. Lett. 98 010401), we introduced an infinite hierarchy of conditions necessarily satisfied by any set of quantum correlations. Each of these conditions could be tested using semidefinite programming. We present here new results concerning this hierarchy. We prove in particular that it is complete, in the sense that any set of correlations satisfying every condition in the hierarchy has a quantum representation in terms of commuting measurements. Although our tests are conceived to rule out non- quantum correlations, and can in principle certify that a set of correlations is quantum only in the asymptotic limit where all tests are satisfied, we show that in some cases it is possible to conclude that a given set of correlations is quantum after performing only a finite number of tests. We provide a criterion to detect when such a situation arises, and we explain how to reconstruct the quantum states and measurement operators reproducing the given correlations. Finally, we present several applications of our approach. We use it in particular to bound the quantum violation of various Bell inequalities.

Bounding the set of quantum correlations

We introduce a hierarchy of conditions necessarily satisfied by any distribution P_{alphabeta} representing the probabilities for two separate observers to obtain outcomes alpha and beta when making local measurements on a shared quantum state. Each condition in this hierarchy is formulated as a semidefinite program. Among other applications, our approach can be used to obtain upper bounds on the quantum violation of an arbitrary Bell inequality. It yields, for instance, tight bounds for the violations of the Collins et al. inequalities.

Optimality of Gaussian Attacks in Continuous Variable Quantum Cryptography

We analyze the asymptotic security of the family of Gaussian modulated quantum key distribution protocols for continuous-variables systems. We prove that the Gaussian unitary attack is optimal for all the considered bounds on the key rate when the first and second momenta of the canonical variables involved are known by the honest parties.

A Glance beyond the quantum model

One of the most important problems in physics is to reconcile quantum mechanics with general relativity, and some authors have suggested that this may be realized at the expense of having to drop the quantum formalism in favour of a more general theory. Here, we propose a mechanism to make general claims on the microscopic structure of the Universe by postulating that any post-quantum theory should recover classical physics in the macroscopic limit. We use this mechanism to bound the strength of correlations between distant observers in any physical theory. Although several quantum limits are recovered, such as the set of two-point quantum correlators, our results suggest that there exist plausible microscopic theories of Nature that predict correlations impossible to reproduce in any quantum mechanical system.

Quantifying Einstein-Podolsky-Rosen steering.

Einstein-Podolsky-Rosen steering is a form of bipartite quantum correlation that is intermediate between entanglement and Bell nonlocality. It allows for entanglement certification when the measurements performed by one of the parties are not characterized (or are untrusted) and has applications in quantum key distribution. Despite its foundational and applied importance, Einstein-Podolsky-Rosen steering lacks a quantitative assessment. Here we propose a way of quantifying this phenomenon and use it to study the steerability of several quantum states. In particular, we show that every pure entangled state is maximally steerable and the projector onto the antisymmetric subspace is maximally steerable for all dimensions; we provide a new example of one-way steering and give strong support that states with positive-partial transposition are not steerable.

Convergent Relaxations of Polynomial Optimization Problems with Noncommuting Variables

We consider optimization problems with polynomial inequality constraints in noncommuting variables. These noncommuting variables are viewed as bounded operators on a Hilbert space whose dimension is not fixed and the associated polynomial inequalities as semidefinite positivity constraints. Such problems arise naturally in quantum theory and quantum information science. To solve them, we introduce a hierarchy of semidefinite programming relaxations which generates a monotone sequence of lower bounds that converges to the optimal solution. We also introduce a criterion to detect whether the global optimum is reached at a given relaxation step and show how to extract a global optimizer from the solution of the corresponding semidefinite programming problem.

Security bounds for continuous variables quantum key distribution.

Security bounds for key distribution protocols using coherent and squeezed states and homodyne measurements are presented. These bounds refer to (i) general attacks and (ii) collective attacks where Eve applies the optimal individual interaction to the sent states, but delays her measurement until the end of the reconciliation process. For the case of a lossy line and coherent states, it is first proven that a secure key distribution is possible up to 1.9 dB of losses. For the second scenario, the security bounds are the same as for the completely incoherent attack.

Operational framework for nonlocality.

Because of the importance of entanglement for quantum information purposes, a framework has been developed for its characterization and quantification as a resource based on the following operational principle: entanglement among N parties cannot be created by local operations and classical communication, even when N-1 parties collaborate. More recently, nonlocality has been identified as another resource, alternative to entanglement and necessary for device-independent quantum information protocols. We introduce an operational framework for nonlocality based on a similar principle: nonlocality among N parties cannot be created by local operations and allowed classical communication even when N-1 parties collaborate. We then show that the standard definition of multipartite nonlocality, due to Svetlichny, is inconsistent with this operational approach: according to it, genuine tripartite nonlocality could be created by two collaborating parties. We finally discuss alternative definitions for which consistency is recovered.

Quantum correlations require multipartite information principles.

Identifying which correlations among distant observers are possible within our current description of nature, based on quantum mechanics, is a fundamental problem in physics. Recently, information concepts have been proposed as the key ingredient to characterize the set of quantum correlations. Novel information principles, such as information causality or nontrivial communication complexity, have been introduced in this context and successfully applied to some concrete scenarios. We show in this work a fundamental limitation of this approach: no principle based on bipartite information concepts is able to singleout the set of quantum correlations for an arbitrary number of parties. Our results reflect the intricate structure of quantum correlations and imply that new and intrinsically multipartite information concepts are needed for their full understanding.

Power of symmetric extensions for entanglement detection

In this paper, we present new progress on the study of the symmetric extension criterion for separability. First, we show that a perturbation of order O(1/N) is sufficient and, in general, necessary to destroy the entanglement of any state admitting an N Bose symmetric extension. On the other hand, the minimum amount of local noise necessary to induce separability on states arising from N Bose symmetric extensions with Positive Partial Transpose (PPT) decreases at least as fast as O(1/N^2). From these results, we derive upper bounds on the time and space complexity of the weak membership problem of separability when attacked via algorithms that search for PPT symmetric extensions. Finally, we show how to estimate the error we incur when we approximate the set of separable states by the set of (PPT) N -extendable quantum states in order to compute the maximum average fidelity in pure state estimation problems, the maximal output purity of quantum channels, and the geometric measure of entanglement.