Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Characterization of Quantum Correlations with Local Dimension Constraints and Its Device-Independent Applications

Miguel Navascués, de la, Torre Gonzalo, Tamás Vértesi

Published Jan 1, 2014• 37 citations
OpenAlex

Abstract

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 characterize quantum nonlocality under local dimension constraints via a complete hierarchy of semidefinite programming relaxations. In the bipartite case, we find that the first level of the hierarchy returns non-trivial bounds in all cases considered, allowing to study nonlocality scenarios with four measurement settings on one side and twelve (12) on the other in a normal desktop. In the tripartite case, we apply the hierarchy to derive a Bell-type inequality that can only be violated when each of the three parties has local dimension greater than two, hence certifying three-dimensional tripartite entanglement in a device independent way. Finally, we show how the new method can be trivially modified to detect non-separable measurements in two-qubit scenarios.

Related papers

Bounding sets of sequential quantum correlations and device-independent randomness certification

Joseph Bowles, Flavio Baccari, Alexia Salavrakos

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 NPA hierarchy; an infinite sequence of semidefinite programs that provides increasingly tighter outer approximations to the desired set of correlations. In this work we consider a more general scenario in which one performs sequences of local measurements on an entangled state of arbitrary dimension. We show that a simple adaptation of the original NPA hierarchy provides an analogous hierarchy for this scenario, with comparable resource requirements and convergence properties. We then use the method to tackle some problems in device-independent quantum information. First, we show how one can robustly certify over 2.3 bits of device-independent local randomness from a two-quibt state using a sequence of measurements, going beyond the theoretical maximum of two bits that can be achieved with non-sequential measurements. Finally, we show tight upper bounds to two previously defined tasks in sequential Bell test scenarios.

arXiv:1911.11056•Quantum•Oct 19, 2020•36 citations

Characterizing finite-dimensional quantum behavior

Miguel Navascués, Adrien Feix, Mateus Araújo +1 more

We study and extend the semidefinite programming (SDP) hierarchies introduced in Navascu\'es and V\'ertesi [Phys. Rev. Lett. 115, 020501 (2015)] 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 formulated) in this framework. We present effective SDP hierarchies to attack the general dimension-constrained NPO problem (and related ones) and prove their asymptotic convergence. To illustrate the power of these relaxations, we use them to derive a number of dimension witnesses for temporal and Bell-type correlation scenarios, and also to bound the probability of success of quantum random access codes.

arXiv:1507.07521•Physical Review A•Oct 21, 2015•46 citations

Hybrid no-signaling-quantum correlations

Michał Banacki, Piotr Mironowicz, Ravishankar Ramanathan +1 more

Abstract Fundamental investigations in non-locality have shown that while the no-signaling principle alone is not sufficient to single out the set of quantum non-local correlations, local quantum mechanics and no-signaling together exactly reproduce the set of quantum correlations in the two-party Bell scenario. Here, we introduce and study an intermediate hybrid no-signaling quantum set of non-local correlations that we term HNSQ in the multi-party Bell scenario where some subsystems are locally quantum while the remaining subsystems are only constrained by the no-signaling principle. Specifically, the set HNSQ is a super-quantum set of correlations derived from no-signaling assemblages by performing quantum measurements on the trusted subsystems. We show that in contrast to the set NS of no-signaling behaviors, there exist extreme points of HNSQ in the tripartite Bell scenario that admit quantum realization. As a tool for optimization over the set HNSQ, we introduce an outer hierarchy of semi-definite programming approximations to the set following an approach put forward by Doherty–Parrilo–Spedalieri. We perform an extensive numerical analysis of the maximal violation of the facet Bell inequalities in the three-party binary input–output scenario and study the corresponding self-testing properties. In contrast to the usual no-signaling correlations, the new set allows for simple security proofs of (one-sided)-device-independent applications against super-quantum adversaries.

arXiv:2107.06878•New Journal of Physics•Jul 8, 2022•0 citations

Measurement dependent locality

Gilles Pütz, Nicolas Gisin

