Macroevolutionary Patterns In The Evolutionary Radiation Of Archosaurs (Tetrapoda: Diapsida)

The rise of archosaurs during the Triassic and Early Jurassic has been treated as a classic example of an evolutionary radiation in the fossil record. This paper reviews published studies and provides new data on archosaur lineage origination, diversity and lineage evolution, morphological disparity, rates of morphological character change, and faunal abundance during the Triassic–Early Jurassic. The fundamental archosaur lineages originated early in the Triassic, in concert with the highest rates of character change. Disparity and diversity peaked later, during the Norian, but the most significant increase in disparity occurred before maximum diversity. Archosaurs were rare components of Early–Middle Triassic faunas, but were more abundant in the Late Triassic and pre-eminent globally by the Early Jurassic. The archosaur radiation was a drawn-out event and major components such as diversity and abundance were discordant from each other. Crurotarsans (crocodile-line archosaurs) were more disparate, diverse, and abundant than avemetatarsalians (bird-line archosaurs, including dinosaurs) during the Late Triassic, but these roles were reversed in the Early Jurassic. There is no strong evidence that dinosaurs outcompeted or gradually eclipsed crurotarsans during the Late Triassic. Instead, crurotarsan diversity decreased precipitously by the end-Triassic extinction, which helped usher in the age of dinosaurian dominance

Implementation of the Quantum Fourier Transform

The quantum Fourier transform (QFT) has been implemented on a three bit nuclear magnetic resonance (NMR) quantum computer, providing a first step towards the realization of Shor's factoring and other quantum algorithms. Implementation of the QFT is presented with fidelity measures, and state tomography. Experimentally realizing the QFT is a clear demonstration of NMR's ability to control quantum systems.Comment: 6 pages, 2 figure

Gravity gradient preliminary investigations on exhibit ''A'' Final report

Quartz microbalance gravity gradiometer performance test

Implementation of quantum maps by programmable quantum processors

A quantum processor is a device with a data register and a program register. The input to the program register determines the operation, which is a completely positive linear map, that will be performed on the state in the data register. We develop a mathematical description for these devices, and apply it to several different examples of processors. The problem of finding a processor that will be able to implement a given set of mappings is also examined, and it is shown that while it is possible to design a finite processor to realize the phase-damping channel, it is not possible to do so for the amplitude-damping channel.Comment: 10 revtex pages, no figure

Quantum Error Correction on Linear Nearest Neighbor Qubit Arrays

A minimal depth quantum circuit implementing 5-qubit quantum error correction in a manner optimized for a linear nearest neighbor architecture is described. The canonical decomposition is used to construct fast and simple gates that incorporate the necessary swap operations. Simulations of the circuit's performance when subjected to discrete and continuous errors are presented. The relationship between the error rate of a physical qubit and that of a logical qubit is investigated with emphasis on determining the concatenated error correction threshold.Comment: 4 pages, 5 figure

Eigenvector Approximation Leading to Exponential Speedup of Quantum Eigenvalue Calculation

We present an efficient method for preparing the initial state required by the eigenvalue approximation quantum algorithm of Abrams and Lloyd. Our method can be applied when solving continuous Hermitian eigenproblems, e.g., the Schroedinger equation, on a discrete grid. We start with a classically obtained eigenvector for a problem discretized on a coarse grid, and we efficiently construct, quantum mechanically, an approximation of the same eigenvector on a fine grid. We use this approximation as the initial state for the eigenvalue estimation algorithm, and show the relationship between its success probability and the size of the coarse grid.Comment: 4 page

High Angular Resolution Stellar Imaging with Occultations from the Cassini Spacecraft II: Kronocyclic Tomography

We present an advance in the use of Cassini observations of stellar occultations by the rings of Saturn for stellar studies. Stewart et al. (2013) demonstrated the potential use of such observations for measuring stellar angular diameters. Here, we use these same observations, and tomographic imaging reconstruction techniques, to produce two dimensional images of complex stellar systems. We detail the determination of the basic observational reference frame. A technique for recovering model-independent brightness profiles for data from each occulting edge is discussed, along with the tomographic combination of these profiles to build an image of the source star. Finally we demonstrate the technique with recovered images of the {\alpha} Centauri binary system and the circumstellar environment of the evolved late-type giant star, Mira.Comment: 8 pages, 8 figures, Accepted by MNRA