NMR Quantum Computer Research Articles

Experimental simulation of a pairing Hamiltonian on an NMR quantum computer

We have developed a concrete quantum simulation scheme and experimentally simulated a pairing model on an NMR quantum computer. Our results indicate that the experimental simulation can give the spectrum in the vicinity of the gap between the ground and the first excited states, and thus verified proof-of-principle the potential power of a quantum computer on the simulation of complex physical systems.

Decoherence of a Greenberger–Horne–Zeilinger state in a five‐qubit NMR quantum computer

AbstractThis work provides a simple approximate method of creating a Greenberger–Horne–Zeilinger (GHZ) state with high fidelity, using nuclear magnetic resonance (NMR) techniques, and reports on the decoherence process for these GHZ states, which is observed with a pair of encoder and decoder quantum circuits. The prepared GHZ states are verified by measuring the quantum correlations, which are well known as GHZ correlations. The results of the decoherence experiments, show that the GHZ states decay faster than bipartite entangled states such as Bell states by a factor of 1.3, and it appears that two different decoherence processes exist. © 2006 Wiley Periodicals, Inc. Int J Quantum Chem, 2006

Quantum simulation of pairing models on an NMR quantum computer

We give out a scheme of quantum simulation of pairing models on an NMR quantum computer. We show that it can obtain the spectrum of paring model in principle, and present a simple example. Similarly, it is possible to discuss the quantum simulation to obtain more differences of energy levels.

Implementation Schemes for the Factorized Quantum Lattice-Gas Algorithm for the One Dimensional Diffusion Equation using Persistent-Current Qubits

We present two experimental schemes that can be used to implement the Factorized Quantum Lattice-Gas Algorithm for the 1D Diffusion Equation with Persistent-Current (PC) Qubits. One scheme involves biasing the PC Qubit at multiple flux bias points throughout the course of the algorithm. An implementation analogous to that done in Nuclear Magnetic Resonance (NMR) Quantum Computing is also developed. Errors due to a few key approximations utilized are discussed and differences between the PC Qubit and NMR systems are highlighted

Error tolerance in an NMR implementation of Grover’s fixed-point quantum search algorithm

We describe an implementation of Grover's fixed-point quantum search algorithm on a nuclear magnetic resonance quantum computer, searching for either one or two matching items in an unsorted database of four items. In this algorithm the target state (an equally weighted superposition of the matching states) is a fixed point of the recursive search operator, so that the algorithm always moves towards the desired state. The effects of systematic errors in the implementation are briefly explored.

Quantum information processing through nuclear magnetic resonance

We discuss the applications of Nuclear Magnetic Resonance (NMR) to quantum information processing, focusing on the use of quadrupole nuclei for quantum computing. Various examples of experimental implementation of logic gates are given and compared to calculated NMR spectra and their respective density matrices. The technique of Quantum State Tomography for quadrupole nuclei is briefly described, and examples of measured density matrices in a two-qubit I = 3/2 spin system are shown. Experimental results of density matrices representing pseudo-Bell states are given, and an analysis of the entropy of theses states is made. Considering an NMR experiment as a depolarization quantum channel we calculate the entanglement fidelity and discuss the criteria for entanglement in liquid state NMR quantum information. A brief discussion on the perspectives for NMR quantum computing is presented at the end.

Simulation of HeisenbergXYinteractions and realization of a perfect state transfer in spin chains using liquid nuclear magnetic resonance

The three- spin chain with Heisenberg XY- interaction is simulated in a three- qubit nuclear magnetic resonance (NMR) quantum computer. The evolution caused by the XY- interaction is decomposed into a series of single- spin rotations and the $J$- coupling evolutions between the neighboring spins. The perfect state transfer (PST) algorithm proposed by M. Christandl et al [Phys. Rev. Lett, 92, 187902(2004)] is realized in the XY- chain.

Quantum and classical parallelism in parity algorithms for ensemble quantum computers

The determination of the parity of a string of $N$ binary digits is a well-known problem in classical as well as quantum information processing, which can be formulated as an oracle problem. It has been established that quantum algorithms require at least $N∕2$ oracle calls. We present an algorithm that reaches this lower bound and is also optimal in terms of additional gate operations required. We discuss its application to pure and mixed states. Since it can be applied directly to thermal states, it does not suffer from signal loss associated with pseudo-pure-state preparation. For ensemble quantum computers, the number of oracle calls can be further reduced by a factor ${2}^{k}$, with $k∊{1,2,\dots{},{\mathrm{log}}_{2}(N∕2)}$, provided the signal-to-noise ratio is sufficiently high. This additional speed-up is linked to (classical) parallelism of the ensemble quantum computer. Experimental realizations are demonstrated on a liquid-state NMR quantum computer.