The demonstration and use of Bell-nonlocality, a concept that is fundamentally striking and is at the core of applications in device independent quantum information processing, relies heavily on the assumption of measurement independence, also called the assumption of free choice. The latter cannot be verified or guaranteed. In this paper, we consider a relaxation of the measurement independence assumption. We briefly review the results of Phys. Rev. Lett. 113, 190402 (2014), which show that with our relaxation, the set of so-called measurement dependent local (MDL) correlations is a polytope, i.e. it can be fully described using a finite set of linear inequalities. Here we analyze this polytope, first in the simplest case of 2 parties with binary inputs and outputs, for which we give a full characterization. We show that partially entangled states are preferable to the maximally entangled state when dealing with measurement dependence in this scenario. We further present a method which transforms any Bell-inequality into an MDL inequality and give valid inequalities for the case of arbitrary number of parties as well as one for arbitrary number of inputs. We introduce the assumption of independent sources in the measurement dependence scenario and give a full analysis for the bipartite scenario with binary inputs and outputs. Finally, we establish a link between measurement dependence and another strong hindrance in certifying nonlocal correlations: nondetection events.

arXiv:1510.09087•New Journal of Physics•May 6, 2016•46 citations

Bounding the Set of Finite Dimensional Quantum Correlations

Miguel Navascués, Tamás Vértesi

We describe a simple method to derive high performance semidefinite programing relaxations for optimizations over complex and real operator algebras in finite dimensional Hilbert spaces. The method is very flexible, easy to program, and allows the user to assess the behavior of finite dimensional quantum systems in a number of interesting setups. We use this method to bound the strength of quantum nonlocality in Bell scenarios where the dimension of the parties is bounded from above. We derive new results in quantum communication complexity and prove the soundness of the prepare-and-measure dimension witnesses introduced in Gallego et al., Phys. Rev. Lett. 105, 230501 (2010). Finally, we propose a new dimension witness that can distinguish between classical, real, and complex two-level systems.

arXiv:1412.0924•Physical Review Letters•Jul 7, 2015•94 citations

Device-independent certification of tripartite quantum networks with bilocal Bell inequalities

Patryk Michalski, Arturo Konderak, Remigiusz Augusiak

While quantum networks have been extensively studied as a natural extension of the standard Bell scenario with a richer correlation structure, general constructions of nonlinear Bell inequalities with self-testing properties are still largely lacking. In this work, we present a general method for constructing such inequalities in the simplest network scenario, in which two independent sources distribute bipartite quantum states to three spatially separated observers. These inequalities allow for arbitrary numbers of binary measurements and are maximally violated by maximally entangled states of the corresponding local dimensions together with sets of pairwise anticommuting Clifford observables. Importantly, their maximal quantum values can be determined analytically, which makes them particularly promising for device-independent applications. In particular, we prove that these Bell inequalities can be used to device-independently certify the underlying quantum network, including both the quantum states produced by the sources and the observables measured by all parties. To the best of our knowledge, this is the first self-testing result for quantum networks that relies solely on the maximal violation of a nonlocality witness.

