REVIEW 2 cited by
Information theoretic resource-breaking channels
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
Signed reviews
read the original abstract
We propose the notion of process resource-breaking channels that break the resource for a quantum information processing task. We examine the same using quantum dense coding and teleportation protocols. We prove that the sets DBT (dense coding breaking) and TBT (teleportation breaking) are convex and compact and identify classical-quantum channels as their extreme points. We prove group-covariance to be a sufficient condition for channels to be DBT or TBT when they can destroy the resource of maximally entangled states. We present necessary and sufficient conditions for unital channels to be DBT for a single sender-receiver pair, while for multiple senders, the condition is sufficient. The set of qubit TBT channels is proved equivalent to qubit entanglement-breaking channels provided pre-processing is allowed. We construct witness operators to identify non-TBT(non-DBT) maps.
Forward citations
Cited by 2 Pith papers
-
Certifying the dimensionality of any quantum channel with minimal assumptions
Any non-k-Schmidt-number-breaking quantum channel can, in principle, be certified via a semiquantum signaling game using only trusted inputs.
-
Characterizing pairwise swapping capabilities of dense coding channels
Dense coding swapping moves superdense coding advantage between channels using two-qubit unitaries, with exact conditions for three-qubit pure states.
Discussion (0). Continue with ORCID to comment.