Communication, Relationships and Care

Barrett, Sheila; Komaromy, Carol; Robb, Martin; Rogers, Anita

doi:10.4324/9780203494325

Cited by 10 publications

(10 citation statements)

References 0 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In two-party, two-outcome Bell scenario, the assumption of preparation non-contextuality is equivalent to locality [27]. In such a case, (β 3,3 ) local ≤ 5 and (P 3,3 ) local = 7/9 ≈ 0.777.…”

Section: Universal Non-contextual Inequality In (33) Scenariomentioning

confidence: 99%

Revealing universal quantum contextuality through communication games

Pan

2019

Sci Rep

View full text Add to dashboard Cite

An ontological model of an operational theory is considered to be universally noncontextual if both preparation and measurement noncontextuality assumptions are satisfied in that model. In this report, we first generalize the logical proofs of quantum preparation and measurement contextuality for qubit system for any odd number of preparations and measurements. Based on the logical proof, we derive testable universally non-contextual inequalities violated by quantum theory. We then propose a class of two-party communication games and show that the average success probability of winning such games is solely linked to suitable Bell expression whose local bound is greater than universal non-contextual bound. Thus, for a given state, even if quantum theory does not exhibit non-locality, it may still reveal non-classicality by violating the universal non-contextual bound. Further, we consider a different communication game to demonstrate that for a given choices of observables in quantum theory, even if there is no logical proof of preparation and measurement contextuality exist, the universal quantum contextuality can be revealed through that communication game. Such a game thus test a weaker form of universal non-contextuality with minimal assumption.

show abstract

Section: Universal Non-contextual Inequality In (33) Scenariomentioning

confidence: 99%

Revealing universal quantum contextuality through communication games

Pan

2019

Sci Rep

View full text Add to dashboard Cite

show abstract

“…(8) whose local bound is considerably higher than non-trivial preparation non-contextual bound. As already mentioned that any proof of non-locality is a proof of trivial preparation contextuality [16,20]. Note that, for n = 2 case, the local and preparation contextual bound are the same.…”

Section: Discussionmentioning

confidence: 76%

“…(8) is just the CHSH expression, no such nontrivial constraint can be found. As already stated earlier that for two-party, two measurement per site and two-outcome Bell scenario the trivial preparation noncontextuality is in fact the assumption of locality [16,20]. Thus, local and preparation non-contextual bound are the same for CHSH expression.…”

Section: A Family Of Bell's Inequalities and Their Local And Prepmentioning

confidence: 74%

Sharing nonlocality and nontrivial preparation contextuality using the same family of Bell expressions

Kumari¹,

Pan²

2019

Phys. Rev. A

View full text Add to dashboard Cite

In [Phys. Rev. Lett. 114, 250401 (2015)] the sharing of non-locality by multiple observers was demonstrated through the quantum violation of Clauser-Horne-Shimony-Halt inequality. In this paper we provide a scheme for sharing of non-locality and non-trivial preparation contextuality sequentially through the quantum violation of a family of Bell's inequalities where Alice and Bob perform 2 n−1 and n numbers of measurements of dichotomic observables respectively. For this, we consider that Alice always performs projective measurement and multiple Bobs sequentially perform unsharp measurement. We show that when Bob's choices of measurement settings are unbiased, maximum two Bobs can sequentially share the non-locality through the violation of our inequalities. Further, we show that the local bound of the aforementioned family of inequalities gets reduced if non-trivial preparation non-contextuality assumptions are further imposed. Then there is a chance to share the non-trivial preparation contextuality for more number of Bobs than that of non-locality. We demonstrate that the non-trivial preparation contextuality can be sequentially shared by arbitrary numbers of Bob for unbiased choices of his measurement settings.

show abstract

“…For example, when computing an overriding relationship between two methods m 1 and m 3 , if m 1 is already known to override m 2 and m 2 is already known to override m 3 , then we are guaranteed that m 1 overrides m 3 so there is no need to ask the theorem prover. Also, CVC Lite is optimized for handling large formulas with complex boolean structures; other automatic theorem provers, such as Simplify [18], may be better suited for the kinds of small queries that we pose [5]. Finally, despite the increase in compile time, JPred's modular class-by-class compilation style should allow compilation to scale well with program size.…”

Section: Quantitative Resultsmentioning

confidence: 99%

“…Figure 20 shows the Java implementation of an event handler of average complexity in DiscoveryClient. 5 Handlers typically subclass from the abstract AbstractHandler class, which in turn implements the EventHandler interface. AbstractHandler's handle method invokes an abstract helper method handle1, which is implemented by each concrete subclass in order to provide the subclass's event-handling functionality.…”

Section: Overviewmentioning

confidence: 99%

Practical predicate dispatch

Millstein

2004

Proceedings of the 19th Annual ACM SIGPLAN Conference on Object-Oriented Programming, Systems, Languages, and Applications

View full text Add to dashboard Cite

Predicate dispatch is an object-oriented (OO) language mechanism for determining the method implementation to be invoked upon a message send. With predicate dispatch, each method implementation includes a predicate guard specifying the conditions under which the method should be invoked, and logical implication of predicates determines the method overriding relation. Predicate dispatch naturally unifies and generalizes several common forms of dynamic dispatch, including traditional OO dispatch, multimethod dispatch, and functional-style pattern matching. Unfortunately, prior languages supporting predicate dispatch have had several deficiencies that limit its utility in practice.We introduce JPred, a backward-compatible extension to Java supporting predicate dispatch. While prior languages with predicate dispatch have been extensions to toy or non-mainstream languages, we show how predicate dispatch can be naturally added to a traditional OO language. While prior languages with predicate dispatch have required the whole program to be available for typechecking and compilation, JPred retains Java's modular typechecking and compilation strategies. While prior languages with predicate dispatch have included special-purpose algorithms for reasoning about predicates, JPred employs general-purpose, off-the-shelf decision procedures. As a result, JPred's type system is more flexible, allowing several useful programming idioms that are spuriously rejected by those other languages. After describing the JPred language and type system, we present a case study illustrating the utility of JPred in a real-world application, including its use in the detection of several errors.

show abstract

Communication, Relationships and Care

Cited by 10 publications

References 0 publications

Revealing universal quantum contextuality through communication games

Revealing universal quantum contextuality through communication games

Sharing nonlocality and nontrivial preparation contextuality using the same family of Bell expressions

Practical predicate dispatch

Contact Info

Product

Resources

About