Results 1  10
of
28,142
Coding Theorems for Quantum Communication Channels
 Steklov Mathematical Institute, (Online preprint quantph/9708046
, 1997
"... I. The capacity and the entropy bound Let H be a Hilbert space providing a quantummechanical description for the physical carrier of information. A simple model of quantum communication channel consists of the input alphabet A = {1,..., a} and a mapping i → Si from the input alphabet to the set of ..."
Abstract

Cited by 4 (0 self)
 Add to MetaCart
I. The capacity and the entropy bound Let H be a Hilbert space providing a quantummechanical description for the physical carrier of information. A simple model of quantum communication channel consists of the input alphabet A = {1,..., a} and a mapping i → Si from the input alphabet to the set
Twoway quantum communication channels
, 2005
"... We consider communication between two parties using a bipartite quantum operation, which constitutes the most general quantum mechanical model of twoparty communication. We primarily focus on the simultaneous forward and backward communication of classical messages. For the case in which the two pa ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
We consider communication between two parties using a bipartite quantum operation, which constitutes the most general quantum mechanical model of twoparty communication. We primarily focus on the simultaneous forward and backward communication of classical messages. For the case in which the two
On reliability function of quantum communication channel,” Probl
 Predachi Inform
, 1998
"... Let H be a Hilbert space. We consider quantum channel [6] with a finite input alphabet {1,..., d} and with pure signal states Si = ψi>< ψi; i = 1,..., d. We assume that the vectors ψi; i = 1,..., d, are linearly independent and without loss of generality take d = ..."
Abstract

Cited by 22 (4 self)
 Add to MetaCart
Let H be a Hilbert space. We consider quantum channel [6] with a finite input alphabet {1,..., d} and with pure signal states Si = ψi>< ψi; i = 1,..., d. We assume that the vectors ψi; i = 1,..., d, are linearly independent and without loss of generality take d =
Capacity of a Memoryless Quantum Communication Channel
, 1994
"... We introduce a proper framework of coding problems for a quantum memoryless channel and derive an asymptotic formula for the channel capacity, based upon the philosophy that any information theory shall be constructed in terms of observable quantities. Some general lower and upper bounds for the qua ..."
Abstract

Cited by 4 (1 self)
 Add to MetaCart
for the quantum channel capacity are also derived. Keywords : quantum information theory, quantum communication, memoryless quantum channel, mutual information, quantum capacity,channel coding. 3 Department of Mathematics, Osaka University, Osaka 560, Japan. y Graduate School of Information Systems, University
Capacity of a Memoryless Quantum Communication Channel
, 1994
"... We introduce a proper framework of coding problems for a quantum memoryless channel and derive an asymptotic formula for the channel capacity, based upon the philosophy that any information theory shall be constructed in terms of observable quantities. Some general lower and upper bounds for the qua ..."
Abstract
 Add to MetaCart
for the quantum channel capacity are also derived. Keywords : quantum information theory, quantum communication, memoryless quantum channel, mutual information, quantum capacity, channel coding. 3 Department of Mathematics, Osaka University, Osaka 560, Japan. y Graduate School of Information Systems
Multipartite entangled magnon states as quantum communication channels
, 905
"... We explicate conditions under which, the two magnon state becomes highly entangled and is useful for several quantum communication protocols. This state, which is experimentally realizable in quantum dots using Heisenberg exchange interaction, is found to be suitable for carrying out deterministic t ..."
Abstract
 Add to MetaCart
We explicate conditions under which, the two magnon state becomes highly entangled and is useful for several quantum communication protocols. This state, which is experimentally realizable in quantum dots using Heisenberg exchange interaction, is found to be suitable for carrying out deterministic
On quantum communication channels with constrained inputs, eprint quantph/9705054
, 1997
"... Abstract – The purpose of this work is to extend results of previous papers [13], [2] to quantum channels with additive constraints onto the input signal, by showing that the capacity of such channel is equal to the supremum of the entropy bound with respect to all apriori distributions satisfying t ..."
Abstract

Cited by 15 (3 self)
 Add to MetaCart
the lower bounds for the reliability function of the purestate Gaussian channel. I. The case of discrete alphabet Most of the results concerning the capacity of quantum communication channels were proved for the case of finite input alphabets [9], [11], [7], [13]. The importance of considering channels
Teleporting an Unknown Quantum State via Dual Classical and EPR Channels
, 1993
"... An unknown quantum state jOEi can be disassembled into, then later reconstructed from, purely classical information and purely nonclassical EPR correlations. To do so the sender, "Alice," and the receiver, "Bob," must prearrange the sharing of an EPRcorrelated pair of particles. ..."
Abstract

Cited by 649 (22 self)
 Add to MetaCart
An unknown quantum state jOEi can be disassembled into, then later reconstructed from, purely classical information and purely nonclassical EPR correlations. To do so the sender, "Alice," and the receiver, "Bob," must prearrange the sharing of an EPRcorrelated pair of particles
Capacity of multiantenna Gaussian channels
 EUROPEAN TRANSACTIONS ON TELECOMMUNICATIONS
, 1999
"... We investigate the use of multiple transmitting and/or receiving antennas for single user communications over the additive Gaussian channel with and without fading. We derive formulas for the capacities and error exponents of such channels, and describe computational procedures to evaluate such form ..."
Abstract

Cited by 2923 (6 self)
 Add to MetaCart
We investigate the use of multiple transmitting and/or receiving antennas for single user communications over the additive Gaussian channel with and without fading. We derive formulas for the capacities and error exponents of such channels, and describe computational procedures to evaluate
Packet Switching In Radio Channels: Part III  Polling and . . .
 IEEE TRANSACTIONS ON COMMUNICATIONS
, 1976
"... Here we continue the analytic study of packet switching in radio channels which we reported upon in our two previous papers [ 11, [2]. Again we consider a population of terminals communicating with a central station over a packetswitched radio channel. The allocation of bandwidth among the contend ..."
Abstract

Cited by 517 (5 self)
 Add to MetaCart
Here we continue the analytic study of packet switching in radio channels which we reported upon in our two previous papers [ 11, [2]. Again we consider a population of terminals communicating with a central station over a packetswitched radio channel. The allocation of bandwidth among
Results 1  10
of
28,142