Anisotropic correlated electron model associated with the Temperley-Lieb algebra

We present an anisotropic correlated electron model on a periodic lattice, constructed from an R-matrix associated with the Temperley-Lieb algebra. By modification of the coupling of the first and last sites we obtain a model with quantum algebra invariance.

Thermal analysis, nuclear magnetic resonance spectroscopy, and impedance spectroscopy of N,N-dimethyl-pyrrolidinium iodide: An ionic solid exhibiting rotator phases

N,N-dimethyl-pyrrolidinium iodide has been investigated using differential scanning calorimetry, nuclear magnetic resonance (NMR) spectroscopy, second moment calculations, and impedance spectroscopy. This pyrrolidinium salt exhibits two solid-solid phase transitions, one at 373 K having an entropy change, Delta S, of 38 J mol(-1) K-1 and one at 478 K having Delta S of 5.7 J mol(-1) K-1. The second moment calculations relate the lower temperature transition to a homogenization of the sample in terms of the mobility of the cations, while the high temperature phase transition is within the temperature region of isotropic tumbling of the cations. At higher temperatures a further decrease in the H-1 NMR linewidth is observed which is suggested to be due to diffusion of the cations. (C) 2005 American Institute of Physics.

Read-only-memory-based quantum computation: Experimental explorations using nuclear magnetic resonance and future prospects

Read-only-memory-based (ROM-based) quantum computation (QC) is an alternative to oracle-based QC. It has the advantages of being less magical, and being more suited to implementing space-efficient computation (i.e., computation using the minimum number of writable qubits). Here we consider a number of small (one- and two-qubit) quantum algorithms illustrating different aspects of ROM-based QC. They are: (a) a one-qubit algorithm to solve the Deutsch problem; (b) a one-qubit binary multiplication algorithm; (c) a two-qubit controlled binary multiplication algorithm; and (d) a two-qubit ROM-based version of the Deutsch-Jozsa algorithm. For each algorithm we present experimental verification using nuclear magnetic resonance ensemble QC. The average fidelities for the implementation were in the ranges 0.9-0.97 for the one-qubit algorithms, and 0.84-0.94 for the two-qubit algorithms. We conclude with a discussion of future prospects for ROM-based quantum computation. We propose a four-qubit algorithm, using Grover's iterate, for solving a miniature real-world problem relating to the lengths of paths in a network.