Qutrit witness from the Grothendieck constant of order four

Abstract

In this paper, we prove that $K_G(3)<K_G(4)$, where $K_G(d)$ denotes the Grothendieck constant of order $d$. 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 $K_G(3)\le 1.4644$. Here we prove that $K_G(4)\ge 1.4841$, 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.

13 pages, 2 figures

References in corpus (16)

• Steering, Entanglement, Nonlocality, and the EPR Paradox
• Bounding the set of quantum correlations
• Testing the Hilbert space dimension
• Preparation contextuality powers parity-oblivious multiplexing
• Grothendieck's constant and local models for noisy entangled quantum states
• Unbounded violation of tripartite Bell inequalities
• More efficient Bell inequalities for Werner states
• Quantum Random Access Codes using Single $d$-level Systems
• Local hidden--variable models for entangled quantum states
• Bounding the set of finite dimensional quantum correlations
• Generalized Clauser-Horne-Shimony-Holt inequalities maximally violated by higher dimensional systems
• Towards Grothendieck Constants and LHV Models in Quantum Mechanics
• Convex separation from convex optimization for large-scale problems
• New Bell inequalities for the singlet state: Going beyond the Grothendieck bound
• Shared randomness and device-independent dimension witnessing
• Can non-local correlations be discriminated in polynomial time?