Direct Observation of Large Amplitude Spin Excitations Localized in a Spin-Transfer Nanocontact

We report the direct observation of large amplitude spin-excitations localized in a spin-transfer nanocontact using scanning transmission x-ray microscopy. Experiments were conducted using a nanocontact to an ultrathin ferromagnetic multilayer with perpendicular magnetic anisotropy. Element resolved x-ray magnetic circular dichroism images show an abrupt onset of spin excitations at a threshold current that are localized beneath the nanocontact, with average spin precession cone angles of 25{\deg} at the contact center. The results strongly suggest that we have observed a localized magnetic soliton.Comment: 5 pages, 3 figure

X-Ray Detection of Transient Magnetic Moments Induced by a Spin Current in Cu

We have used a MHz lock-in x-ray spectro-microscopy technique to directly detect changes of magnetic moments in Cu due to spin injection from an adjacent Co layer. The elemental and chemical specificity of x-rays allows us to distinguish two spin current induced effects. We detect the creation of transient magnetic moments of $3\times 10^{-5}$ $\mu_\mathrm{B}$ on Cu atoms within the bulk of the 28 nm thick Cu film due to spin-accumulation. The moment value is compared to predictions by Mott's two current model. We also observe that the hybridization induced existing magnetic moments on Cu interface atoms are transiently increased by about 10% or $4\times 10^{-3}$ $\mu_\mathrm{B}$. This reveals the dominance of spin-torque alignment over Joule heat induced disorder of the interfacial Cu moments during current flow

{EDISON}-{WMW}: Exact Dynamic Programing Solution of the {Wilcoxon}-{Mann}-{Whitney} Test

In many research disciplines, hypothesis tests are applied to evaluate whether findings are statistically significant or could be explained by chance. The Wilcoxon–Mann–Whitney (WMW) test is among the most popular hypothesis tests in medicine and life science to analyze if two groups of samples are equally distributed. This nonparametric statistical homogeneity test is commonly applied in molecular diagnosis. Generally, the solution of the WMW test takes a high combinatorial effort for large sample cohorts containing a significant number of ties. Hence, P value is frequently approximated by a normal distribution. We developed EDISON-WMW, a new approach to calculate the exact permutation of the two-tailed unpaired WMW test without any corrections required and allowing for ties. The method relies on dynamic programing to solve the combinatorial problem of the WMW test efficiently. Beyond a straightforward implementation of the algorithm, we presented different optimization strategies and developed a parallel solution. Using our program, the exact P value for large cohorts containing more than 1000 samples with ties can be calculated within minutes. We demonstrate the performance of this novel approach on randomly-generated data, benchmark it against 13 other commonly-applied approaches and moreover evaluate molecular biomarkers for lung carcinoma and chronic obstructive pulmonary disease (COPD). We found that approximated P values were generally higher than the exact solution provided by EDISON-WMW. Importantly, the algorithm can also be applied to high-throughput omics datasets, where hundreds or thousands of features are included. To provide easy access to the multi-threaded version of EDISON-WMW, a web-based solution of our algorithm is freely available at http://www.ccb.uni-saarland.de/software/wtest/

Composable security of delegated quantum computation

Delegating difficult computations to remote large computation facilities, with appropriate security guarantees, is a possible solution for the ever-growing needs of personal computing power. For delegated computation protocols to be usable in a larger context---or simply to securely run two protocols in parallel---the security definitions need to be composable. Here, we define composable security for delegated quantum computation. We distinguish between protocols which provide only blindness---the computation is hidden from the server---and those that are also verifiable---the client can check that it has received the correct result. We show that the composable security definition capturing both these notions can be reduced to a combination of several distinct "trace-distance-type" criteria---which are, individually, non-composable security definitions. Additionally, we study the security of some known delegated quantum computation protocols, including Broadbent, Fitzsimons and Kashefi's Universal Blind Quantum Computation protocol. Even though these protocols were originally proposed with insufficient security criteria, they turn out to still be secure given the stronger composable definitions.Comment: 37+9 pages, 13 figures. v3: minor changes, new references. v2: extended the reduction between composable and local security to include entangled inputs, substantially rewritten the introduction to the Abstract Cryptography (AC) framewor