Including Systematic Uncertainties in Confidence Interval Construction for Poisson Statistics

One way to incorporate systematic uncertainties into the calculation of confidence intervals is by integrating over probability density functions parametrizing the uncertainties. In this note we present a development of this method which takes into account uncertainties in the prediction of background processes, uncertainties in the signal detection efficiency and background efficiency and allows for a correlation between the signal and background detection efficiencies. We implement this method with the Feldman & Cousins unified approach with and without conditioning. We present studies of coverage for the Feldman & Cousins and Neyman ordering schemes. In particular, we present two different types of coverage tests for the case where systematic uncertainties are included. To illustrate the method we show the relative effect of including systematic uncertainties the case of dark matter search as performed by modern neutrino tel escopes.Comment: 23 pages, 10 figures, replaced to match published versio

An efficient quantum algorithm for the hidden subgroup problem in extraspecial groups

Extraspecial groups form a remarkable subclass of p-groups. They are also present in quantum information theory, in particular in quantum error correction. We give here a polynomial time quantum algorithm for finding hidden subgroups in extraspecial groups. Our approach is quite different from the recent algorithms presented in [17] and [2] for the Heisenberg group, the extraspecial p-group of size p3 and exponent p. Exploiting certain nice automorphisms of the extraspecial groups we define specific group actions which are used to reduce the problem to hidden subgroup instances in abelian groups that can be dealt with directly.Comment: 10 page

Diurnal salivary cortisol concentrations in Parkinson’s disease: increased total secretion and morning cortisol concentrations

Background:Parkinson’s disease (PD) is a chronic neurodegenerative disorder. There is limited knowledge about the function of the hypothalamic-pituitary-adrenal axis in PD. The primary aim of this prospective study was to analyze diurnal salivary cortisol concentrations in patients with PD and correlate these with age, gender, body mass index (BMI), duration of PD, and pain. The secondary aim was to compare the results with a healthy reference group. Methods:Fifty-nine PD patients, 35 women and 24 men, aged 50–79 years, were recruited. The reference group comprised healthy individuals matched for age, gender, BMI, and time point for sampling. Salivary cortisol was collected at 8 am, 1 pm, and 8 pm, and 8 am the next day using cotton-based Salivette ®tubes and analyzed using Spectria®Cortisol I125. A visual analog scale was used for estimation of pain. Results:The median cortisol concentration was 16.0 (5.8–30.2) nmol/L at 8 am, 5.8 (3.0–16.4) at 1 pm, 2.8 (1.6–8.0) at 8 pm, and 14.0 (7.5–28.7) at 8 am the next day. Total secretion and rate of cortisol secretion during the day (8 am–8 pm) and the concentration of cortisol on the next morning were lower (12.5 nmol/L) in the reference group. No significant correlations with age, gender, BMI, duration of PD, Hoehn and Yahr score, Unified Parkinson’s Disease Rating Scale III score, gait, pain, or cortisol concentrations were found. Conclusion:The neurodegenerative changes in PD does not seem to interfere with the hypothalamic-pituitary-adrenal axis. Salivary cortisol concentrations in PD patients were increased in the morning compared with the reference group, and were not influenced by motor dysfunction, duration of disease, or coexistence of chronic or acute pain

Random Oracles in a Quantum World

The interest in post-quantum cryptography - classical systems that remain secure in the presence of a quantum adversary - has generated elegant proposals for new cryptosystems. Some of these systems are set in the random oracle model and are proven secure relative to adversaries that have classical access to the random oracle. We argue that to prove post-quantum security one needs to prove security in the quantum-accessible random oracle model where the adversary can query the random oracle with quantum states. We begin by separating the classical and quantum-accessible random oracle models by presenting a scheme that is secure when the adversary is given classical access to the random oracle, but is insecure when the adversary can make quantum oracle queries. We then set out to develop generic conditions under which a classical random oracle proof implies security in the quantum-accessible random oracle model. We introduce the concept of a history-free reduction which is a category of classical random oracle reductions that basically determine oracle answers independently of the history of previous queries, and we prove that such reductions imply security in the quantum model. We then show that certain post-quantum proposals, including ones based on lattices, can be proven secure using history-free reductions and are therefore post-quantum secure. We conclude with a rich set of open problems in this area.Comment: 38 pages, v2: many substantial changes and extensions, merged with a related paper by Boneh and Zhandr

Exploring out-of-equilibrium quantum magnetism and thermalization in a spin-3 many-body dipolar lattice system

