  Trellises play an important theoretical and practical role for classical
codes. Their main utility is to devise complexity-efficient error estimation
algorithms. Here, we describe trellis representations for quantum stabilizer
codes. We show that they share the same properties as their classical analogs.
In particular, for any stabilizer code it is possible to find a minimal trellis
representation. Our construction is illustrated by two fundamental error
estimation algorithms.
