Related papers: A Generalization of Kochen-Specker Sets Relates Qu…
A simple three rules supplemented by five steps scheme is proposed to produce Kochen-Specker (KS) sets with 30 rank-2 projectors that occur twice each. The KS sets provide state-independent proof of KS theorem based on a system of three…
We address the problem of deriving the set of quantum correlations for every Bell and Kochen-Specker (KS) contextuality scenario from simple assumptions. We show that the correlations that are possible according to quantum theory are equal…
Given one or more uses of a classical channel, only a certain number of messages can be transmitted with zero probability of error. The study of this number and its asymptotic behaviour constitutes the field of classical zero-error…
We define several new types of quantum chromatic numbers of a graph and characterise them in terms of operator system tensor products. We establish inequalities between these chromatic numbers and other parameters of graphs studied in the…
Kochen-Specker (KS) sets are key tools for proving some fundamental results in quantum theory and also have potential applications in quantum information processing. However, so far, their intrinsic complexity has prevented experimentalists…
Kochen-Specker (KS) sets are fundamental in physics. Every time nature produces bipartite correlations attaining the nonsignaling limit, or two parties always win a nonlocal game impossible to always win classically, is because the parties…
Quantum cryptographic protocols based on complementarity are nonsecure against attacks in which complementarity is imitated with classical resources. The Kochen-Specker (KS) theorem provides protection against these attacks, without…
Quantum contextuality is a source of quantum computational power and a theoretical delimiter between classical and quantum structures. It has been substantiated by numerous experiments and prompted generation of state independent contextual…
Quantum contextuality plays a significant role in supporting quantum computation and quantum information theory. The key tools for this are the Kochen--Specker and non-Kochen--Specker contextual sets. Traditionally, their representation has…
At the heart of the Conway-Kochen Free Will theorem and Kochen and Specker's argument against non-contextual hidden variable theories is the existence of a Kochen-Specker (KS) system: a set of points on the sphere that has no 0,1-coloring…
The present work continues investigation of the capacities of measurement (quantum-classical) channels in the most general setting, initiated in~\cite{HCT}. The proof of coding theorems is given for the classical capacity and…
Let $V$ be a vector space of dimension $v$ over a field of order $q$. The $q$-Kneser graph has the $k$-dimensional subspaces of $V$ as its vertices, where two subspaces $\alpha$ and $\beta$ are adjacent if and only if $\alpha\cap\beta$ is…
A generalized Kochen-Specker theorem is proved. It is shown that there exist sets of $n$ projection operators, representing $n$ yes-no questions about a quantum system, such that none of the $2^n$ possible answers is compatible with sum…
The Kneser graph $K(n,k)$ is defined for integers $n$ and $k$ with $n \geq 2k$ as the graph whose vertices are all the $k$-subsets of $\{1,2,\ldots,n\}$ where two such sets are adjacent if they are disjoint. A classical result of Lov\'asz…
This paper investigates the semi-streaming complexity of \textit{$k$-partial coloring}, a generalization of proper graph coloring. For $k \geq 1$, a $k$-partial coloring requires that each vertex $v$ in an $n$-node graph is assigned a color…
Fully revealing the mathmatical structure of quantum contextuality is a significant task, while some known contextuality theories are only applicable for rank-1 projectors. That is because they adopt the observable-based definitions. This…
We consider classical message transmission under entanglement assistance for compound memoryless and arbitrarily varying quantum channels. In both cases, we prove general coding theorems together with corresponding weak converse bounds. In…
A central result in the foundations of quantum mechanics is the Kochen-Specker theorem. In short, it states that quantum mechanics is in conflict with classical models in which the result of a measurement does not depend on which other…
A single coloring channel is defined by a subset of letters it allows to pass through, while deleting all others. A sequence of coloring channels provides multiple views of the same transmitted letter sequence, forming a type of…
Duan and Winter studied the one-shot zero-error classical capacity of a quantum channel assisted by quantum non-signalling correlations, and formulated this problem as a semidefinite program depending only on the Kraus operator space of the…