Related papers: Chromatic Quantum Contextuality
The origin of non-classicality in physical systems and its connection to distinctly quantum features such as entanglement and coherence is a central question in quantum physics. This work analyses this question theoretically and…
Document ranking based on probabilistic evaluations of relevance is known to exhibit non-classical correlations, which may be explained by admitting a complex structure of the event space, namely, by assuming the events to emerge from…
In Euclidean Ramsey Theory usually we are looking for monochromatic configurations in the Euclidean space, whose points are colored with a fixed number of colors. In the canonical version, the number of colors is arbitrary, and we are…
Quantum mechanics implies that not all physical properties can be simultaneously well defined, such as the momentum and position due to Heisenberg uncertainty principle. Some alternative theories have been explored, notably the…
The chromatic threshold of a graph $H$ is the minimum-degree density above which every $H$-free graph has bounded chromatic number. We study a two-color Ramsey analogue: for graphs $H_1$ and $H_2$, we ask for the minimum-degree density…
Quantum mechanics provides a statistical description about nature, and thus would be incomplete if its statistical predictions could not be accounted for by some realistic models with hidden variables. There are, however, two powerful…
A number of noncontextual models exist which reproduce different subsets of quantum theory and admit a no-cloning theorem. Therefore, if one chooses noncontextuality as one's notion of classicality, no-cloning cannot be regarded as a…
Contextuality is a necessary resource for universal quantum computation and non-contextual quantum mechanics can be simulated efficiently by classical computers in many cases. Orders of Planck's constant, $\hbar$, can also be used to…
Colored tensor models (CTM) is a random geometrical approach to quantum gravity. We scrutinize the structure of the connected correlation functions of general CTM-interactions and organize them by boundaries of Feynman graphs. For rank-$D$…
The acyclic chromatic number of a graph is the least number of colors needed to properly color its vertices so that none of its cycles has only two colors. We show that for all $\alpha>2^{-1/3}$ there exists an integer $\Delta_{\alpha}$…
We develop the contextual measurement model (CMM) which is used for clarification of the quantum foundations. This model matches with Bohr's views on the role of experimental contexts. CMM is based on contextual probability theory which is…
Contextuality - the obstruction to describing quantum mechanics in a classical statistical way - has been proposed as a resource that powers quantum computing. The measurement-based model provides a concrete manifestation of contextuality…
A new infinite family of examples of finite non-bicolorable configurations of rays in Hilbert space is described. Such configurations appear in the analysis of quantum mechanics in terms of Bell's inequalities and Kochen-Specker theorem and…
Results of measurements give legitimacy to a physical theory. What if acquiring these results in the first place necessitates what the same theory considers to be an interaction? In this note, we assume that theories account for…
We study the limit of the chromatic tower for not necessarily finite spectra, obtaining a generalization of the chromatic convergence theorem of Hopkins and Ravenel. Moreover, we prove that in general this limit does not coincide with…
Proofs of Bell-Kochen-Specker contextuality demonstrate that there exists sets of projectors that cannot each be assigned either 0 or 1 such that each basis formed from them contains exactly one 1-assigned projector. Instead, at least some…
We propose that whatever quantity controls the Heisenberg uncertainty relations (for a given complementary pair of observables) it should be identified with an effective Planck parameter. With this definition it is not difficult to find…
The {\em chromatic gap} is the difference between the chromatic number and the clique number of a graph. Here we investigate $\gap(n)$, the maximum chromatic gap over graphs on $n$ vertices. Can the extremal graphs be explored? While…
The chromatic number of an planar graph is not greater than four and this is known by the famous four color theorem and is equal to two when the planar graph is bipartite. When the planar graph is even-triangulated or all cycles are greater…
Contextuality is a key characteristic that separates quantum from classical phenomena and an important tool in understanding the potential advantage of quantum computation. However, when assessing the quantum resources available for quantum…