Quantum Disentangled Liquids

We propose and explore a new finite temperature phase of translationally invariant multi-component liquids which we call a "Quantum Disentangled Liquid" (QDL) phase. We contemplate the possibility that in fluids consisting of two (or more) species of indistinguishable quantum particles with a large mass ratio, the light particles might "localize" on the heavy particles. We give a precise, formal definition of this Quantum Disentangled Liquid phase in terms of the finite energy density many-particle wavefunctions. While the heavy particles are fully thermalized, for a typical fixed configuration of the heavy particles, the entanglement entropy of the light particles satisfies an area law; this implies that the light particles have not thermalized. Thus, in a QDL phase, thermal equilibration is incomplete, and the canonical assumptions of statistical mechanics are not fully operative. We explore the possibility of QDL in water, with the light proton degrees of freedom becoming "localized" on the oxygen ions. We do not presently know whether a local, generic Hamiltonian can have eigenstates of the QDL form, and if it can not, then the non-thermal behavior discussed here will exist as an interesting crossover phenomena at time scales that diverge as the ratio of the mass of the heavy to the light species also diverges.Comment: 14 page

A mean-field game model for homogeneous flocking

Empirically derived continuum models of collective behavior among large populations of dynamic agents are a subject of intense study in several fields, including biology, engineering and finance. We formulate and study a mean-field game model whose behavior mimics an empirically derived non-local homogeneous flocking model for agents with gradient self-propulsion dynamics. The mean-field game framework provides a non-cooperative optimal control description of the behavior of a population of agents in a distributed setting. In this description, each agent's state is driven by optimally controlled dynamics that result in a Nash equilibrium between itself and the population. The optimal control is computed by minimizing a cost that depends only on its own state, and a mean-field term. The agent distribution in phase space evolves under the optimal feedback control policy. We exploit the low-rank perturbative nature of the non-local term in the forward-backward system of equations governing the state and control distributions, and provide a linear stability analysis demonstrating that our model exhibits bifurcations similar to those found in the empirical model. The present work is a step towards developing a set of tools for systematic analysis, and eventually design, of collective behavior of non-cooperative dynamic agents via an inverse modeling approach.Comment: Revised to incorporate reviewers' suggestions. Accepted to Chaos journa

Quantum Mechanics helps in searching for a needle in a haystack

Quantum mechanics can speed up a range of search applications over unsorted data. For example imagine a phone directory containing N names arranged in completely random order. To find someone's phone number with a probability of 50%, any classical algorithm (whether deterministic or probabilistic) will need to access the database a minimum of O(N) times. Quantum mechanical systems can be in a superposition of states and simultaneously examine multiple names. By properly adjusting the phases of various operations, successful computations reinforce each other while others interfere randomly. As a result, the desired phone number can be obtained in only O(sqrt(N)) accesses to the database.Comment: Postscript, 4 pages. This is a modified version of the STOC paper (quant-ph/9605043) and is modified to make it more comprehensible to physicists. It appeared in Phys. Rev. Letters on July 14, 1997. (This paper was originally put out on quant-ph on June 13, 1997, the present version has some minor typographical changes

Quantum search algorithms on a regular lattice

Quantum algorithms for searching one or more marked items on a d-dimensional lattice provide an extension of Grover's search algorithm including a spatial component. We demonstrate that these lattice search algorithms can be viewed in terms of the level dynamics near an avoided crossing of a one-parameter family of quantum random walks. We give approximations for both the level-splitting at the avoided crossing and the effectively two-dimensional subspace of the full Hilbert space spanning the level crossing. This makes it possible to give the leading order behaviour for the search time and the localisation probability in the limit of large lattice size including the leading order coefficients. For d=2 and d=3, these coefficients are calculated explicitly. Closed form expressions are given for higher dimensions

Circular 99

We initiated this study to develop a single small scale boiling tank and test a drying technique on samples of velvet antler

Observation of tunable exchange bias in Sr2_2YbRuO6_6

The double perovskite compound, Sr$_{2}$YbRuO$_{6}$, displays reversal in the orientation of magnetic moments along with negative magnetization due to an underlying magnetic compensation phenomenon. The exchange bias (EB) field below the compensation temperature could be the usual negative or the positive depending on the initial cooling field. This EB attribute has the potential of getting tuned in a preselected manner, as the positive EB field is seen to crossover from positive to negative value above $T_{\mathrm{comp}}$.Comment: 4 Pages, 4 Figure

Topological chaos, braiding and bifurcation of almost-cyclic sets

In certain two-dimensional time-dependent flows, the braiding of periodic orbits provides a way to analyze chaos in the system through application of the Thurston-Nielsen classification theorem (TNCT). We expand upon earlier work that introduced the application of the TNCT to braiding of almost-cyclic sets, which are individual components of almost-invariant sets [Stremler, Ross, Grover, Kumar, Topological chaos and periodic braiding of almost-cyclic sets. Physical Review Letters 106 (2011), 114101]. In this context, almost-cyclic sets are periodic regions in the flow with high local residence time that act as stirrers or `ghost rods' around which the surrounding fluid appears to be stretched and folded. In the present work, we discuss the bifurcation of the almost-cyclic sets as a system parameter is varied, which results in a sequence of topologically distinct braids. We show that, for Stokes' flow in a lid-driven cavity, these various braids give good lower bounds on the topological entropy over the respective parameter regimes in which they exist. We make the case that a topological analysis based on spatiotemporal braiding of almost-cyclic sets can be used for analyzing chaos in fluid flows. Hence we further develop a connection between set-oriented statistical methods and topological methods, which promises to be an important analysis tool in the study of complex systems.Comment: Submitted to Chao