  Quantum computing provides a powerful framework for tackling computational
problems that are classically intractable. The goal of this paper is to explore
the use of quantum computers for solving relevant problems in systems and
control theory. In the recent literature, different quantum algorithms have
been developed to tackle binary optimization, which plays an important role in
various control-theoretic problems. As a prototypical example, we consider the
verification of interval matrix properties such as non-singularity and
stability on a quantum computer. We present a quantum algorithm solving these
problems and we study its performance in simulation. Our results demonstrate
that quantum computers provide a promising tool for control whose applicability
to further computationally complex problems remains to be explored.
