Kochen-Specker set with seven contexts

The Kochen-Specker (KS) theorem is a central result in quantum theory and has applications in quantum information. Its proof requires several yes-no tests that can be grouped in contexts or subsets of jointly measurable tests. Arguably, the best measure of simplicity of a KS set is the number of contexts. The smaller this number is, the smaller the number of experiments needed to reveal the conflict between quantum theory and noncontextual theories and to get a quantum vs classical outperformance. The original KS set had 132 contexts. Here we introduce a KS set with seven contexts and prove that this is the simplest KS set that admits a symmetric parity proof.Comment: REVTeX4, 7 pages, 1 figur

Concurrence in arbitrary dimensions

We argue that a complete characterisation of quantum correlations in bipartite systems of many dimensions may require a quantity which, even for pure states, does not reduce to a single number. Subsequently, we introduce multi-dimensional generalizations of concurrence and find evidence that they may provide useful tools for the analysis of quantum correlations in mixed bipartite states. We also introudce {\it biconcurrence} that leads to a necessary and sufficient condition for separability.Comment: RevTeX 7 page