Noisy Quantum State Redistribution With Promise and the Alpha-Bit

  title={Noisy Quantum State Redistribution With Promise and the Alpha-Bit},
  author={Anurag Anshu and Min-Hsiu Hsieh and Rahul Jain},
  journal={IEEE Transactions on Information Theory},
We consider a variation of the well-studied quantum state redistribution task, in which the starting state is known only to the receiver Bob and not to the sender Alice. We refer to this as quantum state redistribution with a one-sided promise. In addition, we consider communication from Alice to Bob over a noisy channel $\mathcal {N}$ , instead of the noiseless channel, as is usually considered in state redistribution. We take a natural approach towards the solution of this problem where we… Expand
1 Citations
One-Shot Hybrid State Redistribution.
Various coding theorems for two-party source coding problems are systematically obtained by reduction from the results, including the ones that have not been addressed in previous literatures. Expand


Smooth Entropy Bounds on One-Shot Quantum State Redistribution
A strong converse for quantum state redistribution is obtained, which even holds when allowing for feedback, and an alternative proof of optimality of these rates for quantumstate redistribution in the i.i.d. asymptotic limit is obtained. Expand
Incompressibility of classical distributions
This paper proves a general, robust, lower bound on the achievable rate for ensembles of classical states, which holds even in the least demanding setting when Alice and Bob share free entanglement and a constant per-copy error is allowed. Expand
Building Blocks for Communication Over Noisy Quantum Networks
This work provides a tight characterization of the one-shot entanglement-assisted classical capacity of a quantum channel by introducing a simple decoding technique which is referred to as position-based decoding and uses the recently introduced convex split technique in addition to position- based decoding. Expand
General Mixed State Quantum Data Compression with and without Entanglement Assistance
This work determines the optimal compression rate (in qubits per source system) in terms of the Koashi-Imoto decomposition of the source into a classical, a quantum, and a redundant part in the presence of unlimited entanglement between compressor and decoder. Expand
Single-shot Quantum State Merging
We consider an unknown quantum state shared between two parties, Alice and Bob, and ask how much quantum communication is needed to transfer the full state to Bob. This problem is known as stateExpand
Entanglement-Assisted Communication of Classical and Quantum Information
The main result is a capacity theorem that gives a 3-D achievable rate region that justifies the need for simultaneous coding of classical and quantum information over an EAQ channel. Expand
Approximate Quantum Error Correction Revisited: Introducing the Alpha-Bit
It is established that, in an appropriate limit, qubits of communication should be regarded as composite resources, decomposing cleanly into independent correlation and transmission components, and develops the theory of α -bits, and determines the general quantum channels capacity, finding single-letter formulas for the entanglement-assisted and amortised variants. Expand
One shot entanglement assisted classical and quantum communication over noisy quantum channels: A hypothesis testing and convex split approach
This work provides a tight characterization of the one-shot entanglement assisted classical capacity of a quantum channel by introducing a simple decoding technique, which is referred to as position-based decoding, in addition to the recently introduced convex split technique. Expand
Exact cost of redistributing multipartite quantum states.
This work provides an optimal "quantum state redistribution" protocol for multipartite product sources and identifies the cost, in terms of quantum communication and entanglement, for Alice to give one of her parts to Bob. Expand
The Quantum Reverse Shannon Theorem and Resource Tradeoffs for Simulating Quantum Channels
The amounts of communication and auxiliary resources needed in both the classical and quantum cases, the tradeoffs among them, and the loss of simulation efficiency when auxiliary resources are absent or insufficient are established. Expand