Implementation of a quantum algorithm on a nuclear magnetic resonance quantum computer

Robust quantum information processing with techniques from liquid-state NMR

While nuclear-magnetic-resonance (NMR) techniques are unlikely to lead to a large-scale quantum computer, they are well suited to investigating basic phenomena and developing new techniques. Indeed, it is likely that many existing NMR techniques will find uses in quantum information processing. Here I describe how the composite-rotation (composite-pulse) method can be used to develop quantum logic gates which are robust against systematic errors.

Quantum information processing with trapped Ca(+) ions

Quantum information processing is performed with single trapped Ca(+) ions, stored in a linear Paul trap and laser-cooled to the ground state of their harmonic quantum motion. Composite laser-pulse sequences were used to implement SWAP gate, phase gate and controlled-NOT gate operations. Stark shifts on the quantum-bit transitions were precisely measured and compensated. For a demonstration of quantum information processing, a Deutsch-Jozsa algorithm has been implemented using two quantum bits encoded on a single ion.

Fiber-optics implementation of the Deutsch-Jozsa and Bernstein-Vazirani quantum algorithms with three qubits

We report on a fiber-optics implementation of the Deutsch-Jozsa and Bernstein-Vazirani quantum algorithms for 8-point functions. The measured visibility of the 8-path interferometer is about 97.5%. Potential applications of our setup to quantum communication or cryptographic protocols using several qubits are discussed.

Implementation of the Deutsch-Jozsa algorithm on an ion-trap quantum computer

Determining classically whether a coin is fair (head on one side, tail on the other) or fake (heads or tails on both sides) requires an examination of each side. However, the analogous quantum procedure (the Deutsch-Jozsa algorithm) requires just one examination step. The Deutsch-Jozsa algorithm has been realized experimentally using bulk nuclear magnetic resonance techniques, employing nuclear spins as quantum bits (qubits). In contrast, the ion trap processor utilises motional and electronic quantum states of individual atoms as qubits, and in principle is easier to scale to many qubits. Experimental advances in the latter area include the realization of a two-qubit quantum gate, the entanglement of four ions, quantum state engineering and entanglement-enhanced phase estimation. Here we exploit techniques developed for nuclear magnetic resonance to implement the Deutsch-Jozsa algorithm on an ion-trap quantum processor, using as qubits the electronic and motional states of a single calcium ion. Our ion-based implementation of a full quantum algorithm serves to demonstrate experimental procedures with the quality and precision required for complex computations, confirming the potential of trapped ions for quantum computation.

Quantum computation with vibrationally excited molecules

A new physical implementation for quantum computation is proposed. The vibrational modes of molecules are used to encode qubit systems. Global quantum logic gates are realized using shaped femtosecond laser pulses which are calculated applying optimal control theory. The scaling of the system is favorable; sources for decoherence can be eliminated. A complete set of one- and two-quantum gates is presented for a specific molecule. Detailed analysis regarding experimental realization shows that the structural resolution of today's pulse shapers is easily sufficient for pulse formation.

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. [Phys. Rev. A 56, 3446 (1997)]. As expected the experimental results indicate that the network clones all input states with similar fidelities, but as a result of decoherence and incoherent evolution arising from B(1) inhomogeneity the total fidelity achieved does not exceed the measurement bound.

Preparation of entangled states by adiabatic passage

We propose a novel technique for the creation of entangled pairs of two-state systems based upon adiabatic passage induced by a suitably crafted time-dependent external field.

Nonadiabatic conditional geometric phase shift with NMR

A conditional geometric phase shift gate, which is fault tolerant to certain types of errors due to its geometric nature, was realized recently via nuclear magnetic resonance (NMR) under adiabatic conditions. However, in quantum computation, everything must be completed within the decoherence time. The adiabatic condition makes any fast conditional Berry phase (cyclic adiabatic geometric phase) shift gate impossible. Here we show that by using a newly designed sequence of simple operations with an additional vertical magnetic field, the conditional geometric phase shift gate can be run nonadiabatically. Therefore geometric quantum computation can be done at the same rate as usual quantum computation.

Control of exciton dynamics in nanodots for quantum operations

We present a theory to further a new perspective of proactive control of exciton dynamics in the quantum limit. Circularly polarized optical pulses in a semiconductor nanodot are used to control the dynamics of two interacting excitons of opposite polarizations. Shaping of femtosecond laser pulses keeps the quantum operation within the decoherence time. Computation of the fidelity of the operations and application to the complete solution of a minimal quantum computing algorithm demonstrate in theory the feasibility of quantum control.

Indirect interaction of solid-state qubits via two-dimensional electron gas

We propose a mechanism of long-range coherent coupling between nuclear spin qubits in semiconductor-heterojunction quantum information processing devices. The coupling is via localized donor electrons which interact with the two-dimensional electron gas. An effective interaction Hamiltonian is derived and the coupling strength is evaluated. We also discuss mechanisms of decoherence and consider gate control of the interaction between qubits. The resulting quantum computing scheme retains all the control and measurement aspects of earlier approaches, but allows qubit spacing at distances of the order of 100 nm, attainable with the present-day semiconductor device technologies.

