Coherent Quantum Channel Discrimination
arXiv:2001.02668 · doi:10.1109/ISIT44484.2020.9174425
Abstract
This paper introduces coherent quantum channel discrimination as a coherent version of conventional quantum channel discrimination. Coherent channel discrimination is phrased here as a quantum interactive proof system between a verifier and a prover, wherein the goal of the prover is to distinguish two channels called in superposition in order to distill a Bell state at the end. The key measure considered here is the success probability of distilling a Bell state, and I prove that this success probability does not increase under the action of a quantum superchannel, thus establishing this measure as a fundamental measure of channel distinguishability. Also, I establish some bounds on this success probability in terms of the success probability of conventional channel discrimination. Finally, I provide an explicit semi-definite program that can compute the success probability.
12 pages, 5 figures, submission to ISIT 2020
References in corpus (3)
Cited by in corpus (6)
- Discrimination of POVMs with rank-one effects
- Coherent Quantum Channel Discrimination
- Quantifying the performance of bidirectional quantum teleportation
- State convertibility under genuinely incoherent operations
- Dilation, Discrimination and Uhlmann's Theorem of Link Products of Quantum Channels
- Unbounded entanglement-sustaining sequential local quantum state discrimination