Null Half-Supersymmetric Solutions in Five-Dimensional Supergravity

We classify half-supersymmetric solutions of gauged N=2, D=5 supergravity coupled to an arbitrary number of abelian vector multiplets for which all of the Killing spinors generate null Killing vectors. We show that there are four classes of solutions, and in each class we find the metric, scalars and gauge field strengths. When the scalar manifold is symmetric, the solutions correspond to a class of local near horizon geometries recently found by Kunduri and Lucietti.Comment: 46 pages, typos corrected and reference added. Section 7.1 has been added: it is shown that the solutions found here correspond to a class of solutions found in arXiv:0708.3695. Uses JHEP3.cl

Measurement of an integral of a classical field with a single quantum particle

A method for measuring an integral of a classical field via local interaction of a single quantum particle in a superposition of 2^N states is presented. The method is as efficient as a quantum method with N qubits passing through the field one at a time and it is exponentially better than any known classical method that uses N bits passing through the field one at a time. A related method for searching a string with a quantum particle is proposed.Comment: 3 page

Situating multimodal learning analytics

The digital age has introduced a host of new challenges and opportunities for the learning sciences community. These challenges and opportunities are particularly abundant in multimodal learning analytics (MMLA), a research methodology that aims to extend work from Educational Data Mining (EDM) and Learning Analytics (LA) to multimodal learning environments by treating multimodal data. Recognizing the short-term opportunities and longterm challenges will help develop proof cases and identify grand challenges that will help propel the field forward. To support the field's growth, we use this paper to describe several ways that MMLA can potentially advance learning sciences research and touch upon key challenges that researchers who utilize MMLA have encountered over the past few years

Information embedding meets distributed control

We consider the problem of information embedding where the encoder modifies a white Gaussian host signal in a power-constrained manner to encode the message, and the decoder recovers both the embedded message and the modified host signal. This extends the recent work of Sumszyk and Steinberg to the continuous-alphabet Gaussian setting. We show that a dirty-paper-coding based strategy achieves the optimal rate for perfect recovery of the modified host and the message. We also provide bounds for the extension wherein the modified host signal is recovered only to within a specified distortion. When specialized to the zero-rate case, our results provide the tightest known lower bounds on the asymptotic costs for the vector version of a famous open problem in distributed control -- the Witsenhausen counterexample. Using this bound, we characterize the asymptotically optimal costs for the vector Witsenhausen problem numerically to within a factor of 1.3 for all problem parameters, improving on the earlier best known bound of 2.Comment: 19 pages, 7 figures. Presented at ITW'10. Submitted to IEEE Transactions on Information Theor

Query complexity for searching multiple marked states from an unsorted database

An important and usual problem is to search all states we want from a database with a large number of states. In such, recall is vital. Grover's original quantum search algorithm has been generalized to the case of multiple solutions, but no one has calculated the query complexity in this case. We will use a generalized algorithm with higher precision to solve such a search problem that we should find all marked states and show that the practical query complexity increases with the number of marked states. In the end we will introduce an algorithm for the problem on a ``duality computer'' and show its advantage over other algorithms.Comment: 4 pages,4 figures,twocolum

Nested quantum search and NP-complete problems

A quantum algorithm is known that solves an unstructured search problem in a number of iterations of order $\sqrt{d}$, where $d$ is the dimension of the search space, whereas any classical algorithm necessarily scales as $O(d)$. It is shown here that an improved quantum search algorithm can be devised that exploits the structure of a tree search problem by nesting this standard search algorithm. The number of iterations required to find the solution of an average instance of a constraint satisfaction problem scales as $\sqrt{d^\alpha}$, with a constant $\alpha<1$ depending on the nesting depth and the problem considered. When applying a single nesting level to a problem with constraints of size 2 such as the graph coloring problem, this constant $\alpha$ is estimated to be around 0.62 for average instances of maximum difficulty. This corresponds to a square-root speedup over a classical nested search algorithm, of which our presented algorithm is the quantum counterpart.Comment: 18 pages RevTeX, 3 Postscript figure

Thermo-magnetic history effects in the vortex state of YNi_2B_2C superconductor

The nature of five-quadrant magnetic isotherms for is different from that for in a single crystal of YNi2B2C, pointing towards an anisotropic behaviour of the flux line lattice (FLL). For, a well defined peak effect (PE) and second magnetization peak (SMP) can be observed and the loop is open prior to the PE. However, for, the loop is closed and one can observe only the PE. We have investigated the history dependence of magnetization hysteresis data for by recording minor hysteresis loops. The observed history dependence in across different anomalous regions are rationalized on the basis of su-perheating/supercooling of the vortex matter across the first-order-like phase transition and possible additional effects due to annealing of the disordered vortex bundles to the underlying equilibrium state.Comment: 4 pages, 4 figure