2,491 research outputs found
Qutrit witness from the Grothendieck constant of order four
In this paper, we prove that , where denotes the
Grothendieck constant of order . To this end, we use a branch-and-bound
algorithm commonly used in the solution of NP-hard problems. It has recently
been proven that . Here we prove that ,
which has implications for device-independent witnessing dimensions greater
than two. Furthermore, the algorithm with some modifications may find
applications in various black-box quantum information tasks with large number
of inputs and outputs.Comment: 13 pages, 2 figure
The positive semidefinite Grothendieck problem with rank constraint
Given a positive integer n and a positive semidefinite matrix A = (A_{ij}) of
size m x m, the positive semidefinite Grothendieck problem with
rank-n-constraint (SDP_n) is
maximize \sum_{i=1}^m \sum_{j=1}^m A_{ij} x_i \cdot x_j, where x_1, ..., x_m
\in S^{n-1}.
In this paper we design a polynomial time approximation algorithm for SDP_n
achieving an approximation ratio of
\gamma(n) = \frac{2}{n}(\frac{\Gamma((n+1)/2)}{\Gamma(n/2)})^2 = 1 -
\Theta(1/n).
We show that under the assumption of the unique games conjecture the achieved
approximation ratio is optimal: There is no polynomial time algorithm which
approximates SDP_n with a ratio greater than \gamma(n). We improve the
approximation ratio of the best known polynomial time algorithm for SDP_1 from
2/\pi to 2/(\pi\gamma(m)) = 2/\pi + \Theta(1/m), and we show a tighter
approximation ratio for SDP_n when A is the Laplacian matrix of a graph with
nonnegative edge weights.Comment: (v3) to appear in Proceedings of the 37th International Colloquium on
Automata, Languages and Programming, 12 page
Grothendieck inequalities for semidefinite programs with rank constraint
Grothendieck inequalities are fundamental inequalities which are frequently
used in many areas of mathematics and computer science. They can be interpreted
as upper bounds for the integrality gap between two optimization problems: a
difficult semidefinite program with rank-1 constraint and its easy semidefinite
relaxation where the rank constrained is dropped. For instance, the integrality
gap of the Goemans-Williamson approximation algorithm for MAX CUT can be seen
as a Grothendieck inequality. In this paper we consider Grothendieck
inequalities for ranks greater than 1 and we give two applications:
approximating ground states in the n-vector model in statistical mechanics and
XOR games in quantum information theory.Comment: 22 page
Better local hidden variable models for two-qubit Werner states and an upper bound on the Grothendieck constant
We consider the problem of reproducing the correlations obtained by arbitrary
local projective measurements on the two-qubit Werner state via a local hidden variable (LHV) model, where
denotes the singlet state. We show analytically that these
correlations are local for . In turn, as this problem is closely related to a purely
mathematical one formulated by Grothendieck, our result implies a new bound on
the Grothendieck constant . We also present a
LHV model for reproducing the statistics of arbitrary POVMs on the Werner state
for . The techniques we develop can be adapted to construct
LHV models for other entangled states, as well as bounding other Grothendieck
constants.Comment: 12 pages, typos correcte
- …