Realization of a Quantum Scheduling Algorithm Using Nuclear Magnetic Resonance

The quantum scheduling algorithm proposed by Grover is generalized to extend its scope of applications. The generalized algorithm proposed here is realized on a nuclear magnetic resonance quantum computer. The experimental results show that the generalized algorithm can work efficiently in the case that Grover's scheduling algorithm is completely invalid, and represent the quantum advantages when qubits replace classical bits.

[1]  Realization of generalized quantum searching using nuclear magnetic resonance , 2001, quant-ph/0110076.

[2]  L. Zhihong,et al.  Search for the Halo Effect in the 1H(6He, 6Li)n Reaction , 2002 .

[3]  G. Long.  Grover algorithm with zero theoretical failure rate , 2001, quant-ph/0106071.

[4]  N. Linden,et al.  NMR quantum logic gates for homonuclear spin systems , 1999, quant-ph/9907003.

[5]  Lov K. Grover.  Quantum Mechanics Helps in Searching for a Needle in a Haystack , 1997, quant-ph/9706033.

[6]  N. Gershenfeld,et al.  Experimental Implementation of Fast Quantum Searching , 1998 .

[7]  Timothy F. Havel,et al.  Nuclear magnetic resonance spectroscopy: an experimentally accessible paradigm for quantum computing , 1997, quant-ph/9709001.

[8]  L. Vandersypen,et al.  Implementation of a three-quantum-bit search algorithm , 1999, quant-ph/9910075.

[9]  U. Toronto,et al.  Analysis of generalized Grover quantum search algorithms using recursion equations , 2000, quant-ph/0010077.

[10]  E M Fortunato,et al.  Implementation of the quantum Fourier transform. , 2001, Physical review letters.

[11]  Gilles Brassard,et al.  Tight bounds on quantum searching , 1996, quant-ph/9605034.

[13]  Wang Xu,et al.  Cluster Evolution in Undercooled Melt and Solidification of Undercooled Ge-based Alloy Melts Induced by Extrinsic Clusters , 2003 .

[14]  Xue Fei,et al.  Experimentally Obtaining the Likeness of Two Unknown Qubits on a Nuclear-Magnetic-Resonance Quantum Information Processor , 2003 .

[15]  Xue Fei,et al.  Realization of the Fredkin Gate by Three Transition Pulses in a Nuclear Magnetic Resonance Quantum Information Processor , 2002 .

[16]  Lov K. Grover.  Quantum Computers Can Search Rapidly by Using Almost Any Transformation , 1998 .

[17]  D. Leung,et al.  Bulk quantum computation with nuclear magnetic resonance: theory and experiment , 1998, Proceedings of the Royal Society of London. Series A: Mathematical, Physical and Engineering Sciences.