The Optimal Single Copy Measurement for the Hidden Subgroup Problem

The optimization of measurements for the state distinction problem has recently been applied to the theory of quantum algorithms with considerable successes, including efficient new quantum algorithms for the non-abelian hidden subgroup problem. Previous work has identified the optimal single copy measurement for the hidden subgroup problem over abelian groups as well as for the non-abelian problem in the setting where the subgroups are restricted to be all conjugate to each other. Here we describe the optimal single copy measurement for the hidden subgroup problem when all of the subgroups of the group are given with equal a priori probability. The optimal measurement is seen to be a hybrid of the two previously discovered single copy optimal measurements for the hidden subgroup problem.Comment: 8 pages. Error in main proof fixe

The Potential Wind Power Resource in Australia: A New Perspective

Australia is considered to have very good wind resources, and the utilization of this renewable energy resource is increasing. Wind power installed capacity increased by 35% from 2006 to 2011 and is predicted to account for over 12% of Australia’s electricity generation in 2030. This study uses a recently published methodology to address the limitations of previous wind resource analyses, and frames the nature of Australia’s wind resources from the perspective of economic viability, using robust metrics of the abundance, variability and intermittency of wind power density, and analyzes whether these differ with higher wind turbine hub heights. We also assess the extent to which wind intermittency can potentially be mitigated by the aggregation of geographically dispersed wind farms. Our results suggest that over much of Australia, areas that have high wind intermittency coincide with large expanses in which the aggregation of turbine output does not mitigate variability. These areas are also geographically remote, some are disconnected from the east coast’s electricity grid and large population centers, and often are not connected or located near enough to high capacity electricity infrastructure, all of which would decrease the potential economic viability of wind farms in these locations. However, on the eastern seaboard, even though the wind resource is weaker, it is less variable, much closer to large population centers, and there exists more potential to mitigate its intermittency through aggregation.The authors gratefully acknowledge the financial support for this work provided by the MIT Joint Program on the Science and Policy of Global Change through a number of federal agencies and industrial sponsors including US Department of Energy grant DE-FG02-94ER61937

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

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

Performance of the ARIANNA Hexagonal Radio Array

Installation of the ARIANNA Hexagonal Radio Array (HRA) on the Ross Ice Shelf of Antarctica has been completed. This detector serves as a pilot program to the ARIANNA neutrino telescope, which aims to measure the diffuse flux of very high energy neutrinos by observing the radio pulse generated by neutrino-induced charged particle showers in the ice. All HRA stations ran reliably and took data during the entire 2014-2015 austral summer season. A new radio signal direction reconstruction procedure is described, and is observed to have a resolution better than a degree. The reconstruction is used in a preliminary search for potential neutrino candidate events in the data from one of the newly installed detector stations. Three cuts are used to separate radio backgrounds from neutrino signals. The cuts are found to filter out all data recorded by the station during the season while preserving 85.4% of simulated neutrino events that trigger the station. This efficiency is similar to that found in analyses of previous HRA data taking seasons.Comment: Proceedings from the 34th ICRC2015, http://icrc2015.nl/ . 8 pages, 6 figure

ARIS-Campaign: intercomparison of three ground based 22 GHz radiometers for middle atmospheric water vapor at the Zugspitze in winter 2009

This paper presents the Alpine Radiometer Intercomparison at the Schneefernerhaus (ARIS), which took place in winter 2009 at the high altitude station at the Zugspitze, Germany (47.42° N, 10.98° E, 2650 m). This campaign was the first direct intercomparison between three new ground based 22 GHz water vapor radiometers for middle atmospheric profiling with the following instruments participating: MIRA 5 (Karlsruhe Institute of Technology), cWASPAM3 (Max Planck Institute for Solar System Research, Katlenburg-Lindau) and MIAWARA-C (Institute of Applied Physics, University of Bern). Even though the three radiometers all measure middle atmospheric water vapor using the same rotational transition line and similar fundamental set-ups, there are major differences between the front ends, the back ends, the calibration concepts and the profile retrieval. The spectrum comparison shows that all three radiometers measure spectra without severe baseline artifacts and that the measurements are in good general agreement. The measurement noise shows good agreement to the values theoretically expected from the radiometer noise formula. At the same time the comparison of the noise levels shows that there is room for instrumental and calibration improvement, emphasizing the importance of low elevation angles for the observation, a low receiver noise temperature and an efficient calibration scheme. <br><br> The comparisons of the retrieved profiles show that the agreement between the profiles of MIAWARA-C and cWASPAM3 with the ones of MLS is better than 0.3 ppmv (6%) at all altitudes. MIRA 5 has a dry bias of approximately 0.5 ppm (8%) below 0.1 hPa with respect to all other instruments. The profiles of cWASPAM3 and MIAWARA-C could not be directly compared because the vertical region of overlap was too small. The comparison of the time series at different altitude levels show a similar evolution of the H<sub>2</sub>O volume mixing ratio (VMR) for the ground based instruments as well as the space borne sensor MLS

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]

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