Coding theorems for hybrid channels
    
    
  
  
  
      
      
      
        
Teoriâ veroâtnostej i ee primeneniâ, Tome 58 (2013) no. 2, pp. 298-324
    
  
  
  
  
  
    
      
      
        
      
      
      
    Voir la notice de l'article provenant de la source Math-Net.Ru
            
              			The main result of this paper is the coding theorem for the entanglement-assisted capacity of measurement channel with arbitrary alphabet (Theorem 3). As a by-product, a number of results concerning entropies of hybrid (classical-quantum) systems are obtained, as well as the capacities of channels with hybrid output, which are used in the proof of Theorem 3.
			
            
            
            
          
        
      
                  
                    
                    
                    
                    
                    
                      
Keywords: 
communication channel; hybrid (classical-quantum) probability system; classical capacity; entangled state; coding theorem.
                    
                  
                
                
                @article{TVP_2013_58_2_a5,
     author = {A. A. Kuznetsova and A. S. Holevo},
     title = {Coding theorems for hybrid channels},
     journal = {Teori\^a vero\^atnostej i ee primeneni\^a},
     pages = {298--324},
     publisher = {mathdoc},
     volume = {58},
     number = {2},
     year = {2013},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/TVP_2013_58_2_a5/}
}
                      
                      
                    A. A. Kuznetsova; A. S. Holevo. Coding theorems for hybrid channels. Teoriâ veroâtnostej i ee primeneniâ, Tome 58 (2013) no. 2, pp. 298-324. http://geodesic.mathdoc.fr/item/TVP_2013_58_2_a5/
