English
Related papers

Related papers: Basic exclusivity graphs in quantum correlations

200 papers

Contextuality is one way of capturing the non-classicality of quantum theory. The contextual nature of a theory is often witnessed via the violation of non-contextuality inequalities---certain linear inequalities involving probabilities of…

Quantum Physics · Physics 2020-07-08 Kishor Bharti , Atul Singh Arora , Leong Chuan Kwek , Jérémie Roland

We show that the exclusivity (E) principle singles out the set of quantum correlations associated to any exclusivity graph assuming the set of quantum correlations for the complementary graph. Moreover, we prove that, for self-complementary…

Quantum Physics · Physics 2014-03-19 Barbara Amaral , Marcelo Terra Cunha , Adán Cabello

Non-contextuality (NC) and Bell inequalities can be expressed as bounds $\Omega$ for positive linear combinations $S$ of probabilities of events, $S \leq \Omega$. Exclusive events in $S$ can be represented as adjacent vertices of a graph…

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…

Quantum Physics · Physics 2013-06-26 Bin Yan

Demonstrating contextual correlations in quantum theory through the violation of a non-contextuality inequality necessarily needs some ``contexts" and thus assumes some compatibility relations between the measurements. As a result, any…

Quantum Physics · Physics 2024-12-03 Gautam Sharma , Chellasamy Jebarathinam , Sk Sazim , Remigiusz Augusiak

A necessary condition for the probabilities of a set of events to exhibit Bell nonlocality or Kochen-Specker contextuality is that the graph of exclusivity of the events contains induced odd cycles with five or more vertices, called odd…

Quantum Physics · Physics 2024-02-16 Lucas E. A. Porto , Rafael Rabelo , Marcelo Terra Cunha , Adán Cabello

The method of the quantum probability theory only requires simple structural data of graph and allows us to avoid a heavy combinational argument often necessary to obtain full description of spectrum of the adjacency matrix. In the present…

Quantum Physics · Physics 2009-11-13 S. Salimi

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…

Quantum Physics · Physics 2016-10-31 Barbara Amaral

Measurement incompatibility is the most basic resource that distinguishes quantum from classical physics. Contextuality is the critical resource behind the power of some models of quantum computation and is also a necessary ingredient for…

Quantum Physics · Physics 2019-02-20 Zhen-Peng Xu , Adán Cabello

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,…

One of the interesting topics in quantum contextuality is the construction for various non-contextual inequalities. By introducing a new structure called hyper-graph, we present a general method, which seems to be analytic and extensible,…

Quantum Physics · Physics 2017-09-29 Weidong Tang , Sixia Yu

Which is the simplest logical structure for which there is quantum nonlocality? We show that there are only three bipartite Bell inequalities with quantum violation associated with the simplest graph of relationships of exclusivity with a…

Quantum Physics · Physics 2013-02-18 Muhamad Sadiq , Piotr Badziag , Mohamed Bourennane , Adan Cabello

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…

The quantum query complexity of subgraph-containment problems, which ask whether a given subgraph $H$ is present in an input graph $G$, has been the subject of considerable study. However, even for relatively simple subgraphs, such as paths…

Quantum Physics · Physics 2026-05-12 Arjan Cornelissen , Amin Shiraz Gilani , Subhasree Patro

For a graph (undirected, directed, or mixed), a cycle-factor is a collection of vertex-disjoint cycles covering the entire vertex set. Cycle-factors subject to parity constraints arise naturally in the study of structural graph theory and…

Data Structures and Algorithms · Computer Science 2025-10-22 Florian Hörsch , Csaba Király , Mirabel Mendoza-Cadena , Gyula Pap , Eszter Szabó , Yutaro Yamaguchi

Over the past decade, a number of quantum processes have been proposed which are logically consistent, yet feature a cyclic causal structure. However, there is no general formal method to construct a process with an exotic causal structure…

Quantum Physics · Physics 2025-12-03 Augustin Vanrietvelde , Nick Ormrod , Hlér Kristjánsson , Jonathan Barrett

In standard quantum theory, the causal relations between operations are fixed. One can relax this notion by allowing for dynamical arrangements, where operations may influence the causal relations of future operations, as certified by…

Quantum Physics · Physics 2025-10-23 Veronika Baumann , Ämin Baumeler , Eleftherios-Ermis Tselentis

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…

Quantum Physics · Physics 2020-05-26 Pavel Exner , Ondřej Turek

Contextuality is a fundamental feature of quantum theory and a necessary resource for quantum computation and communication. It is therefore important to investigate how large contextuality can be in quantum theory. Linear contextuality…

Quantum Physics · Physics 2015-12-21 Barbara Amaral , Marcelo Terra Cunha , Adán Cabello

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…

Quantum Physics · Physics 2013-07-19 Adan Cabello , Matthew G. Parker , Giannicola Scarpa , Simone Severini
‹ Prev 1 2 3 10 Next ›