quant-pharXiv:2607.09933•Jul 14, 2026•0 citations
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 characterize quantum nonlocality under local dimension constraints via a complete hierarchy of semidefinite programming relaxations. In the bipartite case, we find that the first level of the hierarchy returns non-trivial bounds in all cases considered, allowing to study nonlocality scenarios with four measurement settings on one side and twelve (12) on the other in a normal desktop. In the tripartite case, we apply the hierarchy to derive a Bell-type inequality that can only be violated when each of the three parties has local dimension greater than two, hence certifying three-dimensional tripartite entanglement in a device independent way. Finally, we show how the new method can be trivially modified to detect non-separable measurements in two-qubit scenarios.
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 NPA hierarchy; an infinite sequence of semidefinite programs that provides increasingly tighter outer approximations to the desired set of correlations. In this work we consider a more general scenario in which one performs sequences of local measurements on an entangled state of arbitrary dimension. We show that a simple adaptation of the original NPA hierarchy provides an analogous hierarchy for this scenario, with comparable resource requirements and convergence properties. We then use the method to tackle some problems in device-independent quantum information. First, we show how one can robustly certify over 2.3 bits of device-independent local randomness from a two-quibt state using a sequence of measurements, going beyond the theoretical maximum of two bits that can be achieved with non-sequential measurements. Finally, we show tight upper bounds to two previously defined tasks in sequential Bell test scenarios.
We study and extend the semidefinite programming (SDP) hierarchies introduced in Navascu\'es and V\'ertesi [Phys. Rev. Lett. 115, 020501 (2015)] 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 formulated) in this framework. We present effective SDP hierarchies to attack the general dimension-constrained NPO problem (and related ones) and prove their asymptotic convergence. To illustrate the power of these relaxations, we use them to derive a number of dimension witnesses for temporal and Bell-type correlation scenarios, and also to bound the probability of success of quantum random access codes.
Abstract Fundamental investigations in non-locality have shown that while the no-signaling principle alone is not sufficient to single out the set of quantum non-local correlations, local quantum mechanics and no-signaling together exactly reproduce the set of quantum correlations in the two-party Bell scenario. Here, we introduce and study an intermediate hybrid no-signaling quantum set of non-local correlations that we term HNSQ in the multi-party Bell scenario where some subsystems are locally quantum while the remaining subsystems are only constrained by the no-signaling principle. Specifically, the set HNSQ is a super-quantum set of correlations derived from no-signaling assemblages by performing quantum measurements on the trusted subsystems. We show that in contrast to the set NS of no-signaling behaviors, there exist extreme points of HNSQ in the tripartite Bell scenario that admit quantum realization. As a tool for optimization over the set HNSQ, we introduce an outer hierarchy of semi-definite programming approximations to the set following an approach put forward by Doherty–Parrilo–Spedalieri. We perform an extensive numerical analysis of the maximal violation of the facet Bell inequalities in the three-party binary input–output scenario and study the corresponding self-testing properties. In contrast to the usual no-signaling correlations, the new set allows for simple security proofs of (one-sided)-device-independent applications against super-quantum adversaries.
The demonstration and use of Bell-nonlocality, a concept that is fundamentally striking and is at the core of applications in device independent quantum information processing, relies heavily on the assumption of measurement independence, also called the assumption of free choice. The latter cannot be verified or guaranteed. In this paper, we consider a relaxation of the measurement independence assumption. We briefly review the results of Phys. Rev. Lett. 113, 190402 (2014), which show that with our relaxation, the set of so-called measurement dependent local (MDL) correlations is a polytope, i.e. it can be fully described using a finite set of linear inequalities. Here we analyze this polytope, first in the simplest case of 2 parties with binary inputs and outputs, for which we give a full characterization. We show that partially entangled states are preferable to the maximally entangled state when dealing with measurement dependence in this scenario. We further present a method which transforms any Bell-inequality into an MDL inequality and give valid inequalities for the case of arbitrary number of parties as well as one for arbitrary number of inputs. We introduce the assumption of independent sources in the measurement dependence scenario and give a full analysis for the bipartite scenario with binary inputs and outputs. Finally, we establish a link between measurement dependence and another strong hindrance in certifying nonlocal correlations: nondetection events.
We describe a simple method to derive high performance semidefinite programing relaxations for optimizations over complex and real operator algebras in finite dimensional Hilbert spaces. The method is very flexible, easy to program, and allows the user to assess the behavior of finite dimensional quantum systems in a number of interesting setups. We use this method to bound the strength of quantum nonlocality in Bell scenarios where the dimension of the parties is bounded from above. We derive new results in quantum communication complexity and prove the soundness of the prepare-and-measure dimension witnesses introduced in Gallego et al., Phys. Rev. Lett. 105, 230501 (2010). Finally, we propose a new dimension witness that can distinguish between classical, real, and complex two-level systems.
While quantum networks have been extensively studied as a natural extension of the standard Bell scenario with a richer correlation structure, general constructions of nonlinear Bell inequalities with self-testing properties are still largely lacking. In this work, we present a general method for constructing such inequalities in the simplest network scenario, in which two independent sources distribute bipartite quantum states to three spatially separated observers. These inequalities allow for arbitrary numbers of binary measurements and are maximally violated by maximally entangled states of the corresponding local dimensions together with sets of pairwise anticommuting Clifford observables. Importantly, their maximal quantum values can be determined analytically, which makes them particularly promising for device-independent applications. In particular, we prove that these Bell inequalities can be used to device-independently certify the underlying quantum network, including both the quantum states produced by the sources and the observables measured by all parties. To the best of our knowledge, this is the first self-testing result for quantum networks that relies solely on the maximal violation of a nonlocality witness.