ENTANGLEMENT IN A 3-SPIN HEISENBERG-XY CHAIN WITH NEAREST-NEIGHBOR INTERACTIONS, SIMULATED IN AN NMR QUANTUM SIMULATOR

The evolution of entanglement in a 3-spin chain with nearest-neighbor Heisenberg-XY interactions for different initial states is investigated here. In an NMR experimental implementation, we generate multipartite entangled states starting from initial separable pseudo-pure states by simulating nearest-neighbor XY interactions in a 3-spin linear chain of nuclear spin qubits. For simulating XY interactions, we follow algebraic method of Zhang et al. Phys. Rev. A 72 (2005) 012331]. Bell state between end qubits has been generated by using only the unitary evolution of the XY Hamiltonian. For generating W-state and GHZ-state a single qubit rotation is applied on second and all the three qubits, respectively after the unitary evolution of the XY Hamiltonian.

Evolution of quantum discord and its stability in two-qubit NMR systems

We investigate evolution of quantum correlations in ensembles of two-qubit nuclear spin systems via nuclear magnetic resonance techniques. We use discord as a measure of quantum correlations and the Werner state as an explicit example. We, first, introduce different ways of measuring discord and geometric discord in two-qubit systems and then describe the following experimental studies: (a) We quantitatively measure discord for Werner-like states prepared using an entangling pulse sequence. An initial thermal state with zero discord is gradually and periodically transformed into a mixed state with maximum discord. The experimental and simulated behavior of rise and fall of discord agree fairly well. (b) We examine the efficiency of dynamical decoupling sequences in preserving quantum correlations. In our experimental setup, the dynamical decoupling sequences preserved the traceless parts of the density matrices at high fidelity. But they could not maintain the purity of the quantum states and so were unable to keep the discord from decaying. (c) We observe the evolution of discord for a singlet-triplet mixed state during a radio-frequency spin-lock. A simple relaxation model describes the evolution of discord, and the accompanying evolution of fidelity of the long-lived singlet state, reasonably well.

Pulsed radio emission from the Fermi-LAT pulsar J1732-3131: Search and a possible detection at 34.5 MHz

We report our search for and a possible detection of periodic radio pulses at 34.5 MHz from the Fermi Large Area Telescope pulsar J1732-3131. The candidate detection has been possible in only one of the many sessions of observations made with the low-frequency array at Gauribidanur, India, when the otherwise radio weak pulsar may have apparently brightened many folds. The candidate dispersion measure along the sight line, based on the broad periodic profiles from �20min of data, is estimated to be 15.44 ± 0.32 pccc -1. We present the details of our periodic and single-pulse search, and discuss the results and their implications relevant to both, the pulsar and the intervening medium. © 2012 RAS.

Singlet-state creation and universal quantum computation in NMR using a genetic algorithm

The experimental implementation of a quantum algorithm requires the decomposition of unitary operators. Here we treat unitary-operator decomposition as an optimization problem, and use a genetic algorithm-a global-optimization method inspired by nature's evolutionary process-for operator decomposition. We apply this method to NMR quantum information processing, and find a probabilistic way of performing universal quantum computation using global hard pulses. We also demonstrate the efficient creation of the singlet state (a special type of Bell state) directly from thermal equilibrium, using an optimum sequence of pulses. © 2012 American Physical Society.

Singlet-state creation and universal quantum computation in NMR using a genetic algorithm

The experimental implementation of a quantum algorithm requires the decomposition of unitary operators. Here we treat unitary-operator decomposition as an optimization problem, and use a genetic algorithm-a global-optimization method inspired by nature's evolutionary process-for operator decomposition. We apply this method to NMR quantum information processing, and find a probabilistic way of performing universal quantum computation using global hard pulses. We also demonstrate the efficient creation of the singlet state (a special type of Bell state) directly from thermal equilibrium, using an optimum sequence of pulses.

Quantum corrections to screening at strong coupling

