Spectral implementation of some quantum algorithms by one- and two-dimensional nuclear magnetic resonance

Controlling NMR spin systems for quantum computation

Nuclear magnetic resonance is arguably both the best available quantum technology for implementing simple quantum computing experiments and the worst technology for building large scale quantum computers that has ever been seriously put forward. After a few years of rapid growth, leading to an implementation of Shor's quantum factoring algorithm in a seven-spin system, the field started to reach its natural limits and further progress became challenging. Rather than pursuing more complex algorithms on larger systems, interest has now largely moved into developing techniques for the precise and efficient manipulation of spin states with the aim of developing methods that can be applied in other more scalable technologies and within conventional NMR. However, the user friendliness of NMR implementations means that they remain popular for proof-of-principle demonstrations of simple quantum information protocols.

Computational investigation and experimental considerations for the classical implementation of a full adder on SO2 by optical pump-probe schemes

Following the scheme recently proposed by Remacle and Levine [Phys. Rev. A 73, 033820 (2006)], we investigate the concrete implementation of a classical full adder on two electronic states (X 1A1 and C 1B2) of the SO2 molecule by optical pump-probe laser pulses using intuitive and counterintuitive (stimulated Raman adiabatic passage) excitation schemes. The resources needed for providing the inputs and reading out are discussed, as well as the conditions for achieving robustness in both the intuitive and counterintuitive pump-dump sequences. The fidelity of the scheme is analyzed with respect to experimental noise and two kinds of perturbations: The coupling to the neighboring rovibrational states and a finite rotational temperature that leads to a mixture for the initial state. It is shown that the logic processing of a full addition cycle can be realistically experimentally implemented on a picosecond time scale while the readout takes a few nanoseconds.

Vibrational computing: simulation of a full adder by optimal control

Within the context of vibrational molecular quantum computing, we investigate the implementation of a full addition of two binary digits and a carry that provides the sum and the carry out. Four qubits are necessary and they are encoded into four different normal vibrational modes of a molecule. We choose the bromoacetyl chloride molecule because it possesses four bright infrared active modes. The ground and first excited states of each mode form the one-qubit computational basis set. Two approaches are proposed for the realization of the full addition. In the first one, we optimize a pulse that implements directly the entire addition by a single unitary transformation. In the second one, we decompose the full addition in elementary quantum gates, following a scheme proposed by Vedral et al. [Phys. Rev. A 54, 147 (1996)]. Four elementary quantum gates are necessary, two two-qubit CNOT gates (controlled NOT) and two three-qubit TOFFOLI gates (controlled-controlled NOT). All the logic operations consist in one-qubit flip. The logic implementation is therefore quasiclassical and the readout is based on a population analysis of the vibrational modes that does not take the phases into account. The fields are optimized by the multitarget extension of the optimal control theory involving all the transformations among the 2(4) qubit states. A single cycle of addition without considering the preparation or the measure or copy of the result can be carried out in a very competitive time, on a picosecond time scale.

Optimal control simulation of the Deutsch-Jozsa algorithm in a two-dimensional double well coupled to an environment

The quantum Deutsch-Jozsa algorithm is implemented by using vibrational modes of a two-dimensional double well. The laser fields realizing the different gates (NOT, CNOT, and HADAMARD) on the two-qubit space are computed by the multitarget optimal control theory. The stability of the performance index is checked by coupling the system to an environment. Firstly, the two-dimensional subspace is coupled to a small number Nb of oscillators in order to simulate intramolecular vibrational energy redistribution. The complete (2+Nb)D problem is solved by the coupled harmonic adiabatic channel method which allows including coupled modes up to Nb=5. Secondly, the computational subspace is coupled to a continuous bath of oscillators in order to simulate a confined environment expected to be favorable to achieve molecular computing, for instance, molecules confined in matrices or in a fullerene. The spectral density of the bath is approximated by an Ohmic law with a cutoff for some hundreds of cm(-1). The time scale of the bath dynamics (of the order of 10 fs) is then smaller than the relaxation time and the controlled dynamics (2 ps) so that Markovian dissipative dynamics is used.

Hadamard NMR spectroscopy for two-dimensional quantum information processing and parallel search algorithms

Hadamard spectroscopy has earlier been used to speed-up multi-dimensional NMR experiments. In this work, we speed-up the two-dimensional quantum computing scheme, by using Hadamard spectroscopy in the indirect dimension, resulting in a scheme which is faster and requires the Fourier transformation only in the direct dimension. Two and three qubit quantum gates are implemented with an extra observer qubit. We also use one-dimensional Hadamard spectroscopy for binary information storage by spatial encoding and implementation of a parallel search algorithm.

Use of non-adiabatic geometric phase for quantum computing by NMR

Geometric phases have stimulated researchers for its potential applications in many areas of science. One of them is fault-tolerant quantum computation. A preliminary requisite of quantum computation is the implementation of controlled dynamics of qubits. In controlled dynamics, one qubit undergoes coherent evolution and acquires appropriate phase, depending on the state of other qubits. If the evolution is geometric, then the phase acquired depend only on the geometry of the path executed, and is robust against certain types of error. This phenomenon leads to an inherently fault-tolerant quantum computation. Here we suggest a technique of using non-adiabatic geometric phase for quantum computation, using selective excitation. In a two-qubit system, we selectively evolve a suitable subsystem where the control qubit is in state |1, through a closed circuit. By this evolution, the target qubit gains a phase controlled by the state of the control qubit. Using the non-adiabatic geometric phase we demonstrate implementation of Deutsch-Jozsa algorithm and Grover's search algorithm in a two-qubit system.