On the minimum number of unitaries needed to describe a random-unitary channel
classification
🪐 quant-ph
keywords
channelminimumnumberrandom-unitarybounddescribedescribingextremely
read the original abstract
We provide, in an extremely simple way, an upper bound to the minimum number of unitary operators describing a general random-unitary channel.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.