Bounds on the entanglement attainable from unitary transformed thermal states in liquid-state nuclear magnetic resonance

The role of mixed state entanglement in liquid-state nuclear magnetic resonance (NMR) quantum computation is not yet well-understood. In particular, despite the success of quantum information processing with NMR, recent work has shown that quantum states used in most of those experiments were not entangled. This is because these states, derived by unitary transforms from the thermal equilibrium state, were too close to the maximally mixed state. We are thus motivated to determine whether a given NMR state is entanglable - that is, does there exist a unitary transform that entangles the state? The boundary between entanglable and nonentanglable thermal states is a function of the spin system size $N$ and its temperature $T$. We provide new bounds on the location of this boundary using analytical and numerical methods; our tightest bound scales as $N \sim T$, giving a lower bound requiring at least $N \sim 22,000$ proton spins to realize an entanglable thermal state at typical laboratory NMR magnetic fields. These bounds are tighter than known bounds on the entanglability of effective pure states.

Practical implementations of twirl operations

Twirl operations, which convert impure singlet states into Werner states, play an important role in many schemes for entanglement purification. In this paper we describe strategies for implementing twirl operations, with an emphasis on methods suitable for ensemble quantum information processors such as nuclear magnetic resonance (NMR) quantum computers. We implement our twirl operation on a general two-spin mixed state using liquid-state NMR techniques, demonstrating that we can obtain the singlet Werner state with high fidelity.

Implementation of a multiple round quantum dense coding using nuclear magnetic resonance

A multiple round quantum dense coding scheme based on the quantum phase estimation algorithm is proposed and implemented in a three qubit nuclear magnetic resonance (NMR) quantum computer. Using anm+1 qubit system, Bod can transmit one of 2m+1 messages to Alice, through manipulating only one qubit and exchanging it between Alice and Bob form rounds. The information capacity is enhanced tom+1 bits as compared tom bits in a classical scheme. The scheme has been demonstrated in NMR system, and the experimental results show a good agreement between theory and experiment.

Implementation of a multiple round quantum dense coding using nuclear magnetic resonance

A multiple round quantum dense coding scheme based on the quantum phase estimation algorithm is proposed and implemented in a three qubit nuclear magnetic resonance (NMR) quantum computer. Using anm+1 qubit system, Bod can transmit one of 2 m+1 messages to Alice, through manipulating only one qubit and exchanging it between Alice and Bob form rounds. The information capacity is enhanced tom+1 bits as compared tom bits in a classical scheme. The scheme has been demonstrated in NMR system, and the experimental results show a good agreement between theory and experiment.

PARAMAGNETIC MATERIALS AND PRACTICAL ALGORITHMIC COOLING FOR NMR QUANTUM COMPUTING

Algorithmic cooling is a method that uses novel data compression techniques and simple quantum computing devices to improve NMR spectroscopy, and to offer scalable NMR quantum computers. The algorithm recursively employs two steps. A reversible entropy compression of computation quantum-bits (qubits) of the system and an irreversible heat transfer from the system to the environment through a set of reset qubits that reach thermal relaxation rapidly. Is it possible to experimentally demonstrate algorithmic cooling using existing technology? To allow experimental algorithmic cooling, the thermalization time of the reset qubits must be much shorter than the thermalization time of the computation qubits. However, such high thermalization-times ratios have yet to be reported. We investigate here the effect of a paramagnetic salt on the thermalization-times ratio of computation qubits (carbons) and a reset qubit (hydrogen). We show that the thermalization-times ratio is improved by approximately three-fold. Based on this result, an experimental demonstration of algorithmic cooling by thermalization and magnetic ions has been performed by the authors and collaborators.

Numerical analysis of boosting scheme for scalable NMR quantum computation

