Applying their postselectability heuristics to graph states, the researchers catalogued which graphs of up to nine qubits are postselectable, finding these to be fewer than one fifth of the total.

Graph limit theory provides a rigorous framework for analysing sequences of large graphs by representing them as continuous objects known as graphons – symmetric measurable functions on the unit ...

We prove that any distributional limit of finite planar graphs in which the degree of the root has an exponential tail is almost surely recurrent. As a corollary, we obtain that the uniform infinite ...

We find that the prediction performance of a wide range of GNN models is highly correlated with the node level assortativity. To break this limit, in this work, we focus on transforming the input ...