#### DMCA

## Classical data compression with quantum side information,” quant-ph/0209029

Citations: | 18 - 6 self |

### Citations

12434 |
Elements of Information Theory.
- Cover, Thomas
- 2006
(Show Context)
Citation Context ...bounded from above by I(X n ; Q n ) = nI(X; Q). Recall that Bob makes an estimate ˆ X n = g(I, J) of X n based on I = f(X n ) and the measurement outcome J. Our second ingredient is Fano’s inequality =-=[25]-=-: H(X n |IJ) ≤ h2(Pe) + Pe log(|X | n − 1). Here h2(p) = −p log p − (1 − p)log(1 − p) is the binary entropy. This inequality is interpreted as: Given IJ one can specify X n by saying whether or not it... |

1350 |
Information Theory: Coding Theorems for Discrete Memoryless Systems, 2nd ed.
- Csiszar, Korner
- 2011
(Show Context)
Citation Context ...invite the reader to confirm that in the proof of the converse it was never used. 5Before launching into the proof of achievability we give a heuristic argument. Let us recall typical sequences (see =-=[23]-=- for an extensive discussion) and subspaces [1] and their properties. The theorem of typical sequences states that given random variable X defined on a set X and with probability distribution p(x), fo... |

76 |
The quantum channel capacity and coherent information
- Shor
- 2002
(Show Context)
Citation Context ...ense coding [15] and {q → c} channel simulation combined with quantum teleportation [16], respectively. A recent addition to this class has been the long awaited proof of the channel capacity theorem =-=[17, 18]-=-, which also relies on classical-quantum methods. The problem addressed here belongs to the second class and concerns classical data compression when the decoder has quantum side information at his di... |

24 | Remote preparation of quantum states
- Bennett, Hayden, et al.
- 2005
(Show Context)
Citation Context ...6]). This carries over to the multiterminal case involving many classical senders and one quantum receiver [7]. Then we have Winter’s measurement compression theorem [8], and remote state preparation =-=[9, 11, 10]-=-. These two may be thought of as simulating quantum → classical ({q → c}) and {c → q} channels, respectively. Another recent discovery has been quantum data compression with classical sideinformation ... |

19 | Quantum reverse Shannon theorem
- Bennett, Devetak, et al.
- 2014
(Show Context)
Citation Context ...ird class is that of fully quantum communication problems, such as the entanglementassisted capacity theorem [13] and its reverse – that of simulating quantum channels in the presence of entanglement =-=[14]-=-. These rely on methods of {c → q} channel coding combined with super-dense coding [15] and {q → c} channel simulation combined with quantum teleportation [16], respectively. A recent addition to this... |

18 | Distilling common randomness from bipartite quantum states”, manuscript
- Devetak, Winter
- 2003
(Show Context)
Citation Context ...um and the others are classical. The simplest example is the Holevo-Schumacher-Westmoreland (HSW) theorem [5], which deals with the capacity of a classical → quantum channel (abbreviated {c → q}; see =-=[6]-=-). This carries over to the multiterminal case involving many classical senders and one quantum receiver [7]. Then we have Winter’s measurement compression theorem [8], and remote state preparation [9... |

9 |
A 51, 2738
- Rev
- 1995
(Show Context)
Citation Context ...um problems hitherto solved (in the asymptotic sense of Shannon theory) may be divided into three classes. The first comprises pure bipartite entanglement manipulation, such as Schumacher compression =-=[1]-=- and entanglement concentration/dilution [2, 3, 4]. Their tractability is due to the formal similarities between a pair of perfectly correlated random variables and the Schmidt decomposition of bipart... |

4 |
et al. Remote state preparation
- Bennett
- 2001
(Show Context)
Citation Context ...nel. This carries over to the multiterminal case involving many classical senders and one quantum receiver [6]. Then we have Winter’s measurement compression theorem [7], and remote state preparation =-=[8, 9, 10]-=-. These two may be thought of as simulating q-c (quantum-classical) and c-q channels, respectively. Another recent discovery has been quantum data compression with classical side-information available... |

1 |
A 63, 14302 (2001); H.-K. Lo, quant-ph/9912009
- Rev
- 1999
(Show Context)
Citation Context ...6]). This carries over to the multiterminal case involving many classical senders and one quantum receiver [7]. Then we have Winter’s measurement compression theorem [8], and remote state preparation =-=[9, 11, 10]-=-. These two may be thought of as simulating quantum → classical ({q → c}) and {c → q} channels, respectively. Another recent discovery has been quantum data compression with classical sideinformation ... |