Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userGraph Approach to Extended Contextuality
71
0
0.0
(
0
)
Ask ChatGPT about the research
No Arabic abstract
Exploring the graph approach, we restate the extended definition of noncontextuality provided by the contextuality-by-default framework. This extended definition avoids the assumption of nondisturbance, which states that whenever two contexts overlap, the marginal distribution obtained for the intersection must be the same. We show how standard tools for characterizing contextuality can also be used in this extended framework for any set of measurements and, in addition, we also provide several conditions that can be tested directly in any contextuality experiment. Our conditions reduce to traditional ones for noncontextuality if the nondisturbance assumption is satisfied.
rate research
Read More
The connection between contextuality and graph theory has led to many developments in the field. In particular, the sets of probability distributions in many contextuality scenarios can be described using well known convex sets from graph theory, leading to a beautiful geometric characterization of such sets. This geometry can also be explored in the definition of contextuality quantifiers based on geometric distances, which is important for the resource theory of contextuality, developed after the recognition of contextuality as a potential resource for quantum computation. In this paper we review the geometric aspects of contextuality and use it to define several quantifiers, which have the advantage of being applicable to the exclusivity approach to contextuality, where previously defined quantifiers do not fit.
It is well known that certain measurement scenarios behave in a way which can not be explained by classical theories but by quantum theories. This behaviours are usually studied by Bell or non-contextuality (NC) inequalities. Knowing the maximal classical and quantum bounds of this inequalities is interesting, but tells us little about the quantum set Q of all quantum behaviours P. Despite having a constructive description of the quantum set associated to a given inequality, the freedom to choose quantum dimension, quantum states, and quantum measurements makes the shape of such convex bodies quite elusive. It is well known that a NC-inequality can be associated to a graph and the quantum set is a combinatorial object. Extra conditions, like Bell concept of parts, may restrict the behaviours achievable within quantum theory for a given scenario. For the simplest case, CHSH inequality, the NC and Be
Instrumental variables allow the estimation of cause and effect relations even in presence of unobserved latent factors, thus providing a powerful tool for any science wherein causal inference plays an important role. More recently, the instrumental scenario has also attracted increasing attention in quantum physics, since it is related to the seminal Bells theorem and in fact allows the detection of even stronger quantum effects, thus enhancing our current capabilities to process information and becoming a valuable tool in quantum cryptography. In this work, we further explore this bridge between causality and quantum theory and apply a technique, originally developed in the field of quantum foundations, to express the constraints implied by causal relations in the language of graph theory. This new approach can be applied to any causal model containing a latent variable. Here, by focusing on the instrumental scenario, it allows us to easily reproduce known results as well as obtain new ones and gain new insights on the connections and differences between the instrumental and the Bell scenarios.
Quantum teleportation plays a key role in modern quantum technologies. Thus, it is of much interest to generate alternative approaches or representations aimed at allowing us a better understanding of the physics involved in the process from different perspectives. With this purpose, here an approach based on graph theory is introduced and discussed in the context of some applications. Its main goal is to provide a fully symbolic framework for quantum teleportation from a dynamical viewpoint, which makes explicit at each stage of the process how entanglement and information swap among the qubits involved in it. In order to construct this dynamical perspective, it has been necessary to define some auxiliary elements, namely virtual nodes and edges, as well as an additional notation for nodes describing potential states (against nodes accounting for actual states). With these elements, not only the flow of the process can be followed step by step, but they allow us to establish a direct correspondence between this graph-based approach and the usual state vector description. To show the suitability and versatility of this graph-based approach, several particular teleportation examples are examined, which include bipartite, tripartite and tetrapartite maximally entangled states as quantum channels. From the analysis of these cases, a general protocol is discussed in the case of sharing a maximally entangled multi-qubit system.
A fundamental problem in quantum computation and quantum information is finding the minimum quantum dimension needed for a task. For tasks involving state preparation and measurements, this problem can be addressed using only the input-output correlations. This has been applied to Bell, prepare-and-measure, and Kochen-Specker contextuality scenarios. Here, we introduce a novel approach to quantum dimension witnessing for scenarios with one preparation and several measurements, which uses the graphs of mutual exclusivity between sets of measurement events. We present the concepts and tools needed for graph-theoretic quantum dimension witnessing and illustrate their use by identifying novel quantum dimension witnesses, including a family that can certify arbitrarily high quantum dimensions with few events.
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
