相关论文: Exclusivity principle, Ramsey theory, and $n$-cycl…

We study the color patterns that, for $n$ sufficiently large, are unavoidable in $2$-colorings of the edges of a complete graph $K_n$ with respect to $\min \{e(R), e(B)\}$, where $e(R)$ and $e(B)$ are the numbers of red and, respectively,…

For a system consisting of a quantum emitter coupled near threshold (band edge) to a one-dimensional continuum with a van Hove singularity in the density of states, we demonstrate general conditions such that a characteristic triple level…

In this work, we develop a unified framework for establishing sharp threshold results for various Ramsey properties. To achieve this, we view such properties as non-colourability of auxiliary hypergraphs. Our main technical result gives…

The canonical Ramsey theorem of Erd\H{o}s and Rado implies that for any graph $H$, any edge-coloring (with an arbitrary number of colors) of a sufficiently large complete graph $K_N$ contains a monochromatic, lexicographic, or rainbow copy…

We investigate the generation of EPR pairs between three observers in a general causally structured setting, where communication occurs via a noisy quantum broadcast channel. The most general quantum codes for this setup take the form of…

Multipartite nonlocality in a network is conceptually different from standard multipartite Bell nonlocality. In recent times, network nonlocality has been studied for various topologies. We consider a linear-chain topology of the network…

We introduce the list colouring extension of classical Ramsey numbers. We investigate when the two Ramsey numbers are equal, and in general, how far apart they can be from each other. We find graph sequences where the two are equal and…

We introduce the coordination principle, which states that perfect coordination, in the form of agreement on a uniformly random output, among N parties is possible only if they share a common cause. This principle is purely causal and can…

We study multipartite Bell nonlocality in a framework native of multipartite Einstein-Podolsky-Rosen (EPR) steering scenarios with a single trusted measurement device. We derive a closed-form necessary and sufficient criterion for systems…

In a no-signaling world, the outputs of a nonlocal box cannot be completely predetermined, a feature that is exploited in many quantum information protocols exploiting non-locality, such as device-independent randomness generation and…

A generalization of the 1935 Einstein-Podolsky-Rosen (EPR) argument for measurements with continuous variable outcomes is presented to establish criteria for the demonstration of the EPR paradox, for situations where the correlation between…

Entangled quantum particles have correlations stronger than those allowed by classical physics. These correlations are the focus of of the deepest issues in quantum mechanics [1-3] and are the basis of many quantum technologies. The…

Additivity violation of minimum output entropy, which shows non-classical properties in quantum communication, had been proved in most cases for random quantum channels defined by Haar-distributed unitary matrices. In this paper, we…

Singular potentials (the inverse-square potential, for example) arise in many situations and their quantum treatment leads to well-known ambiguities in choosing boundary conditions for the wave-function at the position of the potential's…

For any positive edge density $p$, a random graph in the Erd\H{o}s-Renyi $G_{n,p}$ model is connected with non-zero probability, since all edges are mutually independent. We consider random graph models in which edges that do not share…

Correlations of spins in a system of entangled particles are inconsistent with Kolmogorov's probability theory (KPT), provided the system is assumed to be non-contextual. In the Alice-Bob EPR paradigm, non-contextuality means that the…

For graphs $F$ and $G$, let $F\to G$ signify that any red/blue edge coloring of $F$ contains a monochromatic $G$. Denote by ${\cal G}(N,p)$ the random graph space of order $N$ and edge probability $p$. Using the regularity method, one can…

We prove three new lower bounds for graph connectivity in the $1$-bit broadcast congested clique model, BCC$(1)$. First, in the KT-$0$ version of BCC$(1)$, in which nodes are aware of neighbors only through port numbers, we show an…

We demonstrate that quantum correlations can emerge from the statistical correlations of random discrete models, without an a priori assumption that the random models are quantum mechanical in nature, that is without considering…

We say that a subset $M$ of $\mathbb R^n$ is exponentially Ramsey if there are $\epsilon>0$ and $n_0$ such that $\chi(\mathbb R^n,M)\ge(1+\epsilon)^n$ for any $n>n_0$, where $\chi(\mathbb R^n,M)$ stands for the minimum number of colors in a…