Robustness of Quantum Random Walk Search Algorithm in Hypercube when only first or both first and second neighbors are measured

In this work we study the robustness of two modifications of quantum random walk search algorithm on hypercube. In the first previously suggested modification, on each even iteration only quantum walk is applied. And in the second, the closest neighbors of the solution are measured classically. In our approach the traversing coin is constructed by both generalized Householder reflection and an additional phase multiplier and we investigate the stability of the algorithm to deviations in those phases. We have shown that the unmodified algorithm becomes more robust when a certain relation between those phases is preserved. The first modification we study here does not lead to any change in the robustness of quantum random walk search algorithm. However, when a measurement of the first and second neighbors is included, there are some differences. The most important one, in view of our study of the robustness, is an increase in the stability of the algorithm, especially for large coin dimensions.Comment: 32 pages, 15 figures, 3 tables, 2 Appendice

Low-energy negative muon interaction with matter

Using simulated data, obtained with the FLUKA code, we derive empirical regularities about the propagation and stopping of low-energy negative muons in hydrogen and selected solid materials. The results are intended to help the preliminary stages of the set-up design for experimental studies of muon capture and muonic atom spectroscopy. Provided are approximate expressions for the parameters of the the momentum, spatial and angular distribution of the propagating muons. In comparison with the available data on the stopping power and range of muons (with which they agree in the considered energy range) these results have the advantage to also describe the statistical spread of the muon characteristics of interest.Comment: 17 pages, 9 figures; Version accepted for publication in JINS