A reconnaissance space sensing investigation of crustal structure for a strip from the eastern Sierra Nevada to the Colorado Plateau

There are no author-identified significant results in this report. Research progress in applications of ERTS-1 MSS imagery in study of Basin-Range tectonics is summarized. Field reconnaissance of ERTS-1 image anomalies has resulted in recognition of previously unreported fault zones and regional structural control of volcanic and plutonic activity. NIMBUS, Apollo 9, X-15, U-2, and SLAR imagery are discussed with specific applications, and methods of image enhancement and analysis employed in the research are summarized. Areas studied and methods employed in geologic field work are outlined

Applications of active microwave imagery

The following topics were discussed in reference to active microwave applications: (1) Use of imaging radar to improve the data collection/analysis process; (2) Data collection tasks for radar that other systems will not perform; (3) Data reduction concepts; and (4) System and vehicle parameters: aircraft and spacecraft

Active microwave users working group program planning

A detailed programmatic and technical development plan for active microwave technology was examined in each of four user activities: (1) vegetation; (2) water resources and geologic applications, and (4) oceanographic applications. Major application areas were identified, and the impact of each application area in terms of social and economic gains were evaluated. The present state of knowledge of the applicability of active microwave remote sensing to each application area was summarized and its role relative to other remote sensing devices was examined. The analysis and data acquisition techniques needed to resolve the effects of interference factors were reviewed to establish an operational capability in each application area. Flow charts of accomplished and required activities in each application area that lead to operational capability were structured

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

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 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

Statistical distinguishability between unitary operations

The problem of distinguishing two unitary transformations, or quantum gates, is analyzed and a function reflecting their statistical distinguishability is found. Given two unitary operations, $U_1$ and $U_2$, it is proved that there always exists a finite number $N$ such that $U_1^{\otimes N}$ and $U_2^{\otimes N}$ are perfectly distinguishable, although they were not in the single-copy case. This result can be extended to any finite set of unitary transformations. Finally, a fidelity for one-qubit gates, which satisfies many useful properties from the point of view of quantum information theory, is presented.Comment: 6 pages, REVTEX. The perfect distinguishability result is extended to any finite set of gate

Estimating the functional form for the density dependence from life history data

Two contrasting approaches to the analysis of population dynamics are currently popular: demographic approaches where the associations between demographic rates and statistics summarizing the population dynamics are identified; and time series approaches where the associations between population dynamics, population density, and environmental covariates are investigated. In this paper, we develop an approach to combine these methods and apply it to detailed data from Soay sheep (Ovis aries). We examine how density dependence and climate contribute to fluctuations in population size via age- and sex-specific demographic rates, and how fluctuations in demographic structure influence population dynamics. Density dependence contributes most, followed by climatic variation, age structure fluctuations and interactions between density and climate. We then simplify the density-dependent, stochastic, age-structured demographic model and derive a new phenomenological time series which captures the dynamics better than previously selected functions. The simple method we develop has potential to provide substantial insight into the relative contributions of population and individual-level processes to the dynamics of populations in stochastic environments

Facilitators and Barriers to Person-centred Care in Child and Young People Mental Health Services: A Systematic Review

Implementation of person-centred care has been widely advocated across various health settings and patient populations, including recent policy for child and family services. Nonetheless, evidence suggests that service users are rarely involved in decision-making, whilst their preferences and goals may be often unheard. The aim of the present research was to systematically review factors influencing person-centred care in mental health services for children, young people and families examining perspectives from professionals, service users and carers. This was conducted according to best practice guidelines, and seven academic databases were searched. Overall, 23 qualitative studies were included. Findings from the narrative synthesis of the facilitators and barriers are discussed in light of a recently published systematic review examining person-centred care in mental health services for adults. Facilitators and barriers were broadly similar across both settings. Training professionals in person-centred care, supporting them to use it flexibly to meet the unique needs of service users whilst also being responsive to times when it may be less appropriate and improving both the quantity and quality of information for service users and carers are key recommendations to facilitate person-centred care in mental health services with children, young people and families

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