相关论文: A Note on Occur-Check
The possibility to observe quantum Zeno and anti-Zeno scenarios for atom-diatom reactive collisions is investigated for two diferent processes (F+HD and H+O_2) by means of time-dependent wave packet propagations. A novel approach is…
Using a neutron double-slit setup, we construct a quantum bit commitment scheme in which time development of quantum states plays an essential role. Our scheme evades the widely accepted no-go theorem by the fact that it is neither possible…
We make use of the comparison between measurements of various pairs of atomic clocks to impose constraints on coupled variations of fundamental constants in severs unification scenarios. We obtain null results for the proton-to-electron…
We provide the theoretical basis for understanding the phenomenon in which an ultra cold atom incident on a possibly warm target will not stick, even in the large $n$ limit where $n$ is the number of internal degrees of freedom of the…
This paper focusses on "safe" screening techniques for the LASSO problem. Motivated by the need for low-complexity algorithms, we propose a new approach, dubbed "joint" screening test, allowing to screen a set of atoms by carrying out one…
We verify the correctness of a variety of mutual exclusion algorithms through model checking. We look at algorithms where communication is via shared read/write registers, where those registers can be atomic or non-atomic. For the…
In applied settings, tests of hypothesis where a nuisance parameter is only identifiable under the alternative often reduces into one of Testing One Hypothesis Multiple times (TOHM). Specifically, a fine discretization of the space of the…
Low-rank matrix completion concerns the problem of estimating unobserved entries in a matrix using a sparse set of observed entries. We consider the non-uniform setting where the observed entries are sampled with highly varying…
Kolmogorov complexity and algorithmic probability are defined only up to an additive resp. multiplicative constant, since their actual values depend on the choice of the universal reference computer. In this paper, we analyze a natural…
We discuss the usage of measurements of the stability of nature's fundamental constants coming from comparisons between atomic clocks as a means to constrain coupled variations of these constants in a broad class of unification scenarios.…
At long-baseline neutrino experiments, neutral-current (NC) events accumulate in large numbers but are seldom exploited for new physics searches. We demonstrate their potential using non-standard neutrino interactions (NSI) with quarks as a…
A sample of two proton and no pion events selected in the ArgoNeuT neutrino scattering experiment on liquid argon target [Phys. Rev. D90 (2014) 012008] is analyzed with NuWro Monte Carlo event generator. An attempt is made to estimate how…
We propose an annealing scheme usable on modern Ising machines for crystal structures prediction (CSP) by taking into account the general n-body atomic interactions, and in particular three-body interactions which are necessary to simulate…
We revisit occurrence typing, a technique to refine the type of variables occurring in type-cases and, thus, capturesome programming patterns used in untyped languages. Although occurrence typing was tied from its inceptionto set-theoretic…
Neutron and x-ray scattering experiments traditionally rely upon histogrammed data sets, which are analysed using least-squares curve fitting of multiple probability distribution components to quantify separately the various scientific…
Unstable particles decay sooner or later, so they are not described by asymptotic one-particle states and they should not be included as independent states in unitarity relations such as the optical theorem. The same applies to any…
Algorithms with unitary oracles can be nested, which makes them extremely versatile. An example is the phase estimation algorithm used in many candidate algorithms for quantum speed-up. The search for new quantum algorithms benefits from…
Nonunitarity can arise in neutrino oscillation when the matrix with elements $\mathbf{U}_{\alpha i}$ which relate the neutrino flavor $\alpha$ and mass $i$ eigenstates is not unitary when sum over the kinematically accessible mass…
We study the unsorted database search problem with items $N$ from the viewpoint of unitary discrimination. Instead of considering the famous $O(\sqrt{N})$ Grover's the bounded-error algorithm for the original problem, we seek for the…
The generalized egg dropping problem is a classic challenge in sequential decision-making. Standard dynamic programming evaluates the minimax minimum number of tests in $\mathcal{O}(K \cdot N^2)$ time. A known approach formulates the…