t b a b a

ABSTRACT
Quantum computation has been a rich field of study for decades because it promises
possible spectacular advances, some of which may run counter to our classically rooted
intuitions. At the same time, quantum computation is still in its infancy in both theoretical
and practical areas. Efficient quantum algorithms are very limited in number and scope; no
real breakthrough has yet been achieved in physical implementations.
Grover’s search algorithm can be applied to a wide range of problems; even problems not
generally regarded as searching problems can be reformulated to take advantage of quantum
parallelism and entanglement leading to algorithms which show a square root speedup over
their classical counterparts. This dissertation discusses a systematic way to formulate such
problems and gives as an example a quantum scheduling algorithm for an R||Cmax problem.
This thesis shows that quantum solution to such problems is not only feasible but in some
cases advantageous.
The complexity of the error correction circuitry forces us to design quantum error cor-
rection codes capable of correcting only a single error per error correction cycle. Yet, time-
correlated errors are common for physical implementations of quantum systems; an error
corrected during a certain cycle may reoccur in a later cycle due to physical processes spe-
iii