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.