Quantum phenomena of interest in connection with applications to computation
and communication almost always involve generating specific transfers between
eigenstates, and their linear superpositions. For some quantum systems, such as
spin systems, the quantum evolution equation (the Schr\"{o}dinger equation) is
finite-dimensional and old results on controllability of systems defined on on
Lie groups and quotient spaces provide most of what is needed insofar as
controllability of non-dissipative systems is concerned. However, in an
infinite-dimensional setting, controlling the evolution of quantum systems
often presents difficulties, both conceptual and technical. In this paper we
present a systematic approach to a class of such problems for which it is
possible to avoid some of the technical issues. In particular, we analyze
controllability for infinite-dimensional bilinear systems under assumptions
that make controllability possible using trajectories lying in a nested family
of pre-defined subspaces. This result, which we call the Finite Controllability
Theorem, provides a set of sufficient conditions for controllability in an
infinite-dimensional setting. We consider specific physical systems that are of
interest for quantum computing, and provide insights into the types of quantum
operations (gates) that may be developed.Comment: This is a much improved version of the paper first submitted to the
arxiv in 2006 that has been under review since 2005. A shortened version of
this paper has been conditionally accepted for publication in IEEE
Transactions in Automatic Control (2009