Horizons in de-Sitter Supergravity

We classify all pseudo-supersymmetric extremal near-horizon geometries in minimal five-dimensional de-Sitter supergravity. It is shown that the only such near-horizon geometry is the near-horizon geometry of the de-Sitter BMPV solution, and hence there are no regular extremal pseudo-supersymmetric asymptotically de-Sitter black rings.Comment: 26 pages, latex. Minor typos in equations (4.16) and (6.12) correcte

The Harlem Children's Zone, Promise Neighborhoods, and the Broader, Bolder Approach to Education

Examines the role of community services in raising academic achievement in the Harlem Children's Zone. Questions the effectiveness of replicating the neighborhood approach, rather than the schools-only approach, in the Promise Neighborhoods Initiative

Determination of sea surface temperatures from microwave and IR data

Microwave measurements from the Nimbus 7 SMMR were used to derive the atmospheric precipitable water, which was then used to obtain the atmospheric correction for use with AVHRR thermal IR measurements to obtain sea surface temperature (SST). The resulting SST's were compared with the NOAA operational sea surface temperature measurements, and the two sets of measurements were found to be in reasonable agreement. The average residuals between the two sets of measurements was 0.15 K with the NOAA operational SST's being slightly greater

Hamiltonian and measuring time for analog quantum search

We derive in this study a Hamiltonian to solve with certainty the analog quantum search problem analogue to the Grover algorithm. The general form of the initial state is considered. Since the evaluation of the measuring time for finding the marked state by probability of unity is crucially important in the problem, especially when the Bohr frequency is high, we then give the exact formula as a function of all given parameters for the measuring time.Comment: 5 page

Quantum computers can search rapidly by using almost any transformation

A quantum computer has a clear advantage over a classical computer for exhaustive search. The quantum mechanical algorithm for exhaustive search was originally derived by using subtle properties of a particular quantum mechanical operation called the Walsh-Hadamard (W-H) transform. This paper shows that this algorithm can be implemented by replacing the W-H transform by almost any quantum mechanical operation. This leads to several new applications where it improves the number of steps by a square-root. It also broadens the scope for implementation since it demonstrates quantum mechanical algorithms that can readily adapt to available technology.Comment: This paper is an adapted version of quant-ph/9711043. It has been modified to make it more readable for physicists. 9 pages, postscrip

Quantum error correction of systematic errors using a quantum search framework

Composite pulses are a quantum control technique for canceling out systematic control errors. We present a new composite pulse sequence inspired by quantum search. Our technique can correct a wider variety of systematic errors -- including, for example, nonlinear over-rotational errors -- than previous techniques. Concatenation of the pulse sequence can reduce a systematic error to an arbitrarily small level.Comment: 6 pages, 2 figure

Quantum Searching via Entanglement and Partial Diffusion

In this paper, we will define a quantum operator that performs the inversion about the mean only on a subspace of the system (Partial Diffusion Operator). This operator is used in a quantum search algorithm that runs in O(sqrt{N/M}) for searching an unstructured list of size N with M matches such that 1<= M<=N. We will show that the performance of the algorithm is more reliable than known {fixed operators quantum search algorithms} especially for multiple matches where we can get a solution after a single iteration with probability over 90% if the number of matches is approximately more than one-third of the search space. We will show that the algorithm will be able to handle the case where the number of matches M is unknown in advance such that 1<=M<=N in O(sqrt{N/M}). A performance comparison with Grover's algorithm will be provided.Comment: 19 pages. Submitted to IJQI. Please forward comments/enquires for the first author to [email protected]

Quantum circuit implementation of the Hamiltonian versions of Grover's algorithm

We analyze three different quantum search algorithms, the traditional Grover's algorithm, its continuous-time analogue by Hamiltonian evolution, and finally the quantum search by local adiabatic evolution. We show that they are closely related algorithms in the sense that they all perform a rotation, at a constant angular velocity, from a uniform superposition of all states to the solution state. This make it possible to implement the last two algorithms by Hamiltonian evolution on a conventional quantum circuit, while keeping the quadratic speedup of Grover's original algorithm.Comment: 5 pages, 3 figure