Understanding quantum thermalization through entanglement build-up in isolated quantum systems addresses fundamental questions on how unitary dynamics connects to statistical physics. Here, we study the spin dynamics and approach towards local thermal equilibrium of a macroscopic ensemble of S = 3 spins prepared in a pure coherent spin state, tilted compared to the magnetic field, under the effect of magnetic dipole-dipole interactions. The experiment uses a unit filled array of 104 chromium atoms in a three dimensional optical lattice, realizing the spin-3 XXZ Heisenberg model. The buildup of quantum correlation during the dynamics, especially as the angle approaches pi/2, is supported by comparison with an improved numerical quantum phase-space method and further confirmed by the observation that our isolated system thermalizes under its own dynamics, reaching a steady state consistent with the one extracted from a thermal ensemble with a temperature dictated from the system's energy. This indicates a scenario of quantum thermalization which is tied to the growth of entanglement entropy. Although direct experimental measurements of the Renyi entropy in our macroscopic system are unfeasible, the excellent agreement with the theory, which can compute this entropy, does indicate entanglement build-up.Comment: 12 figure

Almost uniform sampling via quantum walks

Many classical randomized algorithms (e.g., approximation algorithms for #P-complete problems) utilize the following random walk algorithm for {\em almost uniform sampling} from a state space $S$ of cardinality $N$: run a symmetric ergodic Markov chain $P$ on $S$ for long enough to obtain a random state from within $\epsilon$ total variation distance of the uniform distribution over $S$. The running time of this algorithm, the so-called {\em mixing time} of $P$, is $O(\delta^{-1} (\log N + \log \epsilon^{-1}))$, where $\delta$ is the spectral gap of $P$. We present a natural quantum version of this algorithm based on repeated measurements of the {\em quantum walk} $U_t = e^{-iPt}$. We show that it samples almost uniformly from $S$ with logarithmic dependence on $\epsilon^{-1}$ just as the classical walk $P$ does; previously, no such quantum walk algorithm was known. We then outline a framework for analyzing its running time and formulate two plausible conjectures which together would imply that it runs in time $O(\delta^{-1/2} \log N \log \epsilon^{-1})$ when $P$ is the standard transition matrix of a constant-degree graph. We prove each conjecture for a subclass of Cayley graphs.Comment: 13 pages; v2 added NSF grant info; v3 incorporated feedbac

Optical Properties of Deep Ice at the South Pole - Absorption

We discuss recent measurements of the wavelength-dependent absorption coefficients in deep South Pole ice. The method uses transit time distributions of pulses from a variable-frequency laser sent between emitters and receivers embedded in the ice. At depths of 800 to 1000 m scattering is dominated by residual air bubbles, whereas absorption occurs both in ice itself and in insoluble impurities. The absorption coefficient increases approximately exponentially with wavelength in the measured interval 410 to 610 nm. At the shortest wavelength our value is about a factor 20 below previous values obtained for laboratory ice and lake ice; with increasing wavelength the discrepancy with previous measurements decreases. At around 415 to 500 nm the experimental uncertainties are small enough for us to resolve an extrinsic contribution to absorption in ice: submicron dust particles contribute by an amount that increases with depth and corresponds well with the expected increase seen near the Last Glacial Maximum in Vostok and Dome C ice cores. The laser pulse method allows remote mapping of gross structure in dust concentration as a function of depth in glacial ice.Comment: 26 pages, LaTex, Accepted for publication in Applied Optics. 9 figures, not included, available on request from [email protected]

Computational Indistinguishability between Quantum States and Its Cryptographic Application

We introduce a computational problem of distinguishing between two specific quantum states as a new cryptographic problem to design a quantum cryptographic scheme that is "secure" against any polynomial-time quantum adversary. Our problem, QSCDff, is to distinguish between two types of random coset states with a hidden permutation over the symmetric group of finite degree. This naturally generalizes the commonly-used distinction problem between two probability distributions in computational cryptography. As our major contribution, we show that QSCDff has three properties of cryptographic interest: (i) QSCDff has a trapdoor; (ii) the average-case hardness of QSCDff coincides with its worst-case hardness; and (iii) QSCDff is computationally at least as hard as the graph automorphism problem in the worst case. These cryptographic properties enable us to construct a quantum public-key cryptosystem, which is likely to withstand any chosen plaintext attack of a polynomial-time quantum adversary. We further discuss a generalization of QSCDff, called QSCDcyc, and introduce a multi-bit encryption scheme that relies on similar cryptographic properties of QSCDcyc.Comment: 24 pages, 2 figures. We improved presentation, and added more detail proofs and follow-up of recent wor

The AMANDA Neutrino Telescope and the Indirect Search for Dark Matter

With an effective telescope area of order 10^4 m^2, a threshold of ~50 GeV and a pointing accuracy of 2.5 degrees, the AMANDA detector represents the first of a new generation of high energy neutrino telescopes, reaching a scale envisaged over 25 years ago. We describe its performance, focussing on the capability to detect halo dark matter particles via their annihilation into neutrinos.Comment: Latex2.09, 16 pages, uses epsf.sty to place 15 postscript figures. Talk presented at the 3rd International Symposium on Sources and Detection of Dark Matter in the Universe (DM98), Santa Monica, California, Feb. 199