Violation of Bell's inequalities in uniform random graphs

• URL: http://arxiv.org/abs/2305.02791v1
• Date: Thu, 4 May 2023 12:46:26 GMT
• Title: Violation of Bell's inequalities in uniform random graphs
• Authors: Ioannis Kleftogiannis, Ilias Amanatidis
• Abstract summary: We demonstrate that quantum correlations can emerge from the statistical correlations of random discrete models. We investigate the correlations between the number of neighbors(degree) for pairs of vertices in Erdos-Renyi uniform random graphs.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: 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 superpositions of the random structures. We investigate the correlations between the number of neighbors(degree) for pairs of vertices in Erdos-Renyi uniform random graphs. We use the joint probabilities for the appearance of degree numbers between the vertices in the pairs, in order to calculate the respective Bell's inequalities. We find that the inequalities are violated for sparse random graphs with ratio of edges over vertices $R<2$, signifying the emergence of quantum correlations for these random structures. The quantum correlations persist independently of the graph size or the geodesic distance between the correlated vertices. For $R>2$, as the graph becomes denser by adding more edges between its vertices, the Bell's inequalities are satisfied and the quantum correlations disappear. Relations to our previous works concerning the emergence of spacetime and its geometrical properties from uniform random graphs, are also briefly discussed.

Related papers

• HeNCler: Node Clustering in Heterophilous Graphs through Learned Asymmetric Similarity [55.27586970082595]
  HeNCler is a novel approach for Heterophilous Node Clustering. We show that HeNCler significantly enhances performance in node clustering tasks within heterophilous graph contexts.
  arXiv  Detail & Related papers  (2024-05-27T11:04:05Z)
• Two-particle Hadamard walk on dynamically percolated line and circle [0.0]
  Asymptotic dynamics of a Hadamard walk of two non-interacting quantum particles on a dynamically percolated finite line or a circle is investigated. We construct a basis of the attractor space of the corresponding random-unitary dynamics and prove the completeness of our solution.
  arXiv  Detail & Related papers  (2023-11-27T07:11:59Z)
• Contrastive Graph Clustering in Curvature Spaces [74.03252813800334]
  We present a novel end-to-end contrastive graph clustering model named CONGREGATE. To support geometric clustering, we construct a theoretically grounded Heterogeneous Curvature Space. We then train the graph clusters by an augmentation-free reweighted contrastive approach.
  arXiv  Detail & Related papers  (2023-05-05T14:04:52Z)
• Matching Correlated Inhomogeneous Random Graphs using the $k$-core Estimator [5.685589351789462]
  We study the so-called emph$k$-core estimator, which outputs a correspondence that induces a large, common subgraph of both graphs. We specialize our general framework to derive new results on exact and partial recovery in correlated block models, correlated Chung-Lu geometric graphs, and correlated random graphs.
  arXiv  Detail & Related papers  (2023-02-10T18:21:35Z)
• Spectral clustering under degree heterogeneity: a case for the random walk Laplacian [83.79286663107845]
  This paper shows that graph spectral embedding using the random walk Laplacian produces vector representations which are completely corrected for node degree. In the special case of a degree-corrected block model, the embedding concentrates about K distinct points, representing communities.
  arXiv  Detail & Related papers  (2021-05-03T16:36:27Z)
• Impossibility of Partial Recovery in the Graph Alignment Problem [3.5880535198436156]
  We show an average-case and noisy version of the well-known NP-hard graph isomorphism problem. For the correlated Erd"os-R'enyi model, we prove an impossibility result for partial recovery in the sparse regime. Our bound is tight in the noiseless case (the graph isomorphism problem) and we conjecture that it is still tight with noise.
  arXiv  Detail & Related papers  (2021-02-04T15:26:48Z)
• Robustness of Community Detection to Random Geometric Perturbations [16.575947847660778]
  We consider the block model where connection between vertices is perturbed by some latent (and unobserved) random geometric graph. The objective is to prove that spectral methods are robust to this type of noise, even if they are agnostic to the presence (or not) of the random graph.
  arXiv  Detail & Related papers  (2020-11-09T10:15:40Z)
• Causal Expectation-Maximisation [70.45873402967297]
  We show that causal inference is NP-hard even in models characterised by polytree-shaped graphs. We introduce the causal EM algorithm to reconstruct the uncertainty about the latent variables from data about categorical manifest variables. We argue that there appears to be an unnoticed limitation to the trending idea that counterfactual bounds can often be computed without knowledge of the structural equations.
  arXiv  Detail & Related papers  (2020-11-04T10:25:13Z)
• Testing correlation of unlabeled random graphs [18.08210501570919]
  We study the problem of detecting the edge correlation between two random graphs with $n$ unlabeled nodes. This is formalized as a hypothesis testing problem, where under the null hypothesis, the two graphs are independently generated. Under the alternative, the two graphs are edge-correlated under some latent node correspondence, but have the same marginal distributions as the null.
  arXiv  Detail & Related papers  (2020-08-23T19:19:45Z)
• Hamiltonian systems, Toda lattices, Solitons, Lax Pairs on weighted Z-graded graphs [62.997667081978825]
  We identify conditions which allow one to lift one dimensional solutions to solutions on graphs. We show that even for a simple example of a topologically interesting graph the corresponding non-trivial Lax pairs and associated unitary transformations do not lift to a Lax pair on the Z-graded graph.
  arXiv  Detail & Related papers  (2020-08-11T17:58:13Z)
• Continuous-time quantum walks in the presence of a quadratic perturbation [55.41644538483948]
  We address the properties of continuous-time quantum walks with Hamiltonians of the form $mathcalH= L + lambda L2$. We consider cycle, complete, and star graphs because paradigmatic models with low/high connectivity and/or symmetry.
  arXiv  Detail & Related papers  (2020-05-13T14:53:36Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.