Bounding the Set of Finite Dimensional Quantum Correlations.

  title={Bounding the Set of Finite Dimensional Quantum Correlations.},
  author={Miguel Navascu{\'e}s and Tam{\'a}s V{\'e}rtesi},
  journal={Physical review letters},
  volume={115 2},
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… 

Tables from this paper

Enabling Computation of Correlation Bounds for Finite-Dimensional Quantum Systems via Symmetrization.
This work uses 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 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.
Characterizing finite-dimensional quantum behavior
The semidefinite programming hierarchies introduced in Navascu and Vertesi are used 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.
Bounds on entanglement dimensions and quantum graph parameters via noncommutative polynomial optimization
A hierarchy of semidefinite programming lower bounds is constructed and convergence to a new parameter is shown, which measures the amount of entanglement needed to reproduce a quantum correlation when access to shared randomness is free.
Bounding sets of sequential quantum correlations and device-independent randomness certification
This work shows 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.
Identifying nonconvexity in the sets of limited-dimension quantum correlations
Quantum theory is known to be nonlocal in the sense that separated parties can perform measurements on a shared quantum state to obtain correlated probability distributions, which cannot be achieved
Bounding and Simulating Contextual Correlations in Quantum Theory
The information cost of simulating contextuality is introduced, which quantifies the additional information required to simulate contextual correlations in either classical or quantum models, and it is shown that the simulation cost can be efficiently bounded using a variant of the hierarchy of semidefinite relaxations.
Informationally restricted quantum correlations
It is shown that quantum communication carrying $\log d$ bits of information is at least as strong a resource as $d$-dimensional classical communication assisted by pre-shared entanglement, and limiting information rather than dimension leads to stronger quantum correlations.
A general bound for the dimension of quantum behaviours in the prepare-and-measure scenario
  • J. D. de Vicente
  • Computer Science
    Journal of Physics A: Mathematical and Theoretical
  • 2019
A general lower bound on the dimension necessary to observe arbitrary quantum behaviours in this scenario based on simple matrix analysis is provided, even if the preparer and measurer share randomness.
High-Dimensional Quantum Communication Complexity beyond Strategies Based on Bell's Theorem.
This work focuses on a family of CCPs, based on facet Bell inequalities, and finds that the advantages are tied to the use of measurements that are not rank-one projective, and provides an experimental semi-device-independent falsification of such measurements in Hilbert space dimension six.
Quantum-Inspired Hierarchy for Rank-Constrained Optimization
It is proved that a large class of rank-constrained semidefinite programs can be written as a convex optimization over separable quantum states, and consequently, a complete hierarchy of semideFinite programs are constructed for solving the original problem.


Quantum computation and quantum information
  • T. Paul
  • Physics
    Mathematical Structures in Computer Science
  • 2007
This special issue of Mathematical Structures in Computer Science contains several contributions related to the modern field of Quantum Information and Quantum Computing. The first two papers deal
YALMIP : a toolbox for modeling and optimization in MATLAB
Free MATLAB toolbox YALMIP is introduced, developed initially to model SDPs and solve these by interfacing eternal solvers by making development of optimization problems in general, and control oriented SDP problems in particular, extremely simple.
Journal of the ACM 49 (4)
  • 496
  • 2002
SIAM Review 38
  • 49
  • 1996
  • Rev. Lett. 105, 230501
  • 2010
Using SeDuMi 1.02, a MATLAB Toolbox for Optimization over Symmetric Cones, Optimization methods and software
  • 1999
  • Rev. Lett. 111, 030501
  • 2013
  • Rev. A 90, 022322
  • 2014
  • Phys. 8, 588
  • 2012
New J
  • Phys. 15, 023026
  • 2013