Among initialization schemes for ensemble quantum computation beginning at thermal equilibrium, the scheme proposed by Schulman and Vazirani [in Proceedings of the 31st ACM Symposium on Theory of Computing (STOC'99) (ACM Press, New York, 1999), pp. 322--329] is known for the simple quantum circuit to redistribute the biases (polarizations) of qubits and small time complexity. However, our numerical simulation shows that the number of qubits initialized by the scheme is rather smaller than expected from the von Neumann entropy because of an increase in the sum of the binary entropies of individual qubits, which indicates a growth in the total classical correlation. This result---namely, that there is such a significant growth in the total binary entropy---disagrees with that of their analysis.

NMR techniques for quantum control and computation

Fifty years of developments in nuclear magnetic resonance (NMR) have resulted in an unrivaled degree of control of the dynamics of coupled two-level quantum systems. This coherent control of nuclear spin dynamics has recently been taken to a new level, motivated by the interest in quantum information processing. NMR has been the workhorse for the experimental implementation of quantum protocols, allowing exquisite control of systems up to seven qubits in size. Here, we survey and summarize a broad variety of pulse control and tomographic techniques which have been developed for and used in NMR quantum computation. Many of these will be useful in other quantum systems now being considered for implementation of quantum information processing tasks.

Quantum phase transition of ground-state entanglement in a Heisenberg spin chain simulated in an NMR quantum computer

Using an NMR quantum computer, we experimentally simulate the quantum phase transition of a Heisenberg spin chain. The Hamiltonian is generated by a multiple pulse sequence, the nuclear spin system is prepared in its (pseudo-pure) ground state and the effective Hamiltonian varied in such a way that the Heisenberg chain is taken from a product state to an entangled state and finally to a different product state.

Experimental investigation of decoherence in maximally entangled mixed states

AbstractDecoherence of the bipartite entangled mixed state in a five‐qubit system has been studied experimentally with liquid‐state nuclear magnetic resonance (NMR). The experimental results indicate that when only two qubits of the five qubits are partially initialized, the decoherence process of the bipartite entangled mixed state is not quantized, as the entanglability is weak. In contrast, when all five qubits are initialized, the decoherence process is quantized, which is understood to indicate that the entanglability is actually strong. From these results, it is conceivable that the entropy of the deviation density matrix is a crucial factor in measuring the entanglement in the liquid‐state NMR quantum computer. © 2005 Wiley Periodicals, Inc. Int J Quantum Chem, 2005

Dense coding scheme using superpositions of Bell-states and its NMR implementation

Dense coding using superpositions of Bell-states is proposed. The generalized Grover's algorithm is used to prepare the initial entangled states, and the reverse process of the quantum algorithm is used to determine the entangled state in the decoding measurement. Compared with the previous schemes, the superpositions of two Bell-states are exploited. Our scheme is demonstrated using a nuclear magnetic resonance (NMR) quantum computer. The corresponding manipulations are obtained. Experimental results show a good agreement between theory and experiment. We also generalize the scheme to transmit eight messages by introducing an additional two-state system.

Generation and interrogation of a pure nuclear spin state by parahydrogen‐enhanced NMR spectroscopy: a defined initial state for quantum computation

We describe a number of studies used to establish that parahydrogen can be used to prepare a two-spin system in a pure state, which is suitable for implementing NMR quantum computation. States are generated by pulsed and continuous-wave (CW) UV laser initiation of a chemical reaction between Ru(CO)(3)(L(2)) [where L(2) = dppe = 1,2-bis(diphenylphosphino)ethane or L(2) = dpae = 1,2-bis(diphenylarsino)ethane] with pure parahydrogen (generated at 18 K). This process forms Ru(CO)(2)(dppe)(H)(2) and Ru(CO)(2)(dpae)(H)(2) on a sub-microsecond time-scale. With the pulsed laser, the spin state of the hydride nuclei in Ru(CO)(2)(dppe)(H)(2) has a purity of 89.8 +/- 2.6% (from 12 measurements). To achieve comparable results by cooling would require a temperature of 6.6 mK, which is unmanageable in the liquid state, or an impractical magnetic field of 0.44 MT at room temperature. In the case of CW initiation, reduced state purities are observed due to natural signal relaxation even when a spin-lock is used to prevent dephasing. When Ru(CO)(3)(dpae) and pulsed laser excitation are utilized, the corresponding dihydride product spin state purity was determined as 106 +/- 4% of the theoretical maximum. In other words, the state prepared using Ru(CO)(3)(dpae) as the precursor is indistinguishable from a pure state.

ALGORITHMIC COOLING OF SPINS: A PRACTICABLE METHOD FOR INCREASING POLARIZATION

An efficient technique to generate ensembles of spins that are highly polarized by external magnetic fields is the Holy Grail in Nuclear Magnetic Resonance (NMR) spectroscopy. Since spin-half nuclei have steady-state polarization biases that increase inversely with temperature, spins exhibiting high polarization biases are considered cool, even when their environment is warm. Existing spin-cooling techniques are highly limited in their efficiency and usefulness. Algorithmic cooling is a promising new spin-cooling approach that employs data compression methods in open systems. It reduces the entropy of spins on long molecules to a point far beyond Shannon's bound on reversible entropy manipulations, thus increasing their polarization. Here we present an efficient and experimentally feasible algorithmic cooling technique that cools spins to very low temperatures even on short molecules. This practicable algorithmic cooling could lead to breakthroughs in high-sensitivity NMR spectroscopy in the near future, and to the development of scalable NMR quantum computers in the far future. Moreover, while the cooling algorithm itself is classical, it uses quantum gates in its implementation, thus representing the first short-term application of quantum computing devices.