Beyond the Cabello-Severini-Winter framework: Making sense of contextuality without sharpness of measurements

We develop a hypergraph-theoretic framework for Spekkens contextuality applied to Kochen-Specker (KS) type scenarios that goes beyond the Cabello-Severini-Winter (CSW) framework. To do this, we add new hypergraph-theoretic ingredients to the CSW framework. We then obtain noise-robust noncontextuality inequalities in this generalized framework by applying the assumption of (Spekkens) noncontextuality to both preparations and measurements. The resulting framework goes beyond the CSW framework in both senses, conceptual and technical. On the conceptual level: 1) as in any treatment based on the generalized notion of noncontextuality à la Spekkens, we relax the assumption of outcome determinism inherent to the Kochen-Specker theorem but retain measurement noncontextuality, besides introducing preparation noncontextuality, 2) we do not require the exclusivity principle -- that pairwise exclusive measurement events must all be mutually exclusive -- as a fundamental constraint on measurement events of interest in an experimental test of contextuality, given that this property is not true of general quantum measurements, and 3) as a result, we do not need to presume that measurement events of interest are ``sharp" (for any definition of sharpness), where this notion of sharpness is meant to imply the exclusivity principle. On the technical level, we go beyond the CSW framework in the following senses: 1) we introduce a source events hypergraph -- besides the measurement events hypergraph usually considered -- and define a new operational quantity Corr that appears in our inequalities, 2) we define a new hypergraph invariant -- the weightedmax-predictability -- that is necessary for our analysis and appears in our inequalities, and 3) our noise-robust noncontextuality inequalities quantify tradeoff relations between three operational quantities -- Corr, R, and p0 -- only one of which (namely, R) corresponds to the Bell-Kochen-Specker functionals appearing in the CSW framework; when Corr=1, the inequalities formally reduce to CSW type bounds on R. Along the way, we also consider in detail the scope of our framework vis-à-vis the CSW framework, particularly the role of Specker's principle in the CSW framework, i.e., what the principle means for an operational theory satisfying it and why we don't impose it in our framework.

Development of Neutron Polarization Measurement System for Studying NN interaction in Nuclear Medium

We have developed the neutron polarization measurement system to perform the first polarization-transfer measurement for the exclusive [Formula: see text] reaction. For the neutron polarization measurement, we have reconstructed the neutron polarimeter NPOL3. The NPOL3 system has been calibrated by using the polarized neutron from the [Formula: see text] reaction, and the resulting effective analyzing power is [Formula: see text]. For the exclusive measurement, the Large Acceptance Spectrometer (LAS) has been used for the recoil proton detection. The energy resolution of 6 MeV is achieved for separation energy, which is sufficient to separate the [Formula: see text] and [Formula: see text] orbits for light nuclei.

Modified Joint Probability Data Association Algorithm Avoiding Track Coalescence

Joint Probabilistic Data Association has proven to be effective in tracking multiple targets from measurements amidst clutter and missed detections. But the traditional Joint Probabilistic Data Association algorithm will cause track coalescence when the targets are parallel neighboring or small-angle crossing. To avoid track coalescence, a modified Joint Probabilistic Data Association algorithm is proposed in this paper. An exclusive measurement is defined for every target in the new algorithm. The exclusive measurement of a target is one measurement which associates with the target and has the maximum associated probability. The associated events of the exclusive measurement with other targets will be pruned, which resists two or more targets share the same measurement as a key measurement and avoids track coalescence. The simulation results show that the new algorithm can effectively solve track coalescence problem in all kinds of scenarios and keep a high tracking performance.

Controlling Track Coalescence Using Improved JPDA Filter

In this paper a modified JPDA algorithm to avoid track coalescence is proposed. An exclusive measurement is defined for every target in the new algorithm, and with other targets will be pruned, which resists two or more targets share the same measurement as a key measurement and avoids track coalescence. The simulation results show that the new algorithm can effectively solve track coalescence problem in all kinds of scenarios, while keeping a high tracking performance.