相关论文: The exclusivity principle forbids sets of correlat…
This work explores the implications of the exclusivity principle (EP) in the context of quantum and postquantum correlations. We first establish a key technical result demonstrating that given the set of correlations for a complementary…
It is a fundamental problem in physics of what principle limits the correlations as predicted by our current description of nature, based on quantum mechanics. One possible explanation is the "global exclusivity" principle recently…
The most promising candidate for being the fundamental principle of quantum contextuality is the Exclusivity principle, which states that the sum of the probabilities of a set of pairwise exclusive events cannot exceed 1. By itself, the…
A fundamental problem is to understand why quantum theory only violates some noncontextuality (NC) inequalities and identify the physical principles that prevent higher-than-quantum violations. We prove that quantum theory only violates…
The exclusivity principle (E-principle) states that the sum of probabilities of pairwise exclusive events cannot exceed 1. Unlike other principles proposed to characterize quantum correlations, its intrinsically non-bipartite formulation…
Why do correlations between the results of measurements performed on physical systems violate Bell and non-contextuality inequalities up to some specific limits? The answer may follow from the observation that in quantum theory, unlike in…
Adopting the graph-theoretic approach to the correlation experiments, we analyze the origin of monogamy and prove that it can be recognized as a consequence of the exclusivity principle(EP). We provide an operational criterion for monogamy:…
To identify which principles characterize quantum correlations, it is essential to understand in which sense this set of correlations differs from that of almost quantum correlations. We solve this problem by invoking the so-called…
A matching in a graph is uniquely restricted if no other matching covers exactly the same set of vertices. We establish tight lower bounds on the maximum size of a uniquely restricted matching in terms of order, size, and maximum degree.
We describe a construction that maps any connected graph G on three or more vertices into a larger graph, H(G), whose independence number is strictly smaller than its Lov\'asz number which is equal to its fractional packing number. The…
In contrast to the usual quantum systems which have at most a finite number of open spectral gaps if they are periodic in more than one direction, periodic quantum graphs may have gaps arbitrarily high in the spectrum. This property of…
Ernst Specker considered a particular feature of quantum theory to be especially fundamental, namely that pairwise joint measurability of sharp measurements implies their global joint measurability (https://vimeo.com/52923835). To date,…
A maximal independent set in a graph $G$ is an independent set that cannot be extended to a larger independent set by adding any vertex from $G$. This paper investigates the problem of determining the maximum number of maximal independent…
For random systems subject to a constraint, the microcanonical ensemble requires the constraint to be met by every realisation ("hard constraint"), while the canonical ensemble requires the constraint to be met only on average ("soft…
Measurement scenarios containing events with relations of exclusivity represented by pentagons, heptagons, nonagons, etc., or their complements are the only ones in which quantum probabilities cannot be described classically. Interestingly,…
We present quantum complexity lower and upper bounds for independent set problems in graphs. In particular, we give quantum algorithms for computing a maximal and a maximum independent set in a graph. We present applications of these…
We characterize the connected graphs of given order $n$ and given independence number $\alpha$ that maximize the number of maximum independent sets. For $3\leq \alpha\leq n/2$, there is a unique such graph that arises from the disjoint…
We improve the best known lower bounds on the exponential behavior of the maximum of the number of connected sets, $N(G)$, and dominating connected sets, $N_{dom}(G)$, for regular graphs. These lower bounds are improved by constructing a…
In set theory without the Axiom of Choice (AC), we observe new relations of the following statements with weak choice principles. 1. Every locally finite connected graph has a maximal independent set. 2. Every locally countable connected…
Complementarity is one of the main features of quantum physics that radically departs from classical notions. Here we consider the limitations that this principle imposes due to the unpredictability of measurement outcomes of incompatible…