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.

arXiv commentFinal version accepted for publication. One wrong equation has been corrected, two notes and one reference have been added

References in corpus (5)

• Classical randomness in quantum measurements
• Entanglement of assistance and multipartite state distillation
• Quantum Lost and Found
• Inverting quantum decoherence by classical feedback from the environment
• Physical realizations of quantum operations

Cited by in corpus (16)

• Unital Quantum Channels - Convex Structure and Revivals of Birkhoff's Theorem
• The information-theoretic costs of simulating quantum measurements
• Quantum Decoherence of Two Qubits
• Environment-Assisted Quantum State Restoration Via Weak Measurement
• Restoration of Quantum State in Dephasing Channel
• On the mixed-unitary rank of quantum channels
• Channel correction via quantum erasure
• Additivity and Distinguishability of Random Unitary Channels
• Brownian motion on Lie groups and open quantum systems
• Environment-Assisted Error Correction of Single-Qubit Phase Damping
• Optimized Entanglement-Assisted Quantum Error Correction
• Quantum erasure of decoherence
• Computational Distinguishability of Quantum Channels
• Geometric Characterization of True Quantum Decoherence
• Open system model for quantum dynamical maps with classical noise and corresponding master equations
• Twirling channels have minimal mixed-unitary rank