On the minimum number of unitaries needed to describe a random-unitary channel

Abstract

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

References in corpus (2)

• Entanglement of assistance and multipartite state distillation
• Inverting quantum decoherence by classical feedback from the environment

Cited by in corpus (9)

• The information-theoretic costs of simulating quantum measurements
• Quantum Decoherence of Two Qubits
• Environment-Assisted Quantum State Restoration Via Weak Measurement
• Channel correction via quantum erasure
• Additivity and Distinguishability of Random Unitary Channels
• Optimized Entanglement-Assisted Quantum Error Correction
• Quantum erasure of decoherence
• Computational Distinguishability of Quantum Channels
• Open system model for quantum dynamical maps with classical noise and corresponding master equations