相关论文: Two convergent NPA-like hierarchies for the quantu…

It is difficult to establish an analytical criterion to identify the boundaries of quantum correlations, even for the simplest Bell scenario. Here, we briefly reviewed the plausible analytical criterion, and we found a way to confirm the…

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…

Bounding the correlations predicted by quantum theory is an important challenge in quantum information science. Today's leading approach is semidefinite programming relaxations, but existing methods still cannot account for many relevant…

An important problem in quantum information theory is that of bounding sets of correlations that arise from making local measurements on entangled states of arbitrary dimension. Currently, the best-known method to tackle this problem is the…

We introduce a hierarchy of tests satisfied by any probability distribution $P$ that represents the quantum correlations generated in prepare-and-measure (P\&M) quantum chain-shaped networks, assuming only the inner-product information of…

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…

The future progress of semi-device independent quantum information science depends crucially on our ability to bound the strength of the nonlocal correlations achievable with finite dimensional quantum resources. In this work, we…

We study the set of almost quantum correlations and their refinements in the simplest tripartite Bell scenario where each party is allowed to perform two dichotomic measurements. In contrast to its bipartite counterpart, we find that there…

We introduce a framework for studying non-locality and contextuality inspired by the path integral formulation of quantum theory. We prove that the existence of a strongly positive joint quantum measure -- the quantum analogue of a joint…

This thesis studies three topics in quantum computation and information: The approximability of quantum problems, quantum proof systems, and non-classical correlations in quantum systems. In the first area, we demonstrate a polynomial-time…

We present an adaptation of the NPA hierarchy to the setting of synchronous correlation matrices. Our adaptation improves upon the original NPA hierarchy by using smaller certificates and fewer constraints, although it can only be applied…

The question of whether complex numbers play a fundamental role in quantum theory has been debated since the inception of quantum mechanics. Recently, a feasible proposal to differentiate between real and complex quantum theories based on…

Recent advancements have expanded Hardy's nonlocality arguments into multisetting and multidimensional systems to enhance quantum correlations. In comparison with Hardy's nonlocal argument, Cabello's nonlocal argument (CNA) emerges as a…

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…

Recently Bell-type inequalities were introduced in Phys. Rev. A \textbf{85}, 032119 (2012) to analyze the correlations emerging in an entanglement swapping scenario characterized by independence of the two sources shared between three…

We extend classical methods of computational complexity to the realm of distributed computing, where they sometimes prove more effective than in their original context. Our focus is on decision problems in the LOCAL model, a setting in…

Recent works in foundations of quantum (field) theory and relativistic quantum information try to better grasp the interplay between the structure of quantum correlations and the constraints imposed by causality on physical operations.…

We present a general framework to exploit the symmetries present in the Navascu{\'e}s-Pironio-Ac{\'i}n semidefinite relaxations that approximate invariant noncommutative polynomial optimization problems. We put equal emphasis on the moment…

In this paper we study bipartite quantum correlations using techniques from tracial noncommutative polynomial optimization. We construct a hierarchy of semidefinite programming lower bounds on the minimal entanglement dimension of a…

The characterization of quantum correlations, being stronger than classical, yet weaker than those appearing in non-signaling models, still poses many riddles. In this work we show that the extent of binary correlations in a general class…