Wigner Functions for Arbitrary Quantum Systems

The possibility of constructing a complete, continuous Wigner function for any quantum system has been a subject of investigation for over 50 years. A key system that has served to illustrate the difficulties of this problem has been an ensemble of spins. Here we present a general and consistent framework for constructing Wigner functions exploiting the underlying symmetries in the physical system at hand. The Wigner function can be used to fully describe any quantum system of arbitrary dimension or ensemble size.Comment: 5 pages, 3 figure

Radiative corrections and quantum gates in molecular systems

We propose a method for quantum information processing using molecules coupled to an external laser field. This utilizes molecular interactions, control of the external field and an effective energy shift of the doubly-excited state of two coupled molecules. Such a level shift has been seen in the two-photon resonance experiments recently reported in Ref. [1]. Here we show that this can be explained in terms of the QED Lamb shift. We quantify the performance of the proposed quantum logic gates in the presence of dissipative mechanisms. The unitary transformations required for performing one- and two-qubit operations can be implemented with present day technology.Comment: 4 pages, 3 figures, Updated to correct important missing referenc

Non-Markovian dynamics of a qubit

In this paper we investigate the non-Markovian dynamics of a qubit by comparing two generalized master equations with memory. In the case of a thermal bath, we derive the solution of the post-Markovian master equation recently proposed in Ref. [A. Shabani and D.A. Lidar, Phys. Rev. A {\bf 71}, 020101(R) (2005)] and we study the dynamics for an exponentially decaying memory kernel. We compare the solution of the post-Markovian master equation with the solution of the typical memory kernel master equation. Our results lead to a new physical interpretation of the reservoir correlation function and bring to light the limits of usability of master equations with memory for the system under consideration.Comment: Replaced with published version (minor changes

Dynamic Trees with Almost-Optimal Access Cost

An optimal binary search tree for an access sequence on elements is a static tree that minimizes the total search cost. Constructing perfectly optimal binary search trees is expensive so the most efficient algorithms construct almost optimal search trees. There exists a long literature of constructing almost optimal search trees dynamically, i.e., when the access pattern is not known in advance. All of these trees, e.g., splay trees and treaps, provide a multiplicative approximation to the optimal search cost. In this paper we show how to maintain an almost optimal weighted binary search tree under access operations and insertions of new elements where the approximation is an additive constant. More technically, we maintain a tree in which the depth of the leaf holding an element e_i does not exceed min(log(W/w_i),log n)+O(1) where w_i is the number of times e_i was accessed and W is the total length of the access sequence. Our techniques can also be used to encode a sequence of m symbols with a dynamic alphabetic code in O(m) time so that the encoding length is bounded by m(H+O(1)), where H is the entropy of the sequence. This is the first efficient algorithm for adaptive alphabetic coding that runs in constant time per symbol

Ozone profile retrievals from the ESA GOME instrument

The potential of the ESA Global Ozone Monitoring Experiment (GOME) to produce ozone profile information has been examined by carrying out two sample retrievals using simulated GOME data. The first retrieval examines the potential of the GOME instrument to produce stratospheric ozone profiles using the traditional back-scatter ultraviolet technique, while the second examines the possibility of obtaining tropospheric profile information, and improving the quality of the stratospheric profile retrievals, by exploiting the temperature dependence of the ozone Huggins bands

The yeast orthologue of GRASP65 forms a complex with a coiled-coil protein that contributes to ER to Golgi traffic

The mammalian Golgi protein GRASP65 is required in assays that reconstitute cisternal stacking and vesicle tethering. Attached to membranes by an N-terminal myristoyl group, it recruits the coiled-coil protein GM130. The relevance of this system to budding yeasts has been unclear, as they lack an obvious orthologue of GM130, and their only GRASP65 relative (Grh1) lacks a myristoylation site and has even been suggested to act in a mitotic checkpoint. In this study, we show that Grh1 has an N-terminal amphipathic helix that is N-terminally acetylated and mediates association with the cis-Golgi. We find that Grh1 forms a complex with a previously uncharacterized coiled-coil protein, Ydl099w (Bug1). In addition, Grh1 interacts with the Sec23/24 component of the COPII coat. Neither Grh1 nor Bug1 are essential for growth, but biochemical assays and genetic interactions with known mediators of vesicle tethering (Uso1 and Ypt1) suggest that the Grh1–Bug1 complex contributes to a redundant network of interactions that mediates consumption of COPII vesicles and formation of the cis-Golgi

The Isolation of a New S-Methyl Benzothioate Compound from a Marine-Derived Streptomyces sp.

The application of an HPLC bioactivity profiling/microtiter plate technique in conjunction with microprobe NMR instrumentation and access to the AntiMarin database has led to the isolation of a new 1. In this example, 1 was isolated from a cytotoxic fraction of an extract obtained from marine-derived Streptomyces sp. cultured on Starch Casein Agar (SCA) medium. The 1D and 2D 1H NMR and ESIMS data obtained from 20 μg of compound 1 fully defined the structure. The known 2 was also isolated and readily dereplicated using this approach

Scotland Registry for Ankylosing Spondylitis (SIRAS) – Protocol

Funding SIRAS was funded by unrestricted grants from Pfizer and AbbVie. The project was reviewed by both companies, during the award process, for Scientific merit, to ensure that the design did not compromise patient safety, and to assess the global regulatory implications and any impact on regulatory strategy.Publisher PD

Cache-oblivious dynamic dictionaries with update/query tradeoffs

Several existing cache-oblivious dynamic dictionaries achieve O(logB N) (or slightly better O(logB N over M )) memory transfers per operation, where N is the number of items stored, M is the memory size, and B is the block size, which matches the classic B-tree data structure. One recent structure achieves the same query bound and a sometimes-better amortized update bound of O (...) memory transfers. This paper presents a new data structure, the xDict, implementing predecessor queries in O(...)worstcase memory transfers and insertions and deletions in O (...) amortized memory transfers, for any constant " with 0 < epsilon < 1. For example, the xDict achieves subconstant amortized update cost when N = ..., whereas the B-tree’s ... is subconstant only when ... is subconstant only when N = .... The xDict attains the optimal tradeoff between insertions and queries, even in the broader external-memory model, for the range where inserts cost between (...) and O(1= lg3 N) memory transfers.Danish National Research Foundation (MADALGO (Center for Massive Data Algorithmics))National Science Foundation (U.S.) (NSF Grants CCF-0541209)National Science Foundation (U.S.) (NSF Grants CCF-0541209)Computing Innovation Fellow