Related papers: A Note on Occur-Check
In this paper, we consider a matroid generalization of the stable matching problem. In particular, we consider the setting where preferences may contain ties. For this generalization, we propose a polynomial-time algorithm for the problem…
The use of annotations, referred to as assertions or contracts, to describe program properties for which run-time tests are to be generated, has become frequent in dynamic programing languages. However, the frameworks proposed to support…
We propose and experimentally demonstrate an approximate universal-NOT (U-NOT) operation that is robust against operational errors. In our proposal, the U-NOT operation is composed of stochastic unitary operations represented by the…
UNO (Underground Neutrino Observatory) is intended as a multi-purpose detector, potentially useful for purposes which may not have been considered at the time of its construction. UNO accomodates a comprehensive physics program,…
In this paper we propose a new state observer design technique for nonlinear systems. It consists of an extension of the recently introduced parameter estimation-based observer, which is applicable for systems verifying a particular…
In this paper we explore the effect of non-unitary neutrino mixing on neutrino oscillation probabilities both in vacuum and matter. In particular, we consider the $\nu_\mu \to \nu_\tau$ channel and using a Neutrino Factory as the source for…
Accelerator-based neutrino oscillation experiments have the potential to revolutionise our understanding of fundamental physics, offering an opportunity to characterise charge-parity violation in the lepton sector; to determine the neutrino…
Nguyen (2016, 2017) claimed that he has developed a simplifying set of the Kohlberg criteria that involves checking the balancedness of at most $(n-1)$ sets of coalitions. This claim is not true. Analogous to Nguyen and Thomas (2016), he…
In a recent work, authors prove a yet another no-go theorem that forbids the existence of a universal probabilistic quantum protocol producing a superposition of two unknown quantum states. In this short note, we show that in the presence…
Motivated by settings such as medical treatments or aircraft maintenance, we consider a scheduling problem with jobs that consist of two operations, a test and a processing part. The time required to execute the test is known in advance…
The precise measurement of neutrino properties is among the highest priorities in fundamental particle physics, involving many experiments worldwide. Since the experiments rely on the interactions of neutrinos with bound nucleons inside…
We consider theoretically ionization of an atom by neutrino impact taking into account electromagnetic interactions predicted for massive neutrinos by theories beyond the Standard Model. The effects of atomic recoil in this process are…
The simplest unified extension of the Minimal Supersymmetric Standard Model with bilinear R--Parity violation provides a predictive scheme for neutrino masses which can account for the observed atmospheric and solar neutrino…
Sequential testing problems involve a complex system with several components, each of which is "working" with some independent probability. The outcome of each component can be determined by performing a test, which incurs some cost. The…
We study the influence of errors and decoherence on both the performance of Shor's factoring algorithm and Grover's search algorithm, and on the amount of interference in these algorithms using a recently proposed interference measure. We…
We show how neutrino data can be used in order to constrain the free parameters of possible extensions to the standard model of elementary particles (SM). For definiteness, we focus in the recently proposed unparticle scenario. We show that…
The masking-one-out (MOO) procedure, masking an observed entry and comparing it versus its imputed values, is a very common procedure for comparing imputation models. We study the optimum of this procedure and generalize it to a missing…
Despite their inextricable quantum mechanical nature, events at a high energy particle collider experiment typically have very few unambiguous quantum signatures, due the type of data and the manner in which they are collected. We present a…
In the uniformity testing task, an algorithm is provided with samples from an unknown probability distribution over a (known) finite domain, and must decide whether it is the uniform distribution, or, alternatively, if its total variation…
In an ordinary quantum algorithm the gates are applied in a fixed order on the systems. The introduction of indefinite causal structures allows to relax this constraint and control the order of the gates with an additional quantum state. It…