pith. sign in

arxiv: quant-ph/0301033 · v2 · submitted 2003-01-09 · 🪐 quant-ph

NMR implementation of a quantum scheduling algorithm

classification 🪐 quant-ph
keywords quantumalgorithmschedulinggeneralizedagreementbeencasescomputer
0
0 comments X
read the original abstract

The improved quantum scheduling algorithm proposed by Grover has been generalized using the generalized quantum search algorithm, in which a unitary operator replaces the Walsh-Hadamard transform, and $\pi/2$ phase rotations replace the selective inversions, in order to make the quantum scheduling algorithm suitable for more cases. Our scheme is realized on a nuclear magnetic resonance (NMR) quantum computer. Experimental results show a good agreement between theory and experiment.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.