Resonance offset tailored composite pulses

We describe novel composite pulse sequences which act as general rotors and thus are particularly suitable for nuclear magnetic resonance quantum computation. The resonance offset tailoring to enhance nutations approach permits perfect compensation of off-resonance errors at two selected frequencies placed symmetrically around the frequency of the radiofrequency source.

Implementing logic gates and the Deutsch-Jozsa quantum algorithm by two-dimensional NMR using spin- and transition-selective pulses

Quantum logical operations using two-dimensional NMR have recently been described using the scalar coupling evolution technique [J. Chem. Phys. 109, 10603 (1998)]. In the present paper, we describe the implementation of quantum logical operations using two-dimensional NMR, with the help of spin- and transition-selective pulses. A number of logic gates are implemented using two and three qubits with one extra observer spin. Some many-in-one gates (or Portmanteau gates) are also implemented. Toffoli gate (or AND/NAND gate) and OR/NOR gates are implemented on three qubits. The Deutsch-Jozsa quantum algorithm for one and two qubits, using one extra work qubit, has also been implemented using spin- and transition-selective pulses after creating a coherent superposition state in the two-dimensional methodology.

Experimental realization of an order-finding algorithm with an NMR quantum computer

We report the realization of a nuclear magnetic resonance quantum computer which combines the quantum Fourier transform with exponentiated permutations, demonstrating a quantum algorithm for order finding. This algorithm has the same structure as Shor's algorithm and its speed-up over classical algorithms scales exponentially. The implementation uses a particularly well-suited five quantum bit molecule and was made possible by a new state initialization procedure and several quantum control techniques.

Fast quantum search algorithms in protein sequence comparisons: quantum bioinformatics

Quantum search algorithms are considered in the context of protein sequence comparison in bioinformatics. Given a sample protein sequence of length m (i.e., m residues), the problem considered is to find an optimal match in a large database containing N residues. Initially, Grover's quantum search algorithm is applied to a simple illustrative case-namely, where the database forms a complete set of states over the 2(m) basis states of a m qubit register, and thus is known to contain the exact sequence of interest. This example demonstrates explicitly the typical O(square root of [N]) speedup on the classical O(N) requirements. An algorithm is then presented for the (more realistic) case where the database may contain repeat sequences, and may not necessarily contain an exact match to the sample sequence. In terms of minimizing the Hamming distance between the sample sequence and the database subsequences the algorithm finds an optimal alignment, in O(square root of [N]) steps, by employing an extension of Grover's algorithm, due to Boyer et al. for the case when the number of matches is not a priori known.

Quantum information and computation

In information processing, as in physics, our classical world view provides an incomplete approximation to an underlying quantum reality. Quantum effects like interference and entanglement play no direct role in conventional information processing, but they can--in principle now, but probably eventually in practice--be harnessed to break codes, create unbreakable codes, and speed up otherwise intractable computations.

Geometric quantum computation using nuclear magnetic resonance

A significant development in computing has been the discovery that the computational power of quantum computers exceeds that of Turing machines. Central to the experimental realization of quantum information processing is the construction of fault-tolerant quantum logic gates. Their operation requires conditional quantum dynamics, in which one sub-system undergoes a coherent evolution that depends on the quantum state of another sub-system; in particular, the evolving sub-system may acquire a conditional phase shift. Although conventionally dynamic in origin, phase shifts can also be geometric. Conditional geometric (or 'Berry') phases depend only on the geometry of the path executed, and are therefore resilient to certain types of errors; this suggests the possibility of an intrinsically fault-tolerant way of performing quantum gate operations. Nuclear magnetic resonance techniques have already been used to demonstrate both simple quantum information processing and geometric phase shifts. Here we combine these ideas by performing a nuclear magnetic resonance experiment in which a conditional Berry phase is implemented, demonstrating a controlled phase shift gate.

Efficient refocusing of one-spin and two-spin interactions for NMR quantum computation

The use of spin echoes to refocus one-spin interactions (chemical shifts) and two-spin interactions (spin-spin couplings) plays a central role in both conventional NMR experiments and NMR quantum computation. Here we describe schemes for efficient refocusing of such interactions in both fully and partially coupled spin systems.

Quantum logic gates and nuclear magnetic resonance pulse sequences

There has recently been considerable interest in the use of nuclear magnetic resonance (NMR) as a technology for the implementation of small quantum computers. These computers operate by the laws of quantum mechanics, rather than classical mechanics and can be used to implement new quantum algorithms. Here we describe how NMR in principle can be used to implement all the elements required to build quantum computers, and draw comparisons between the pulse sequences involved and those of more conventional NMR experiments.