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

arXiv:1412.0924 · Physical Review Letters

Bounding the Set of Finite Dimensional Quantum Correlations

Miguel Navascués, Tamás Vértesi

Published Jul 7, 2015• 94 citations
arXivHTMLPDF

Abstract

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.

DOI
10.1103/physrevlett.115.020501

Related papers

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

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

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

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.

•Jan 1, 2014•37 citations

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

Miguel Navascués, Stefano Pironio, Antonio Acín

We are interested in the problem of characterizing the correlations that arise when performing local measurements on separate quantum systems. In a previous work (Navascués 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.

arXiv:0803.4290•New Journal of Physics•Jul 8, 2008•724 citations

Upper Bounding Hilbert Space Dimensions which can Realize all the Quantum Correlations

Yasamin Panahi, Maria Ciudad Alañón, Daniel Centeno +4 more

We introduce novel upper bounds on the Hilbert space dimensions required to realize quantum correlations in Bell scenarios. We start by considering bipartite cases wherein one of the two parties has two settings and two outcomes. Regardless of the number of measurements and outcomes of the other party, the Hilbert space dimension of the first party can be limited to two while still achieving all convexly extremal quantum correlations. We then leverage Schmidt decomposition to show that the remaining party can losslessly also be restricted to a qubit Hilbert space. We then extend this idea to multipartite scenarios. We also adapt our results to provide upper bounds of local Hilbert space dimensions to achieve any quantum correlation, including convexly non-extremal correlations, by utilizing Caratheodory's theorem. Finally, we generalize our results to nonstandard Bell scenarios with communication. Taken together, our results fill in several previously unresolved aspects of the problem of determining sufficient Hilbert space dimensionality, expanding the collection of scenarios for which finite-dimensional quantum systems are known to be sufficient to reproduce any quantum correlation.

arXiv:2505.20519•May 26, 2025•0 citations

Enabling Computation of Correlation Bounds for Finite-Dimensional Quantum Systems via Symmetrization

Armin Tavakoli, Denis Rosset, Marc-Olivier Renou

We present a technique for reducing the computational requirements by several orders of magnitude in the evaluation of semidefinite relaxations for bounding the set of quantum correlations arising from finite-dimensional Hilbert spaces. The technique, which we make publicly available through a user-friendly software package, relies on the exploitation of symmetries present in the optimization problem to reduce the number of variables and the block sizes in semidefinite relaxations. It is widely applicable in problems encountered in quantum information theory and enables computations that were previously too demanding. We demonstrate its advantages and general applicability in several physical problems. In particular, we use it to robustly certify the nonprojectiveness of high-dimensional measurements in a black-box scenario based on self-tests of d-dimensional symmetric informationally complete positive-operator-valued measurements.

arXiv:1808.02412•Physical Review Letters•Feb 20, 2019•58 citations

Properties of dimension witnesses and their semidefinite programming relaxations

Piotr Mironowicz, Hong-Wei Li, Marcin Pawłowski

In this paper we develop a method for investigating semi-device-independent randomness expansion protocols that was introduced in Li et al. [H.-W. Li, P. Mironowicz, M. Paw\l{}owski, Z.-Q. Yin, Y.-C. Wu, S. Wang, W. Chen, H.-G. Hu, G.-C. Guo, and Z.-F. Han, Phys. Rev. A 87, 020302(R) (2013)]. This method allows us to lower bound, with semi-definite programming, the randomness obtained from random number generators based on dimension witnesses. We also investigate the robustness of some randomness expanders using this method. We show the role of an assumption about the trace of the measurement operators and a way to avoid it. The method is also generalized to systems of arbitrary dimension and for a more general form of dimension witnesses than in our previous paper. Finally, we introduce a procedure of dimension witness reduction, which can be used to obtain from an existing witness a new one with a higher amount of certifiable randomness. The presented methods find an application for experiments [J. Ahrens, P. Badziag, M. Pawlowski, M. Zukowski, and M. Bourennane, Phys. Rev. Lett. 112, 140401 (2014)].

arXiv:1405.3971•Physical Review A•Aug 20, 2014•22 citations
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.
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.
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.
We are interested in the problem of characterizing the correlations that arise when performing local measurements on separate quantum systems. In a previous work (Navascués 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.
We introduce novel upper bounds on the Hilbert space dimensions required to realize quantum correlations in Bell scenarios. We start by considering bipartite cases wherein one of the two parties has two settings and two outcomes. Regardless of the number of measurements and outcomes of the other party, the Hilbert space dimension of the first party can be limited to two while still achieving all convexly extremal quantum correlations. We then leverage Schmidt decomposition to show that the remaining party can losslessly also be restricted to a qubit Hilbert space. We then extend this idea to multipartite scenarios. We also adapt our results to provide upper bounds of local Hilbert space dimensions to achieve any quantum correlation, including convexly non-extremal correlations, by utilizing Caratheodory's theorem. Finally, we generalize our results to nonstandard Bell scenarios with communication. Taken together, our results fill in several previously unresolved aspects of the problem of determining sufficient Hilbert space dimensionality, expanding the collection of scenarios for which finite-dimensional quantum systems are known to be sufficient to reproduce any quantum correlation.
We present a technique for reducing the computational requirements by several orders of magnitude in the evaluation of semidefinite relaxations for bounding the set of quantum correlations arising from finite-dimensional Hilbert spaces. The technique, which we make publicly available through a user-friendly software package, relies on the exploitation of symmetries present in the optimization problem to reduce the number of variables and the block sizes in semidefinite relaxations. It is widely applicable in problems encountered in quantum information theory and enables computations that were previously too demanding. We demonstrate its advantages and general applicability in several physical problems. In particular, we use it to robustly certify the nonprojectiveness of high-dimensional measurements in a black-box scenario based on self-tests of d-dimensional symmetric informationally complete positive-operator-valued measurements.
In this paper we develop a method for investigating semi-device-independent randomness expansion protocols that was introduced in Li et al. [H.-W. Li, P. Mironowicz, M. Paw\l{}owski, Z.-Q. Yin, Y.-C. Wu, S. Wang, W. Chen, H.-G. Hu, G.-C. Guo, and Z.-F. Han, Phys. Rev. A 87, 020302(R) (2013)]. This method allows us to lower bound, with semi-definite programming, the randomness obtained from random number generators based on dimension witnesses. We also investigate the robustness of some randomness expanders using this method. We show the role of an assumption about the trace of the measurement operators and a way to avoid it. The method is also generalized to systems of arbitrary dimension and for a more general form of dimension witnesses than in our previous paper. Finally, we introduce a procedure of dimension witness reduction, which can be used to obtain from an existing witness a new one with a higher amount of certifiable randomness. The presented methods find an application for experiments [J. Ahrens, P. Badziag, M. Pawlowski, M. Zukowski, and M. Bourennane, Phys. Rev. Lett. 112, 140401 (2014)].