Complete quantum teleportation using nuclear magnetic resonance

Quantum mechanics provides spectacular new information processing abilities (Bennett 1995, Preskill 1998). One of the most unexpected is a procedure called quantum teleportation (Bennett et al 1993) that allows the quantum state of a system to be transported from one location to another, without moving through the intervening space. Partial implementations of teleportation (Bouwmeester et al 1997, Boschi et al 1998) over macroscopic distances have been achieved using optical systems, but omit the final stage of the teleportation procedure. Here we report an experimental implementation of the full quantum teleportation operation over inter-atomic distances using liquid state nuclear magnetic resonance (NMR). The inclusion of the final stage enables for the first time a teleportation implementation which may be used as a subroutine in larger quantum computations, or for quantum communication. Our experiment also demonstrates the use of quantum process tomography, a procedure to completely characterize the dynamics of a quantum system. Finally, we demonstrate a controlled exploitation of decoherence as a tool to assist in the performance of an experiment.Comment: 15 pages, 2 figures. Minor differences between this and the published versio

The Influence of Superpositional Wave Function Oscillations on Shor's Quantum Algorithm

We investigate the influence of superpositional wave function oscillations on the performance of Shor's quantum algorithm for factorization of integers. It is shown that the wave function oscillations can destroy the required quantum interference. This undesirable effect can be routinely eliminated using a resonant pulse implementation of quantum computation, but requires special analysis for non-resonant implementations.Comment: 4 pages, NO figures, revte

The Crustal Rigidity of a Neutron Star, and Implications for PSR 1828-11 and other Precession Candidates

We calculate the crustal rigidity parameter, b, of a neutron star (NS), and show that b is a factor 40 smaller than the standard estimate due to Baym & Pines (1971). For a NS with a relaxed crust, the NS's free-precession frequency is directly proportional to b. We apply our result for b to PSR 1828-11, a 2.5 Hz pulsar that appears to be precessing with period 511 d. Assuming this 511-d period is set by crustal rigidity, we show that this NS's crust is not relaxed, and that its reference spin (roughly, the spin for which the crust is most relaxed) is 40 Hz, and that the average spindown strain in the crust is 5 \times 10^{-5}. We also briefly describe the implications of our b calculation for other well-known precession candidates.Comment: 44 pages, 10 figures, submitted to Ap

Classical wave-optics analogy of quantum information processing

An analogous model system for quantum information processing is discussed, based on classical wave optics. The model system is applied to three examples that involve three qubits: ({\em i}) three-particle Greenberger-Horne-Zeilinger entanglement, ({\em ii}) quantum teleportation, and ({\em iii}) a simple quantum error correction network. It is found that the model system can successfully simulate most features of entanglement, but fails to simulate quantum nonlocality. Investigations of how far the classical simulation can be pushed show that {\em quantum nonlocality} is the essential ingredient of a quantum computer, even more so than entanglement. The well known problem of exponential resources required for a classical simulation of a quantum computer, is also linked to the nonlocal nature of entanglement, rather than to the nonfactorizability of the state vector.Comment: 9 pages, 6 figure

On the nature of the omega tri-layer periodicity in rapidly cooled Ti-15Mo

High angle annular dark field (HAADF) images of the omega phase in metastable beta titanium alloys exhibit tri-layered periodicity. However, it is unclear if this indicates preferential site occupation, or is related to the structural modification of omega formation. Here, the periodicity was studied using a combination of HAADF imaging and electron energy loss spectroscopy. The results show that there is no preferential site occupancy or ordering and that the observed intensity variations are related to the imaging conditions.This work was supported by the Rolls-Royce/EPSRC Strategic Partnership (EP/H022309/1, EP/H500375/1 & EP/M005607/1).This is the final version. It was first published by Elsevier at http://www.sciencedirect.com/science/article/pii/S1359646215002213

Approximate Quantum Cloning with Nuclear Magnetic Resonance

Here we describe a Nuclear Magnetic Resonance (NMR) experiment that uses a three qubit NMR device to implement the one to two approximate quantum cloning network of Buzek et al.Comment: 4 pages RevTeX4 including 5 postscript figures. Submitted to PR

ROM-based quantum computation: Experimental explorations using Nuclear Magnetic Resonance, and future prospects

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 NMR 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.Comment: 11 pages, 5 figure

Reducing the communication complexity with quantum entanglement

We propose a probabilistic two-party communication complexity scenario with a prior nonmaximally entangled state, which results in less communication than that is required with only classical random correlations. A simple all-optical implementation of this protocol is presented and demonstrates our conclusion.Comment: 4 Pages, 2 Figure