Water balance complexities in ephemeral catchments with different land uses: Insights from monitoring and distributed hydrologic modeling

Although ephemeral catchments are widespread in arid and semiarid climates, the relationship of their water balance with climate, geology, topography, and land cover is poorly known. Here we use 4 years (2011–2014) of rainfall, streamflow, and groundwater level measurements to estimate the water balance components in two adjacent ephemeral catchments in south-eastern Australia, with one catchment planted with young eucalypts and the other dedicated to grazing pasture. To corroborate the interpretation of the observations, the physically based hydrological model CATHY was calibrated and validated against the data in the two catchments. The estimated water balances showed that despite a significant decline in groundwater level and greater evapotranspiration in the eucalypt catchment (104–119% of rainfall) compared with the pasture catchment (95–104% of rainfall), streamflow consistently accounted for 1–4% of rainfall in both catchments for the entire study period. Streamflow in the two catchments was mostly driven by the rainfall regime, particularly rainfall frequency (i.e., the number of rain days per year), while the downslope orientation of the plantation furrows also promoted runoff. With minimum calibration, the model was able to adequately reproduce the periods of flow in both catchments in all years. Although streamflow and groundwater levels were better reproduced in the pasture than in the plantation, model-computed water balance terms confirmed the estimates from the observations in both catchments. Overall, the interplay of climate, topography, and geology seems to overshadow the effect of land use in the study catchments, indicating that the management of ephemeral catchments remains highly challenging

Parameter Estimation with Mixed-State Quantum Computation

We present a quantum algorithm to estimate parameters at the quantum metrology limit using deterministic quantum computation with one bit. When the interactions occurring in a quantum system are described by a Hamiltonian $H= \theta H_0$, we estimate $\theta$ by zooming in on previous estimations and by implementing an adaptive Bayesian procedure. The final result of the algorithm is an updated estimation of $\theta$ whose variance has been decreased in proportion to the time of evolution under H. For the problem of estimating several parameters, we implement dynamical-decoupling techniques and use the results of single parameter estimation. The cases of discrete-time evolution and reference-frame alignment are also discussed within the adaptive approach.Comment: 12 pages. Improved introduction and technical details moved to Appendi

Contextuality in Measurement-based Quantum Computation

We show, under natural assumptions for qubit systems, that measurement-based quantum computations (MBQCs) which compute a non-linear Boolean function with high probability are contextual. The class of contextual MBQCs includes an example which is of practical interest and has a super-polynomial speedup over the best known classical algorithm, namely the quantum algorithm that solves the Discrete Log problem.Comment: Version 3: probabilistic version of Theorem 1 adde

Quantum Chinos Game: winning strategies through quantum fluctuations

We apply several quantization schemes to simple versions of the Chinos game. Classically, for two players with one coin each, there is a symmetric stable strategy that allows each player to win half of the times on average. A partial quantization of the game (semiclassical) allows us to find a winning strategy for the second player, but it is unstable w.r.t. the classical strategy. However, in a fully quantum version of the game we find a winning strategy for the first player that is optimal: the symmetric classical situation is broken at the quantum level.Comment: REVTEX4.b4 file, 3 table

Understanding Pound-Drever-Hall locking using voltage controlled radio-frequency oscillators: An undergraduate experiment

We have developed a senior undergraduate experiment that illustrates frequency stabilization techniques using radio-frequency electronics. The primary objective is to frequency stabilize a voltage controlled oscillator to a cavity resonance at 800 MHz using the Pound-Drever-Hall method. This technique is commonly applied to stabilize lasers at optical frequencies. By using only radio-frequency equipment it is possible to systematically study aspects of the technique more thoroughly, inexpensively, and free from eye hazards. Students also learn about modular radio-frequency electronics and basic feedback control loops. By varying the temperature of the resonator, students can determine the thermal expansion coefficients of copper, aluminum, and super invar.Comment: 9 pages, 10 figure

Improved quantum algorithms for the ordered search problem via semidefinite programming

One of the most basic computational problems is the task of finding a desired item in an ordered list of N items. While the best classical algorithm for this problem uses log_2 N queries to the list, a quantum computer can solve the problem using a constant factor fewer queries. However, the precise value of this constant is unknown. By characterizing a class of quantum query algorithms for ordered search in terms of a semidefinite program, we find new quantum algorithms for small instances of the ordered search problem. Extending these algorithms to arbitrarily large instances using recursion, we show that there is an exact quantum ordered search algorithm using 4 log_{605} N \approx 0.433 log_2 N queries, which improves upon the previously best known exact algorithm.Comment: 8 pages, 4 figure

Quantum Search with Two-atom Collisions in Cavity QED

We propose a scheme to implement two-qubit Grover's quantum search algorithm using Cavity Quantum Electrodynamics. Circular Rydberg atoms are used as quantum bits (qubits). They interact with the electromagnetic field of a non-resonant cavity . The quantum gate dynamics is provided by a cavity-assisted collision, robust against decoherence processes. We present the detailed procedure and analyze the experimental feasibility.Comment: 4 pages, 2 figure

The return of the four- and five-dimensional preons

We prove the existence of 3/4-BPS preons in four- and five-dimensional gauged supergravities by explicitly constructing them as smooth quotients of the AdS_4 and AdS_5 maximally supersymmetric backgrounds, respectively. This result illustrates how the spacetime topology resurrects a fraction of supersymmetry previously ruled out by the local analysis of the Killing spinor equations.Comment: 10 pages (a minor imprecision has been corrected

Energy gaps in quantum first-order mean-field-like transitions: The problems that quantum annealing cannot solve

We study first-order quantum phase transitions in models where the mean-field traitment is exact, and the exponentially fast closure of the energy gap with the system size at the transition. We consider exactly solvable ferromagnetic models, and show that they reduce to the Grover problem in a particular limit. We compute the coefficient in the exponential closure of the gap using an instantonic approach, and discuss the (dire) consequences for quantum annealing.Comment: 6 pages, 3 figure

Quantum walks on quotient graphs

A discrete-time quantum walk on a graph is the repeated application of a unitary evolution operator to a Hilbert space corresponding to the graph. If this unitary evolution operator has an associated group of symmetries, then for certain initial states the walk will be confined to a subspace of the original Hilbert space. Symmetries of the original graph, given by its automorphism group, can be inherited by the evolution operator. We show that a quantum walk confined to the subspace corresponding to this symmetry group can be seen as a different quantum walk on a smaller quotient graph. We give an explicit construction of the quotient graph for any subgroup of the automorphism group and illustrate it with examples. The automorphisms of the quotient graph which are inherited from the original graph are the original automorphism group modulo the subgroup used to construct it. We then analyze the behavior of hitting times on quotient graphs. Hitting time is the average time it takes a walk to reach a given final vertex from a given initial vertex. It has been shown in earlier work [Phys. Rev. A {\bf 74}, 042334 (2006)] that the hitting time can be infinite. We give a condition which determines whether the quotient graph has infinite hitting times given that they exist in the original graph. We apply this condition for the examples discussed and determine which quotient graphs have infinite hitting times. All known examples of quantum walks with fast hitting times correspond to systems with quotient graphs much smaller than the original graph; we conjecture that the existence of a small quotient graph with finite hitting times is necessary for a walk to exhibit a quantum speed-up.Comment: 18 pages, 7 figures in EPS forma