  We study semantic security for classical-quantum channels. Our security
functions are functional forms of mosaics of combinatorial designs. We extend
methods for classical channels to classical-quantum channels to demonstrate
that mosaics of designs ensure semantic security for classical-quantum
channels, and are also capacity achieving coding scheme. The legitimate channel
users share an additional public resource, more precisely, a seed chosen
uniformly at random. An advantage of these modular wiretap codes is that we
provide explicit code constructions that can be implemented in practice for
every channels, giving an arbitrary public code.
