Tata Institute of Fundamental Research
On the Strong Converses for the Quantum Channel Capacity Theorems
Seminar
Speaker:
Naresh Sharma
Organiser:
John Barretto
Date:
Tuesday, 7 Aug 2012, 15:00 to 16:00
Venue:
A-212 (STCS Seminar Room)
(Scan to add to calendar)
Abstract:
A unified approach to prove the converses for the quantum channel capacity theorems is presented. These converses include the strong converse theorems for classical or quantum information transfer with error exponents and novel explicit upper bounds on the fidelity measures reminiscent of the Wolfowitz strong converse for the classical channel capacity theorems. We provide a new proof for the error exponents for the classical information transfer. A long standing problem in quantum information theory has been to find out the strong converse for the channel capacity theorem when quantum information is sent across the channel. We give the quantum error exponent thereby giving a one-shot exponential upper bound on the fidelity. We then apply our results to show that the strong converse holds for the quantum information transfer across an erasure channel for maximally entangled channel inputs (joint work with Naqueeb A. Warsi).
| Speaker: | Naresh Sharma |
| Organiser: | John Barretto |
| Date: | Tuesday, 7 Aug 2012, 15:00 to 16:00 |
| Venue: | A-212 (STCS Seminar Room) |
(Scan to add to calendar)
Abstract:
A unified approach to prove the converses for the quantum channel capacity theorems is presented. These converses include the strong converse theorems for classical or quantum information transfer with error exponents and novel explicit upper bounds on the fidelity measures reminiscent of the Wolfowitz strong converse for the classical channel capacity theorems. We provide a new proof for the error exponents for the classical information transfer. A long standing problem in quantum information theory has been to find out the strong converse for the channel capacity theorem when quantum information is sent across the channel. We give the quantum error exponent thereby giving a one-shot exponential upper bound on the fidelity. We then apply our results to show that the strong converse holds for the quantum information transfer across an erasure channel for maximally entangled channel inputs (joint work with Naqueeb A. Warsi).