Using nuclear magnetic resonance (NMR) techniques with three-qubit sample, we have experimentally implemented the highly structured algorithm for the 1-SAT problem proposed by Hogg. A simplified temporal averaging procedure was employed to the three-qubit spin pseudo-pure state. The algorithm was completed with only a single evaluation of structure of the problem and the solutions were found with probability 100%, which outperform both unstructured quantum and the best classical search algorithm.
We demonstrate a five-bit nuclear-magnetic-resonance quantum computer that distinguishes among various functions on four bits, making use of quantum parallelism. Its construction draws on the recognition of the sufficiency of linear coupling along a chain of nuclear spins, the synthesis of a suitably coupled molecule, and the use of a multi-channel spectrometer.
A scheme to execute an n-bit Deutsch-Jozsa (D-J) algorithm using n qubits has been implemented for up to three qubits on an NMR quantum computer. For the one and two bit Deutsch problem, the qubits do not get entangled, hence the NMR implementation is achieved without using spin-spin interactions. It is for the three bit case, that the manipulation of entangled states becomes essential. The interactions through scalar J-couplings in NMR spin systems have been exploited to implement entangling transformations required for the three bit D-J algorithm.
We implemented the refined Deutsch-Jozsa algorithm on a 3-bit nuclear magnetic resonance quantum computer, which is the meaningful test of quantum parallelism because qubits are entangled. All of the balanced and constant functions were realized exactly. The results agree well with theoretical predictions and clearly distinguish the balanced functions from constant functions. Efficient refocusing schemes were proposed for the soft z-pulse and J-coupling and it is proved that the thermal equilibrium state gives the same results as the pure state for this algorithm.
We present here algorithmic cooling (via polarization-heat-bath)- a powerful method for obtaining a large number of highly polarized spins in liquid nuclear-spin systems at finite temperature. Given that spin-half states represent (quantum) bits, algorithmic cooling cleans dirty bits beyond the Shannon's bound on data compression, by employing a set of rapidly thermal-relaxing bits. Such auxiliary bits could be implemented using spins that rapidly get into thermal equilibrium with the environment, e.g., electron spins. Cooling spins to a very low temperature without cooling the environment cou…
We present a classical model for bulk-ensemble NMR quantum computation: the quantum state of the NMR sample is described by a probability distribution over the orientations of classical tops, and quantum gates are described by classical transition probabilities. All NMR quantum computing experiments performed so far with three quantum bits can be accounted for in this classical model. After a few entangling gates, the classical model suffers an exponential decrease of the measured signal, whereas there is no corresponding decrease in the quantum description. We suggest that for small numbers o…
We describe the creation of a Greenberger-Horne-Zeilinger (GHZ) state of the form |000>+|111> (three maximally entangled quantum bits) using Nuclear Magnetic Resonance (NMR). We have successfully carried out the experiment using the proton and carbon spins of trichloroethylene, and confirmed the result using state tomography. We have thus extended the space of entangled quantum states explored systematically to three quantum bits, an essential step for quantum computation.
A new method of preparing the pseudo-pure state of a spin system for quantum computation in liquid nuclear magnetic resonance (NMR) was put forward and demonstrated experimentally. Applying appropriately connected line-selective pulses simultaneously and a field gradient pulse techniques we acquired straightforwardly all pseudo-pure states for two qubits in a single experiment much efficiently. The signal intensity with the pseudo-pure state prepared in this way is the same as that of temporal averaging. Our method is suitable for the system with arbitrary numbers of qubits. As an example of a…
We report experimental implementation of discrete Fourier transformation(DFT) on a nuclear magnetic resonance(NMR) quantum computer. Experimental results agree with theoretical results. Using the pulse sequences we introduced, DFT can be realized on any L-bit quantum number in principle.
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.
We show that it is possible to transfer two-bit information via encoding a single qubit in a conventional nuclear magnetic resonance (NMR) experiment with two very weakly polarized nuclear spins. Nevertheless, the experiment can not be regarded as a demonstration of superdense coding by means of NMR because it is based on the large number of molecules being involved in the ensemble state rather than the entanglement of the NMR states. Following the discussions, an entanglement witness, particularly applicable for NMR, is introduced based on separate and simultaneous measurement of the individu…
It is exponentially hard to simulate quantum systems by classical algorithms, while quantum computer could in principle solve this problem polynomially. We demonstrate such an quantum-simulation algorithm on our NMR system to simulate an hydrogen molecule and calculate its ground-state energy. We utilize the NMR interferometry method to measure the phase shift and iterate the process to get a high precision. Finally we get 17 precise bits of the energy value, and we also analyze the source of the error in the simulation.
Experimental NMR implementations of the Deutsch-Josza quantum algorithm based on pesudo-pure spin states exhibit an exponential sensitivity scaling with the number of qubits. By employing truly mixed spin states in spin Liouville space, where molecules with different nuclear spin configurations represent different input states, the Deutsch-Josza problem can be solved by single function evaluation without sensitivity loss concomitant with increase of the number of bits.
We describe the experimental implementation of a recently proposed quantum algorithm involving quantum entanglement at the level of two qubits using NMR. The algorithm solves a generalisation of the Deutsch problem and distinguishes between even and odd functions using fewer function calls than is possible classically. The manipulation of entangled states of the two qubits is essential here, unlike the Deutsch-Jozsa algorithm and the Grover's search algorithm for two bits.
We report the realization of a nuclear magnetic resonance (NMR) quantum computer which combines the quantum Fourier transform (QFT) 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.
We offer an improved method for using a nuclear-magnetic-resonance quantum computer (NMRQC) to solve the Deutsch-Jozsa problem. Two known obstacles to the application of the NMRQC are exponential diminishment of density-matrix elements with the number of bits, threatening weak signal levels, and the high cost of preparing a suitable starting state. A third obstacle is a heretofore unnoticed restriction on measurement operators available for use by an NMRQC. Variations on the function classes of the Deutsch-Jozsa problem are introduced, both to extend the range of problems advantageous for quan…
We propose and experimentally realize an algorithmic benchmark that demonstrates coherent control with a sequence of quantum operations that first generates and then decodes the cat state (|000...>+|111...>)/sqrt(2) to the standard initial state |000...>. This is the first high fidelity experimental quantum algorithm on the currently largest physical quantum register, which has seven quantum bits (qubits) provided by the nuclei of crotonic acid. The experiment has the additional benefit of verifying a seven coherence in a generic system of coupled spins. Our implementation combines numerous nu…
Quantum processors are potentially superior to their classical counterparts for many computational tasks including factorization. Circuit methods as well as adiabatic methods have already been proposed and implemented for finding the factors of a given composite number. The main challenge in scaling it to larger numbers is the unavailability of large number of qubits. Here we propose a hybrid scheme that involves both classical and quantum computation, which reduces the number of qubits required for factorization. The classical part involves setting up and partially simplifying a set of bit-wi…
We present experimental results on the measurement of fidelity decay under contrasting system dynamics using a nuclear magnetic resonance quantum information processor. The measurements were performed by implementing a scalable circuit in the model of deterministic quantum computation with only one quantum bit. The results show measurable differences between regular and complex behaviour and for complex dynamics are faithful to the expected theoretical decay rate. Moreover, we illustrate how the experimental method can be seen as an efficient way for either extracting coarse-grained informatio…
Algorithmic cooling (AC) is a method to purify quantum systems, such as ensembles of nuclear spins, or cold atoms in an optical lattice. When applied to spins, AC produces ensembles of highly polarized spins, which enhance the signal strength in nuclear magnetic resonance (NMR). According to this cooling approach, spin-half nuclei in a constant magnetic field are considered as bits, or more precisely, quantum bits, in a known probability distribution. Algorithmic steps on these bits are then translated into specially designed NMR pulse sequences using common NMR quantum computation tools. The …
The quantum Fourier transform (QFT) has been implemented on a three bit nuclear magnetic resonance (NMR) quantum computer, providing a first step towards the realization of Shor's factoring and other quantum algorithms. Implementation of the QFT is presented with fidelity measures, and state tomography. Experimentally realizing the QFT is a clear demonstration of NMR's ability to control quantum systems.
This paper surveys our recent research on quantum information processing by nuclear magnetic resonance (NMR) spectroscopy. We begin with a geometric introduction to the NMR of an ensemble of indistinguishable spins, and then show how this geometric interpretation is contained within an algebra of multispin product operators. This algebra is used throughout the rest of the paper to demonstrate that it provides a facile framework within which to study quantum information processing more generally. The implementation of quantum algorithms by NMR depends upon the availability of special kinds of m…
Algorithmic cooling is a potentially important technique for making scalable NMR quantum computation feasible in practice. Given the constraints imposed by this approach to quantum computing, the most likely cooling algorithms to be practicable are those based on simple reversible polarization compression (RPC) operations acting locally on small numbers of bits. Several different algorithms using 2- and 3-bit RPC operations have appeared in the literature, and these are the algorithms I consider in this note. Specifically, I show that the RPC operation used in all these algorithms is essential…
Algorithmic Cooling is a method that uses novel data compression techniques and simplecquantum computing devices to improve NMR spectroscopy, and to offer scalable NMR quantum computers. The algorithm recursively employs two steps. A reversible entropy compression of the 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 the…
Quantum error correction is required to compensate for the fragility of the state of a quantum computer. We report the first experimental implementations of quantum error correction and confirm the expected state stabilization. In NMR computing, however, a net improvement in the signal-to-noise would require very high polarization. The experiment implemented the 3-bit code for phase errors in liquid state state NMR.
While a bit is the fundamental unit of binary classical information, a qubit is the fundamental unit of quantum information. In quantum information processing (QIP), it is customary to call the qubits under study as system qubits, and the additional qubits as ancillary qubits. In this thesis, I describe various schemes to exploit the ancillary qubits to efficiently perform many QIP tasks and their experimental demonstrations in nuclear magnetic resonance (NMR) systems. Particularly, we have showed that, in the presence of sufficient ancillary qubits, it is possible to completely characterize a…
Quantum error correcting codes enable the information contained in a quantum state to be protected from decoherence due to external perturbations. Applied to NMR, quantum coding does not alter normal relaxation, but rather converts the state of a ``data'' spin into multiple quantum coherences involving additional ancilla spins. These multiple quantum coherences relax at differing rates, thus permitting the original state of the data to be approximately reconstructed by mixing them together in an appropriate fashion. This paper describes the operation of a simple, three-bit quantum code in the …
Quantum error correcting codes have been shown to have the ability of making quantum information resilient against noise. Here we show that we can use quantum error correcting codes as diagnostics to characterise noise. The experiment is based on a three-bit quantum error correcting code carried out on a three-qubit nuclear magnetic resonance (NMR) quantum information processor. Utilizing both engineered and natural noise, the degree of correlations present in the noise affecting a two-qubit subsystem was determined. We measured a correlation factor of c=0.5+/-0.2 using the error correction pr…
The phenomenon of quantum entanglement is fundamental to the implementation of quantum computation, and requires at least two qubits for its demonstration. However, both Deutsch algorithm and Grover's search algorithm for two bits do not use entanglement. We develop a Deutsch-like problem, where we consider all possible binary functions for two bit inputs and distinguish their even or odd nature. The quantum algorithm to solve this problem requires entanglement at the level of two qubits. The final solution suggests that an NMR implementation of the problem would lead to interesting results.
This letter presents a two-dimensional nuclear magnetic resonance(NMR) approach for constructing a two-logical-qubit decoherence-free subspace (DFS) based on the fact that the three protons in a CH3 spin system can not be resolved in one-dimension NMR spectroscopy, but to a certain extent, can be distinguished by two-dimensional multiple-quantum NMR. We used four noisy physical nuclear spins, including three protons and one carbon in the CH3 spin system, to generate two decoherence-free logical quantum bits. It made full use of the unaddressed spins which could not be used in one-dimensional s…
Compared with classical search algorithms, Grover quantum algorithm [ Phys. Rev. Lett., 79, 325(1997)] achieves quadratic speedup and Bruschweiler hybrid quantum algorithm [Phys. Rev. Lett., 85, 4815(2000)] achieves an exponential speedup. In this paper, we report the experimental realization of the Bruschweiler$ algorithm in a 3-qubit NMR ensemble system. The pulse sequences are used for the algorithms and the measurement method used here is improved on that used by Bruschweiler, namely, instead of quantitatively measuring the spin projection of the ancilla bit, we utilize the shape of the an…
We describe a nuclear magnetic resonance (NMR) experiment which implements an efficient one-to-two qubit phase-covariant cloning machine(QPCCM). In the experiment we have achieved remarkably high fidelities of cloning, 0.848 and 0.844 respectively for the original and the blank qubit. This experimental value is close to the optimal theoretical value of 0.854. We have also demonstrated how to use our phase-covariant cloning machine for quantum simulations of bit by bit eavesdropping in the four-state quantum key distribution protocol.
As of today, no one can tell when a universal quantum computer with thousands of logical quantum bits (qubits) will be built. At present, most quantum computer prototypes involve less than ten individually controllable qubits, and only exist in laboratories for the sake of either the great costs of devices or professional maintenance requirements. Moreover, scientists believe that quantum computers will never replace our daily, every-minute use of classical computers, but would rather serve as a substantial addition to the classical ones when tackling some particular problems. Due to the above…
Pursuit and Review of Magnetic Resonance Imaging (MRI) based Quantum Computing -- Qubit Generation, Spin Purification, Tailored RF Pulses and MRI Sequences for Quantum Computing
Nuclear Magnetic Resonance (NMR) forms a natural test-bed to perform quantum information processing (QIP) and has so far proven to be one of the most successful quantum information processors. The nuclear spins in a molecule treated as quantum bits or qubits which are the basic building blocks of a quantum computer. The development of NMR over half a century puts it in a platform where we can utilize its excellent control techniques over an ensemble of spin systems and perform quantum computation in a highly controlled way. Apart from a successful quantum information processor, NMR is also a h…
Quantum dense coding has been demonstrated experimentally in terms of quantum logic gates and circuits in quantum computation and NMR technique. Two bits of information have been transmitted through manipulating one of the maximally entangled two-state quantum pair, which is completely consistent with the original ideal of Bennett-Wiesner proposal. Although information transmission happens between spins over inter-atomic distance, the scheme of entanglement transformation and measurement can be used in other processes of quantum information and quantum computing.
A multiple round quantum dense coding (MRQDC) scheme based on the quantum phase estimation algorithm is proposed. Using an $m+1$ qubit system, Bob can transmit $2^{m+1}$ messages to Alice, through manipulating only one qubit and exchanging it between Alice and Bob for $m$ rounds. The information capacity is enhanced to $m+1$ bits. We have implemented the scheme in a three- qubit nuclear magnetic resonance (NMR) quantum computer. The experimental results show a good agreement between theory and experiment.
This paper reports on the experimental implementation of the quantum baker's map via a three bit nuclear magnetic resonance (NMR) quantum information processor. The experiments tested the sensitivity of the quantum chaotic map to perturbations. In the first experiment, the map was iterated forward and then backwards to provide benchmarks for intrinsic errors and decoherence. In the second set of experiments, the least significant qubit was perturbed in between the iterations to test the sensitivity of the quantum chaotic map to applied perturbations. These experiments are used to investigate p…
We describe a new implementation of the Bernstein-Vazirani algorithm which relies on the fact that the polarization states of classical light beams can be cloned. We explore the possibility of computing with waves and discuss a classical optical model capable of implementing any algorithm (on $n$ qubits) that does not involve entanglement. The Bernstein-Vazirani algorithm (with a suitably modified oracle), wherein a hidden $n$ bit vector is discovered by one oracle query as against $n$ oracle queries required classically, belongs to this category. In our scheme, the modified oracle is also cap…
A quantum computer that stores information on two-state systems called quantum bits or qubits must be able to address and manipulate individual qubits, to effect coherent interactions between pairs of qubits, and to read out the value of qubits.1,2 Current methods for addressing qubits are divided up into spatial methods, as when a laser beam is focused on an individual qubit3,4,5 or spectral methods, as when a nuclear spin in a molecule is addressed using NMR.6,7 The density of qubits addressable spatially is limited by the wavelength of light, and the number of qubits addressable spectrally …
Nuclear magnetic resonance (NMR) has been widely used as a demonstrative medium for showcasing the ability for quantum computations to outperform classical ones. A large number of such experiments performed have been implementations of the Deutsch-Jozsa algorithm. It is known, however, that in some cases the Deutsch-Jozsa problem can be solved classically using as many queries to the black-box as in the quantum solution. In this paper we describe experiments in which we take the contrasting approach of using NMR as a classical computing medium, treating the nuclear spin vectors classically and…
We present experimental results approximating the Jones polynomial using 4 qubits in a liquid state nuclear magnetic resonance quantum information processor. This is the first experimental implementation of a complete problem for the deterministic quantum computation with one quantum bit model of quantum computation, which uses a single qubit accompanied by a register of completely random states. The Jones polynomial is a knot invariant that is important not only to knot theory, but also to statistical mechanics and quantum field theory. The implemented algorithm is a modification of the algor…
Most quantum processors requires pulse sequences for controlling quantum states. Here, we present an alternative algorithm for computing an optimal pulse sequence in order to perform a specific task, being an implementation of a quantum gate or a quantum state preparation. In our method, we reduced drastically the number of parameters to be fitted, by using a limited number of functions as the modulations for the amplitude and phase of the radio-frequency pulses, and employed approximations to make the algorithm fast and scalable. We demonstrate the success of the proposed algorithm, by perfor…
Any technology for quantum information processing (QIP) must embody within it quantum bits (qubits) and maintain control of their key quantum properties of superposition and entanglement. Typical QIP schemes envisage an array of physical systems, such as electrons or nuclei, with each system representing a given qubit. For adequate control, systems must be distinguishable either by physical separation or unique frequencies, and their mutual interactions must be individually manipulable. These difficult requirements exclude many nanoscale technologies where systems are densely packed and contin…
We study some discrete symmetries of unbiased (Hadamard) and biased quantum walk on a line, which are shown to hold even when the quantum walker is subjected to environmental effects. The noise models considered in order to account for these effects are the phase flip, bit flip and generalized amplitude damping channels. The numerical solutions are obtained by evolving the density matrix, but the persistence of the symmetries in the presence of noise is proved using the quantum trajectories approach. We also briefly extend these studies to quantum walk on a cycle. These investigations can be r…
Electron and nuclear spins are very promising candidates to serve as quantum bits (qubits) for proposed quantum computers, as the spin degrees of freedom are relatively isolated from their surroundings, and can be coherently manipulated e.g. through pulsed EPR and NMR. For solid state spin systems, impurities in crystals based on carbon and silicon in various forms have been suggested as qubits, and very long relaxation rates have been observed in such systems. We have investigated a variety of these systems at high magnetic fields in our multi-frequency pulsed EPR/ENDOR spectrometer. A high m…
Quantum superposition and entanglement of physical states can be harnessed to solve some problems which are intractable on a classical computer implementing binary logic. Several algorithms have been proposed to utilize the quantum nature of physical states and solve important problems. For example, Shor's quantum algorithm is extremely important in the field of cryptography since it factors large numbers exponentially faster than any known classical algorithm. Another celebrated example is the Grovers quantum algorithm. These algorithms can only be implemented on a quantum computer which oper…
Superconducting circuits with Josephson junctions are promising candidates for developing future quantum technologies. Of particular interest is to use these circuits to study effects that typically occur in complex condensed-matter systems. Here, we employ a superconducting quantum bit (qubit),a transmon, to carry out an analog simulation of motional averaging, a phenomenon initially observed in nuclear magnetic resonance (NMR) spectroscopy. To realize this effect, the flux bias of the transmon is modulated by a controllable pseudo-random telegraph noise, resulting in stochastic jumping of th…
The remarkable discovery of Quantum Error Correction (QEC), which can overcome the errors experienced by a bit of quantum information (qubit), was a critical advance that gives hope for eventually realizing practical quantum computers. In principle, a system that implements QEC can actually pass a "break-even" point and preserve quantum information for longer than the lifetime of its constituent parts. Reaching the break-even point, however, has thus far remained an outstanding and challenging goal. Several previous works have demonstrated elements of QEC in NMR, ions, nitrogen vacancy (NV) ce…