We compute a certain class of corrections to (specific) screening lengths in strongly coupled non-abelian plasmas using the AdS/CFT correspondence. In this holographic framework, these corrections arise from various higher curvature interactions modifying the leading Einstein gravity action. The changes in the screening lengths are perturbative in inverse powers of the `t Hooft coupling or of the number of colors, as can be made precise in the context where the dual gauge theory is superconformal. We also compare the results of these holographic calculations to lattice results for the analogous screening lengths in QCD. In particular, we apply these results within the program of making quantitative comparisons between the strongly coupled quark-gluon plasma and holographic descriptions of conformal field theory. (c) 2012 Elsevier B.V. All rights reserved.

Quantum heat engines: A thermodynamic analysis of power and efficiency

We show that the operation and the output power of a quantum heat engine that converts incoherent thermal energy into coherent cavity photons can be optimized by manipulating quantum coherences. The gain or loss in the efficiency at maximum power depends on the details of the output power optimization. Quantum effects tend to enhance the output power and the efficiency as the photon occupation in the cavity is decreased.

Growth and photovoltaic performance of SnS quantum dots

Tin sulphide (SnS) quantum dots of size ranging from 2.4 to 14.4 nm are prepared by chemical precipitation method in aqueous media. Growth of the SnS particles is monitored by controlling the deposition time. Both XRD and SAED patterns confirm that the particles possess orthorhombic structure. The uncapped SnS particles showed secondary phases like Sn2S3 and SnS2 which is visible in the SAED pattern. From the electrochemical characterization. HOMO-LUMO levels of both TiO2 and SnS are determined and the band alignment is found to be favorable for electron transfer from SnS to TiO2. Moreover, the HOMO-LUMO levels varied for different particle sizes. Solar cell is fabricated by sensitizing porous TiO2 thin film with SnS QDs. Cell structure is characterized with and without buffer layer between FTO and TiO2. Without the buffer layer, cell showed an open circuit voltage (V-oc) of 504 mV and short circuit current density (J(sc)) of 2.3 mA/cm(2) under AM1.5 condition. The low fill factor of this structure (15%) is seen to be increased drastically to 51%, on the incorporation of the buffer layer. The cell characteristics are analyzed using two different size quantum dots. (C) 2012 Elsevier B.V. All rights reserved.

Heat fluctuations and coherences in a quantum heat engine

Quantum coherence can affect the thermodynamics of small quantum systems. Coherences have been shown to affect the power generated by a quantum heat engine (QHE) which is coupled to two thermal photon reservoirs and to an additional cavity mode. We show that the fluctuations of the heat exchanged between the QHE and the reservoirs strongly depend on quantum coherence, especially when the engine operates as a refrigerator, i.e., heat current flows from the cold bath to the hot bath. Intriguingly, we find that the ratio of positive and negative (with respect to the thermodynamic force) fluctuations in the heat current satisfies a universal coherence-independent fluctuation theorem.

As(3)p: A Fast Algorithm to Search Structurally Similar Protiens

Protein structure comparison is essential for understanding various aspects of protein structure, function and evolution. It can be used to explore the structural diversity and evolutionary patterns of protein families. In view of the above, a new algorithm is proposed which performs faster protein structure comparison using the peptide backbone torsional angles. It is fast, robust, computationally less expensive and efficient in finding structural similarities between two different protein structures and is also capable of identifying structural repeats within the same protein molecule.

Turning visual search time on its head

Our everyday visual experience frequently involves searching for objects in clutter. Why are some searches easy and others hard? It is generally believed that the time taken to find a target increases as it becomes similar to its surrounding distractors. Here, I show that while this is qualitatively true, the exact relationship is in fact not linear. In a simple search experiment, when subjects searched for a bar differing in orientation from its distractors, search time was inversely proportional to the angular difference in orientation. Thus, rather than taking search reaction time (RT) to be a measure of target-distractor similarity, we can literally turn search time on its head (i.e. take its reciprocal 1/RT) to obtain a measure of search dissimilarity that varies linearly over a large range of target-distractor differences. I show that this dissimilarity measure has the properties of a distance metric, and report two interesting insights come from this measure: First, for a large number of searches, search asymmetries are relatively rare and when they do occur, differ by a fixed distance. Second, search distances can be used to elucidate object representations that underlie search - for example, these representations are roughly invariant to three-dimensional view. Finally, search distance has a straightforward interpretation in the context of accumulator models of search, where it is proportional to the discriminative signal that is integrated to produce a response. This is consistent with recent studies that have linked this distance to neuronal discriminability in visual cortex. Thus, while search time remains the more direct measure of visual search, its reciprocal also has the potential for interesting and novel insights. (C) 2012 Elsevier Ltd. All rights reserved.

Cobalt(II), Nickel(II) and Copper(II) complexes of a tetradentate Schiff base as photosensitizers: Quantum yield of O-1(2) generation and its promising role in anti-tumor activity

In the present investigation, a Schiff base N'(1),N'(3)-bis(E)-(5-bromo-2-hydroxyphenyl)methylidene]benzene-1,3-d icarbohydrazide and its metal complexes have been synthesized and characterized. The DNA-binding studies were performed using absorption spectroscopy, emission spectra, viscosity measurements and thermal denatuaration studies. The experimental evidence indicated that, the Co(II), Ni(II) and Cu(II) complexes interact with calf thymus DNA through intercalation with an intrinsic binding constant K-b of 2.6 x 10(4) M-1, 5.7 x 10(4) M-1 and 4.5 x 10(4) M-1, respectively and they exhibited potent photo-damage abilities on pUC19 DNA, through singlet oxygen generation with quantum yields of 0.32, 0.27 and 0.30 respectively. The cytotoxic activity of the complexes resulted that they act as a potent photosensitizers for photochemical reactions. (C) 2012 Elsevier B.V. All rights reserved.

Active Sequential Hypothesis Testing with Application to a Visual Search Problem

We consider a visual search problem studied by Sripati and Olson where the objective is to identify an oddball image embedded among multiple distractor images as quickly as possible. We model this visual search task as an active sequential hypothesis testing problem (ASHT problem). Chernoff in 1959 proposed a policy in which the expected delay to decision is asymptotically optimal. The asymptotics is under vanishing error probabilities. We first prove a stronger property on the moments of the delay until a decision, under the same asymptotics. Applying the result to the visual search problem, we then propose a ``neuronal metric'' on the measured neuronal responses that captures the discriminability between images. From empirical study we obtain a remarkable correlation (r = 0.90) between the proposed neuronal metric and speed of discrimination between the images. Although this correlation is lower than with the L-1 metric used by Sripati and Olson, this metric has the advantage of being firmly grounded in formal decision theory.

Truthful multi-armed bandit mechanisms for multi-slot sponsored search auctions

In pay-per-click sponsored search auctions which are currently extensively used by search engines, the auction for a keyword involves a certain number of advertisers (say k) competing for available slots (say m) to display their advertisements (ads for short). A sponsored search auction for a keyword is typically conducted for a number of rounds (say T). There are click probabilities mu(ij) associated with each agent slot pair (agent i and slot j). The search engine would like to maximize the social welfare of the advertisers, that is, the sum of values of the advertisers for the keyword. However, the search engine does not know the true values advertisers have for a click to their respective advertisements and also does not know the click probabilities. A key problem for the search engine therefore is to learn these click probabilities during the initial rounds of the auction and also to ensure that the auction mechanism is truthful. Mechanisms for addressing such learning and incentives issues have recently been introduced. These mechanisms, due to their connection to the multi-armed bandit problem, are aptly referred to as multi-armed bandit (MAB) mechanisms. When m = 1, exact characterizations for truthful MAB mechanisms are available in the literature. Recent work has focused on the more realistic but non-trivial general case when m > 1 and a few promising results have started appearing. In this article, we consider this general case when m > 1 and prove several interesting results. Our contributions include: (1) When, mu(ij)s are unconstrained, we prove that any truthful mechanism must satisfy strong pointwise monotonicity and show that the regret will be Theta T7) for such mechanisms. (2) When the clicks on the ads follow a certain click precedence property, we show that weak pointwise monotonicity is necessary for MAB mechanisms to be truthful. (3) If the search engine has a certain coarse pre-estimate of mu(ij) values and wishes to update them during the course of the T rounds, we show that weak pointwise monotonicity and type-I separatedness are necessary while weak pointwise monotonicity and type-II separatedness are sufficient conditions for the MAB mechanisms to be truthful. (4) If the click probabilities are separable into agent-specific and slot-specific terms, we provide a characterization of MAB mechanisms that are truthful in expectation.

Similarity relations in visual search predict rapid visual categorization

How do we perform rapid visual categorization?It is widely thought that categorization involves evaluating the similarity of an object to other category items, but the underlying features and similarity relations remain unknown. Here, we hypothesized that categorization performance is based on perceived similarity relations between items within and outside the category. To this end, we measured the categorization performance of human subjects on three diverse visual categories (animals, vehicles, and tools) and across three hierarchical levels (superordinate, basic, and subordinate levels among animals). For the same subjects, we measured their perceived pair-wise similarities between objects using a visual search task. Regardless of category and hierarchical level, we found that the time taken to categorize an object could be predicted using its similarity to members within and outside its category. We were able to account for several classic categorization phenomena, such as (a) the longer times required to reject category membership; (b) the longer times to categorize atypical objects; and (c) differences in performance across tasks and across hierarchical levels. These categorization times were also accounted for by a model that extracts coarse structure from an image. The striking agreement observed between categorization and visual search suggests that these two disparate tasks depend on a shared coarse object representation.