169,969 research outputs found
Contextuality, memory cost and non-classicality for sequential measurements
No full textThe Kochen-Specker theorem, and the associated notion of quantum contextuality, can be considered as the starting point for the development of a notion of non-classical correlations for single systems. The subsequent debate around the possibility of an experimental test of Kochen-Specker-type contradiction stimulated the development of different theoretical frameworks to interpret experimental results. Starting from the approach based on sequential measurements, we will discuss a generalization of the notion of non-classical temporal correlations that goes beyond the contextuality approach and related ones based on Leggett and Garg's notion of macrorealism, and it is based on the notion of memory cost of generating correlations. Finally, we will review recent results on the memory cost for generating temporal correlations in classical and quantum systems. The present work is based on the talk given at the Purdue Winer Memorial Lectures 2018: probability and contextuality. This article is part of the theme issue 'Contextuality and probability in quantum mechanics and beyond'
Bell inequalities from variable-elimination methods
No full textTight Bell inequalities are facets of Pitowskys correlation polytope and are usually obtained from its extreme points by solving the hull problem. Here, we present an alternative method based on a combination of algebraic results on extensions of measures and variable-elimination methods, e.g., the Fourier-Motzkin method. Our method is shown to overcome some of the computational difficulties associated with the hull problem in some non-trivial cases. Moreover, it provides an explanation for the arising of only a finite number of families of Bell inequalities in measurement scenarios where one experimenter can choose between an arbitrary number of different measurements. © 2012 IOP Publishing Ltd
The extension problem for partial Boolean structures in quantum mechanics
No full textAlternative partial Boolean structures, implicit in the discussion of classical representability of sets of quantum mechanical predictions, are characterized, with definite general conclusions on the equivalence of the approaches going back to Bell and Kochen-Specker. An algebraic approach is presented, allowing for a discussion of partial classical extension, amounting to reduction of the "number of contexts," classical representability arising as a special case. As a result, known techniques are generalized and some of the associated computational difficulties overcome. The implications on the discussion of Boole-Bell inequalities are indicated. © 2010 American Institute of Physics
Theoretical research without projects
No full textWe propose a funding scheme for theoretical research that does not rely on project proposals, but on recent past scientific productivity. Given a quantitative figure of merit on the latter and the total research budget, we introduce a number of policies to decide the allocation of funds in each grant call. Under some assumptions on scientific productivity, some of such policies are shown to converge, in the limit of many grant calls, to a funding configuration that is close to the maximum total productivity of the whole scientific community. We present numerical simulations showing evidence that these schemes would also perform well in the presence of statistical noise in the scientific productivity and/or its evaluation. Finally, we prove that one of our policies cannot be cheated by individual research units. Our work must be understood as a first step towards a mathematical theory of the research activity.</div
Simulating extremal temporal correlations
No full textThe correlations arising from sequential measurements on a single quantum system form a polytope. This is defined by the arrow-of-time (AoT) constraints, meaning that future choices of measurement settings cannot influence past outcomes. We discuss the resources needed to simulate the extreme points of the AoT polytope, where resources are quantified in terms of the minimal dimension, or 'internal memory' of the physical system. First, we analyze the equivalence classes of the extreme points under symmetries. Second, we characterize the minimal dimension necessary to obtain a given extreme point of the AoT polytope, including a lower scaling bound in the asymptotic limit of long sequences. Finally, we present a general method to derive dimension-sensitive temporal inequalities for longer sequences, based on inequalities for shorter ones, and investigate their robustness to imperfections
Bell inequalities as constraints on unmeasurable correlations
No full textThe interpretation of the violation of Bell-Clauser-Horne inequalities is revisited, in relation with the notion of extension of QM predictions to unmeasurable correlations. Such extensions are compatible with QM predictions in many cases, in particular for observables with compatibility relations described by tree graphs. This implies classical representability of any set of correlations 〈Ai〉, 〈B〉, 〈AiB〉, and the equivalence of the Bell-Clauser-Horne inequalities to a non void intersection between the ranges of values for the unmeasurable correlation 〈A1A2 〉 associated to different choices for B. The same analysis applies to the Hardy model and to the “perfect correlations ” discussed by Greenberger, Horne, Shimony and Zeilinger. In all the cases, the dependence of an unmeasurable correlation on a set of variables allowing for a classical representation is the only basis for arguments about violations of locality and causality. 1 a
Memory cost of temporal correlations
No full textA possible notion of nonclassicality for single systems can be defined on the basis of the notion of memory cost of classically simulating probabilities observed in a temporal sequence of measurements. We further explore this idea in a theory-independent framework, namely, from the perspective of general probability theories (GPTs), which includes classical and quantum theory as special examples. Under the assumption that each system has a finite memory capacity, identified with the maximal number of states perfectly distinguishable with a single measurement, we investigate what are the temporal correlations achievable with different theories, namely, classical, quantum, and GPTs beyond quantum mechanics. Already for the simplest nontrivial scenario, we derive inequalities able to distinguish temporal correlations where the underlying system is classical, quantum, or more general
Hashing to G2 on BLS pairing-friendly curves
No full textWhen a pairing e : G1 x G2 → GT, on an elliptic curve E defined over Fq, is exploited in a cryptographic protocol, there is often the need to hash binary strings into G1 and G2. Traditionally, if E admits a twist Ẽ of order d, then G1 = E(Fq)⋂E[r], where r is a prime integer, and G2 = Ẽ(Fqk/d)⋂Ẽ[r], where k is the embedding degree of E w.r.t. r. The standard approach for hashing a binary string into G1 and G2 is to map it to general points P∈E(Fq) and P′ ∈ Ẽ(Fqk/d), and then multiply them by the cofactors c = #E(Fq)/r and c′ = #Ẽ(Fqk/d)/r respectively. Usually, the multiplication by c′ is computationally expensive. In order to speed up such a computation, two different methods (by Scott et al. and by Fuentes et al.) have been proposed. In this poster we consider these two methods for BLS pairing-friendly curves having k ∈ {12, 24, 30, 42,48}, providing efficiency comparisons. When k = 42,48, the Fuentes et al. method requires an expensive one-off pre-computation which was infeasible for the computational power at our disposal. In these cases, we theoretically obtain hashing maps that follow Fuentes et al. idea
Efficient hash maps to G2 on BLS curves
No full textWhen a pairing e:G1×G2→GT, on an elliptic curve E defined over a finite field Fq, is exploited for an identity-based protocol, there is often the need to hash binary strings into G1 and G2. Traditionally, if E admits a twist E~ of order d, then G1=E(Fq)∩E[r], where r is a prime integer, and G2=E~(Fqk/d)∩E~[r], where k is the embedding degree of E w.r.t. r. The standard approach for hashing into G2 is to map to a general point P∈E~(Fqk/d) and then multiply it by the cofactor c=#E~(Fqk/d)/r. Usually, the multiplication by c is computationally expensive. In order to speed up such a computation, two different methods—by Scott et al. (International conference on pairing-based cryptography. Springer, Berlin, pp 102–113, 2009) and by Fuentes-Castaneda et al. (International workshop on selected areas in cryptography)—have been proposed. In this paper we consider these two methods for BLS pairing-friendly curves having k∈{12,24,30,42,48}, providing efficiency comparisons. When k=42,48, the application of Fuentes et al. method requires expensive computations which were infeasible for the computational power at our disposal. For these cases, we propose hashing maps that we obtained following Fuentes et al. idea.publishedVersio
From Transport Phenomena to Systems Chemistry: Chemohydrodynamic Oscillations in A + B -> C Systems
No full textinfo:eu-repo/semantics/publishe
- …
