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

2006/07/31 by Francesco Buscemi · 27 citations
Engineering · Mathematics · Physics and Astronomy · #Channel (broadcasting) #Circular ensemble #Computer science #Mathematical Analysis and Transform Methods #Mathematical analysis #Mathematics #Physics #Random Matrices and Applications #Simple (philosophy) #Statistical physics #Telecommunications #Unitary matrix #Unitary state #Upper and lower bounds #Wireless Communication Security Techniques #quant-ph

paper · pdf · doi:10.1016/j.physleta.2006.08.038

published in Physics Letters A 360(2), 256-258 (Elsevier BV) · Final version accepted for publication. One wrong equation has been corrected, two notes and one reference have been added

openalex publication_date 2006/08/25 · arxiv created 2006/08/28 · arxiv updated 2009/12/01 · openalex created_date 2025/10/10 · openalex updated_date 2026/08/05

Abstract

We provide, in an extremely simple way, an upper bound to the minimum number of unitary operators describing a general random-unitary channel.

Citations

• Classical randomness in quantum measurements
• Completely positive linear maps on complex matrices
• Inverting Quantum Decoherence by Classical Feedback from the Environment

Cited by

• Optimized entanglement-assisted quantum error correction
• Additivity and distinguishability of random unitary channels