On the minimum number of unitaries needed to describe a random-unitary channel
Abstract
Description
We provide, in an extremely simple way, an upper bound to the minimum number of unitary operators describing a general random-unitary channel.
Final version accepted for publication. One wrong equation has been corrected, two notes and one reference have been added
Final version accepted for publication. One wrong equation has been corrected, two notes and one reference have been added