Faithful remote state preparation using finite classical bits and a non-maximally entangled state

We present many ensembles of states that can be remotely prepared by using minimum classical bits from Alice to Bob and their previously shared entangled state and prove that we have found all the ensembles in two-dimensional case. Furthermore we show that any pure quantum state can be remotely and faithfully prepared by using finite classical bits from Alice to Bob and their previously shared nonmaximally entangled state though no faithful quantum teleportation protocols can be achieved by using a nonmaximally entangled state.Comment: 6 page

Universal simulation of Hamiltonian dynamics for qudits

What interactions are sufficient to simulate arbitrary quantum dynamics in a composite quantum system? Dodd et al. (quant-ph/0106064) provided a partial solution to this problem in the form of an efficient algorithm to simulate any desired two-body Hamiltonian evolution using any fixed two-body entangling N-qubit Hamiltonian, and local unitaries. We extend this result to the case where the component systems have D dimensions. As a consequence we explain how universal quantum computation can be performed with any fixed two-body entangling N-qudit Hamiltonian, and local unitaries.Comment: 13 pages, an error in the "Pauli-Euclid-Gottesman Lemma" fixed, main results unchange

On the practicality of time-optimal two-qubit Hamiltonian simulation

What is the time-optimal way of using a set of control Hamiltonians to obtain a desired interaction? Vidal, Hammerer and Cirac [Phys. Rev. Lett. 88 (2002) 237902] have obtained a set of powerful results characterizing the time-optimal simulation of a two-qubit quantum gate using a fixed interaction Hamiltonian and fast local control over the individual qubits. How practically useful are these results? We prove that there are two-qubit Hamiltonians such that time-optimal simulation requires infinitely many steps of evolution, each infinitesimally small, and thus is physically impractical. A procedure is given to determine which two-qubit Hamiltonians have this property, and we show that almost all Hamiltonians do. Finally, we determine some bounds on the penalty that must be paid in the simulation time if the number of steps is fixed at a finite number, and show that the cost in simulation time is not too great.Comment: 9 pages, 2 figure

Universal quantum computation and simulation using any entangling Hamiltonian and local unitaries

What interactions are sufficient to simulate arbitrary quantum dynamics in a composite quantum system? We provide an efficient algorithm to simulate any desired two-body Hamiltonian evolution using any fixed two-body entangling n-qubit Hamiltonian and local unitaries. It follows that universal quantum computation can be performed using any entangling interaction and local unitary operations.Comment: Added references to NMR refocusing and to earlier work by Leung et al and Jones and Knil

NMR quantum computation with indirectly coupled gates

An NMR realization of a two-qubit quantum gate which processes quantum information indirectly via couplings to a spectator qubit is presented in the context of the Deutsch-Jozsa algorithm. This enables a successful comprehensive NMR implementation of the Deutsch-Jozsa algorithm for functions with three argument bits and demonstrates a technique essential for multi-qubit quantum computation.Comment: 9 pages, 2 figures. 10 additional figures illustrating output spectr

A scalable quantum computer with an ultranarrow optical transition of ultracold neutral atoms in an optical lattice

We propose a new quantum-computing scheme using ultracold neutral ytterbium atoms in an optical lattice. The nuclear Zeeman sublevels define a qubit. This choice avoids the natural phase evolution due to the magnetic dipole interaction between qubits. The Zeeman sublevels with large magnetic moments in the long-lived metastable state are also exploited to address individual atoms and to construct a controlled-multiqubit gate. Estimated parameters required for this scheme show that this proposal is scalable and experimentally feasible.Comment: 6 pages, 6 figure

On Quantum Control via Encoded Dynamical Decoupling

I revisit the ideas underlying dynamical decoupling methods within the framework of quantum information processing, and examine their potential for direct implementations in terms of encoded rather than physical degrees of freedom. The usefulness of encoded decoupling schemes as a tool for engineering both closed- and open-system encoded evolutions is investigated based on simple examples.Comment: 12 pages, no figures; REVTeX style. This note collects various theoretical considerations complementing/motivated by the experimental demonstration of encoded control by Fortunato et a

Global QCD Analysis and the CTEQ Parton Distributions

The CTEQ program for the determination of parton distributions through a global QCD analysis of data for various hard scattering processes is fully described. A new set of distributions, CTEQ3, incorporating several new types of data is reported and compared to the two previous sets of CTEQ distributions. Comparison with current data is discussed in some detail. The remaining uncertainties in the parton distributions and methods to further reduce them are assessed. Comparisons with the results of other global analyses are also presented.Comment: (Change in Latex style only: 2up style removed since many don't have it.) 35 pages, 23 figures separately submitted as uuencoded compressed ps-file; Michigan State Report # MSU-HEP/41024 and CTEQ 40