Note about a second "evidence" for a WIMP annual modulation

This note, with its five questions, is intended to contribute to a clarification about a claimed "evidence" by the DAMA group of an annual modulation of the counting rate of a Dark Matter NaI(Tl) detector as due to a neutralino (SUSY-LSP) Dark Matter candidate.Comment: LaTex, 3 pages, 2 figure

Efficient discrete-time simulations of continuous-time quantum query algorithms

The continuous-time query model is a variant of the discrete query model in which queries can be interleaved with known operations (called "driving operations") continuously in time. Interesting algorithms have been discovered in this model, such as an algorithm for evaluating nand trees more efficiently than any classical algorithm. Subsequent work has shown that there also exists an efficient algorithm for nand trees in the discrete query model; however, there is no efficient conversion known for continuous-time query algorithms for arbitrary problems. We show that any quantum algorithm in the continuous-time query model whose total query time is T can be simulated by a quantum algorithm in the discrete query model that makes O[T log(T) / log(log(T))] queries. This is the first upper bound that is independent of the driving operations (i.e., it holds even if the norm of the driving Hamiltonian is very large). A corollary is that any lower bound of T queries for a problem in the discrete-time query model immediately carries over to a lower bound of \Omega[T log(log(T))/log (T)] in the continuous-time query model.Comment: 12 pages, 6 fig

On Quantum Algorithms

Quantum computers use the quantum interference of different computational paths to enhance correct outcomes and suppress erroneous outcomes of computations. In effect, they follow the same logical paradigm as (multi-particle) interferometers. We show how most known quantum algorithms, including quantum algorithms for factorising and counting, may be cast in this manner. Quantum searching is described as inducing a desired relative phase between two eigenvectors to yield constructive interference on the sought elements and destructive interference on the remaining terms.Comment: 15 pages, 8 figure

Study of the performance of a large scale water-Cherenkov detector (MEMPHYS)

MEMPHYS (MEgaton Mass PHYSics) is a proposed large-scale water Cherenkov experiment to be performed deep underground. It is dedicated to nucleon decay searches, neutrinos from supernovae, solar and atmospheric neutrinos, as well as neutrinos from a future Super-Beam or Beta-Beam to measure the CP violating phase in the leptonic sector and the mass hierarchy. A full simulation of the detector has been performed to evaluate its performance for beam physics. The results are given in terms of "Migration Matrices" of reconstructed versus true neutrino energy, taking into account all the experimental effects.Comment: Updated after JCAP's referee's comment

Future large-scale water-Cherenkov detector

MEMPHYS (MEgaton Mass PHYSics) is a proposed large-scale water-Cherenkov experiment to be performed deep underground. It is dedicated to nucleon decay searches and the detection of neutrinos from supernovae, solar, and atmospheric neutrinos, as well as neutrinos from a future beam to measure the CP violating phase in the leptonic sector and the mass hierarchy. This paper provides an overview of the latest studies on the expected performance of MEMPHYS in view of detailed estimates of its physics reach, mainly concerning neutrino beams

Bifidobacteria and lactobacilli in the gut microbiome of children with non-alcoholic fatty liver disease: which strains act as health players?

Introduction: Non-alcoholic fatty liver disease (NAFLD), considered the leading cause of chronic liver disease in children, can often progress from non-alcoholic fatty liver (NAFL) to non-alcoholic steatohepatitis (NASH). It is clear that obesity is one of the main risk factors involved in NAFLD pathogenesis, even if specific mechanisms have yet to be elucidated. We investigated the distribution of intestinal bifidobacteria and lactobacilli in the stools of four groups of children: obese, obese with NAFL, obese with NASH, and healthy, age-matched controls (CTRLs). Material and methods: Sixty-one obese, NAFL and NASH children and 54 CTRLs were enrolled in the study. Anthropometric and metabolic parameters were measured for all subjects. All children with suspected NASH underwent liver biopsy. Bifidobacteria and lactobacilli were analysed in children’s faecal samples, during a broader, 16S rRNA-based pyrosequencing analysis of the gut microbiome. Results: Three Bifidobacterium spp. (Bifidobacterium longum, Bifidobacterium bifidum, and Bifidobacterium adolescentis) and five Lactobacillus spp. (L. zeae, L. vaginalis, L. brevis, L. ruminis, and L. mucosae) frequently recurred in metagenomic analyses. Lactobacillus spp. increased in NAFL, NASH, or obese children compared to CTRLs. Particularly, L. mucosae was significantly higher in obese (p = 0.02426), NAFLD (p = 0.01313) and NASH (p = 0.01079) than in CTRLs. In contrast, Bifidobacterium spp. were more abundant in CTRLs, suggesting a protective and beneficial role of these microorganisms against the aforementioned diseases. Conclusions: Bifidobacteria seem to have a protective role against the development of NAFLD and obesity, highlighting their possible use in developing novel, targeted and effective probiotics

Approximating Fractional Time Quantum Evolution

An algorithm is presented for approximating arbitrary powers of a black box unitary operation, $\mathcal{U}^t$, where $t$ is a real number, and $\mathcal{U}$ is a black box implementing an unknown unitary. The complexity of this algorithm is calculated in terms of the number of calls to the black box, the errors in the approximation, and a certain `gap' parameter. For general $\mathcal{U}$ and large $t$, one should apply $\mathcal{U}$ a total of $\lfloor t \rfloor$ times followed by our procedure for approximating the fractional power $\mathcal{U}^{t-\lfloor t \rfloor}$. An example is also given where for large integers $t$ this method is more efficient than direct application of $t$ copies of $\mathcal{U}$. Further applications and related algorithms are also discussed.Comment: 13 pages, 2 figure