We are interested in the problem of characterizing the correlations that arise when performing local measurements on separate quantum systems. In a previous work [Phys. Rev. Lett. 98, 010401 (2007)], 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.
We consider optimization problems with polynomial inequality constraints in non-commuting variables. These non-commuting 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 g…
In this paper we propose a sequence of tests which gives a definitive test for checking $2\times M$ separability. The test is definitive in the sense that each test corresponds to checking membership in a cone, and that the closure of the union of all these cones consists exactly of {\it all} $2 \times M$ separable states. Membership in each single cone may be checked via semidefinite programming, and is thus a tractable problem. This sequential test comes about by considering the dual problem, the characterization of all positive maps acting ${\mathbb C}^{2 \times 2} \to {\mathbb C}^{M\times …
One of the most basic computational problems is the task of finding a desired item in an ordered list of N items. While the best classical algorithm for this problem uses log_2 N queries to the list, a quantum computer can solve the problem using a constant factor fewer queries. However, the precise value of this constant is unknown. By characterizing a class of quantum query algorithms for ordered search in terms of a semidefinite program, we find new quantum algorithms for small instances of the ordered search problem. Extending these algorithms to arbitrarily large instances using recursion…
We show that a certain tensor norm, the completely bounded norm, can be expressed by a semidefinite program. This tensor norm recently attracted attention in the field of quantum computing, where it was used by Arunachalam, Briët and Palazuelos for characterizing the quantum query complexity of Boolean functions. Combined with their results, we obtain a new characterization of the quantum query complexity through semidefinite programming. Using the duality theory of semidefinite programming we obtain a new type of certificates for large query complexity. We show that our class of certificates …
We show that higher order inter-group covariances involving even number of qubits are necessarily positive semidefinite for N qubit separable states, which are completely symmetric under permutations of the qubits. This identification leads to a family of sufficient conditions of inseparability based on the negativity of 2kth order inter-group covariance matrices of symmetric N-qubit systems. These conditions have a simple structure and detect entanglement in all even partitions of the symmetric multiqubit system. The observables involved are feasible experimental quantities and do not demand …
While entanglement is believed to be an important ingredient in understanding quantum many-body physics, the complexity of its characterization scales very unfavorably with the size of the system. Finding super-sets of the set of separable states that admit a simpler description has proven to be a fruitful approach in the bipartite setting. In this paper we discuss a systematic way of characterizing multiparticle entanglement via various relaxations. We furthermore describe an operational witness construction arising from such relaxations that is capable of detecting every entangled state. Fin…
We present a method to certify the presence of Bell correlations in experimentally observed statistics, and to obtain new Bell inequalities. Our approach is based on relaxing the conditions defining the set of correlations obeying a local hidden variable model, yielding a convergent hierarchy of semidefinite programs (SdP's). Because the size of these SdP's is independent of the number of parties involved, this technique allows to characterize correlations in many-body systems. As an example, we illustrate our method with the experimental data presented in [Science 352, 441 (2016)]
We study and extend the semidefinite programming (SDP) hierarchies introduced in [Phys. Rev. Lett. 115, 020501] for the characterization of the statistical correlations arising from finite dimensional quantum systems. First, we introduce the dimension-constrained noncommutative polynomial optimization (NPO) paradigm, where a number of polynomial inequalities are defined and optimization is conducted over all feasible operator representations of bounded dimensionality. Important problems in device independent and semi-device independent quantum information science can be formulated (or almost f…
We explore the possibility of entanglement detection in continuous variable systems by entanglement witnesses based on covariance matrices, constructible from random homodyne measurements. We propose new linear constraints characterizing the entanglement witnesses based on second moments, and use them in a semidefinite program providing the optimal entanglement test for given random measurements. We test the method on the class of squeezed vacuum states and study the efficiency of entanglement detection in general unknown covariance matrices.
Two convergent NPA-like hierarchies for the quantum bilocal scenario
Inria Paris-Saclay（巴黎萨克雷 Inria）；CPHT, Ecole polytechnique, Institut Polytechnique de Paris（巴黎综合理工学院，巴黎理工学院 CPHT）；LIX, Ecole polytechnique, Institut Polytechnique de Paris（巴黎综合理工学院，巴黎理工学院 LIX）；ICFO-Institut de Ciencies Fotoniques, The Barcelona Institute of Science and Technology（巴塞罗那科学技术研究所 ICFO-光子科学研究所）；Institute for Theoretical Physics, ETH Zürich（苏黎世联邦理工学院理论物理研究所）；Institute for Theoretical Physics, University of Cologne（科隆大学理论物理研究所）
Generalizing earlier work characterizing the quantum query complexity of computing a function of an unknown classical ``black box'' function drawn from some set of such black box functions, we investigate a more general quantum query model in which the goal is to compute functions of N by N ``black box'' unitary matrices drawn from a set of such matrices, a problem with applications to determining properties of quantum physical systems. We characterize the existence of an algorithm for such a query problem, with given error and number of queries, as equivalent to the feasibility of a certain s…
We present a new criterion that determines whether a fermionic state is a convex combination of pure Gaussian states. This criterion is complete and characterizes the set of convex-Gaussian states from the inside. If a state passes a program it is a convex-Gaussian state and any convex-Gaussian state can be approximated with arbitrary precision by states passing the criterion. The criterion is presented in the form of a sequence of solvable semidefinite programs. It is also complementary to the one developed by de Melo, Cwiklinski and Terhal, which aims at characterizing the set of convex-Gaus…
Moment Optimization in the Navascués-Pironio-Acín Hierarchy
ICFO - Institut de Ciencies Fotoniques, The Barcelona Institute of Science and Technology（ICFO光子科学研究所，巴塞罗那科学技术研究院）；Eurecat, Centre Tecnològic de Catalunya（Eurecat加泰罗尼亚技术中心）；École Polytechnique, Institut Polytechnique de Paris（巴黎综合理工学院，巴黎理工学院）；Institute for Theoretical Physics, ETH Zurich（苏黎世联邦理工学院理论物理研究所）；ICREA - Institució Catalana de Recerca i Estudis Avançats（加泰罗尼亚研究与高级研究学院）
A fundamental model of quantum computation is the programmable quantum gate array. This is a quantum processor that is fed by a program state that induces a corresponding quantum operation on input states. While being programmable, any finite-dimensional design of this model is known to be nonuniversal, meaning that the processor cannot perfectly simulate an arbitrary quantum channel over the input. Characterizing how close the simulation is and finding the optimal program state have been open questions for the past 20 years. Here, we answer these questions by showing that the search for the o…
Characterizing complex quantum systems is a vital task in quantum information science. Quantum tomography, the standard tool used for this purpose, uses a well-designed measurement record to reconstruct quantum states and processes. It is, however, notoriously inefficient. Recently, the classical signal reconstruction technique known as "compressed sensing" has been ported to quantum information science to overcome this challenge: accurate tomography can be achieved with substantially fewer measurement settings, thereby greatly enhancing the efficiency of quantum tomography. Here we show that …
Quantum inflation and source-transfer hierarchies are complete for tree networks
Inria, CPHT, LIX, CNRS, École Polytechnique, Institut Polytechnique de Paris（法国国家信息与自动化研究所，计算物理与理论化学中心，计算机科学与理论实验室，法国国家科学研究中心，巴黎综合理工学院，巴黎理工学院）；University of Ljubljana, Faculty of Mathematics and Physics（卢布尔雅那大学，数学与物理学院）；University of Primorska, Faculty of Mathematics, Natural Sciences and Information Technologies（沿海大学，数学、自然科学与信息技术学院）
