Robust Self-Testing of Quantum Systems via Noncontextuality Inequalities.

Characterizing unknown quantum states and measurements is a fundamental problem in quantum information processing. In this Letter, we provide a novel scheme to self-test local quantum systems using noncontextuality inequalities. Our work leverages the graph-theoretic framework for contextuality introduced by Cabello, Severini, and Winter, combined with tools from mathematical optimization that guarantee the unicity of optimal solutions. As an application, we show that the celebrated Klyachko-Can-Binicioglu-Shumovsky inequality and its generalization to contextuality scenarios with odd n-cycle compatibility relations admit robust self-testing.

Universal Completability, Least Eigenvalue Frameworks, and Vector Colorings.

An embedding i ↦ p i ∈ R d of the vertices of a graph G is called universally completable if the following holds: For any other embedding i ↦ q i ∈ R k satisfying q i T q j = p i T p j for i = j and i adjacent to j, there exists an isometry mapping q i to p i for all i ∈ V ( G ) . The notion of universal completability was introduced recently due to its relevance to the positive semidefinite matrix completion problem. In this work we focus on graph embeddings constructed using the eigenvectors of the least eigenvalue of the adjacency matrix of G, which we call least eigenvalue frameworks. We identify two necessary and sufficient conditions for such frameworks to be universally completable. Our conditions also allow us to give algorithms for determining whether a least eigenvalue framework is universally completable. Furthermore, our computations for Cayley graphs on Z 2 n ( n ≤ 5 ) show that almost all of these graphs have universally completable least eigenvalue frameworks. In the second part of this work we study uniquely vector colorable (UVC) graphs, i.e., graphs for which the semidefinite program corresponding to the Lovász theta number (of the complementary graph) admits a unique optimal solution. We identify a sufficient condition for showing that a graph is UVC based on the universal completability of an associated framework. This allows us to prove that Kneser and q-Kneser graphs are UVC. Lastly, we show that least eigenvalue frameworks of 1-walk-regular graphs always provide optimal vector colorings and furthermore, we are able to characterize all optimal vector colorings of such graphs. In particular, we give a necessary and sufficient condition for a 1-walk-regular graph to be uniquely vector colorable.

Minimum Dimension of a Hilbert Space Needed to Generate a Quantum Correlation.

Consider a two-party correlation that can be generated by performing local measurements on a bipartite quantum system. A question of fundamental importance is to understand how many resources, which we quantify by the dimension of the underlying quantum system, are needed to reproduce this correlation. In this Letter, we identify an easy-to-compute lower bound on the smallest Hilbert space dimension needed to generate a given two-party quantum correlation. We show that our bound is tight on many well-known correlations and discuss how it can rule out correlations of having a finite-dimensional quantum representation. We show that our bound is multiplicative under product correlations and also that it can witness the nonconvexity of certain restricted-dimensional quantum correlations.