Pith. sign in

REVIEW 1 cited by

Simulation of non-Pauli 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

arxiv 1706.05384 v2 pith:A222BLYD submitted 2017-06-16 quant-ph

classification quant-ph
keywords channelchannelssimulationclassclassicalcommunicationloccnon-pauli
verification ladder T0 review T1 audit T2 compute T3 formal

Signed reviews

No signed human review yet.

0 comments
read the original abstract

We consider the simulation of a quantum channel by two parties who share a resource state and may apply local operations assisted by classical communication (LOCC). One specific type of such LOCC is standard teleportation, which is however limited to the simulation of Pauli channels. Here we show how we can easily enlarge this class by means of a minimal perturbation of the teleportation protocol, where we introduce noise in the classical communication channel between the remote parties. By adopting this noisy protocol, we provide a necessary condition for simulating a non-Pauli channel. In particular, we characterize the set of channels that are generated assuming the Choi matrix of an amplitude damping channel as a resource state. Within this set, we identify a class of Pauli-damping channels for which we bound the two-way quantum and private capacities.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Sharp Quantum Capacity Thresholds: Exponential Strong Converses for Degradable and Antidegradable Channels

    quant-ph 2026-08 accept novelty 8.0 of 10

    Every finite-dimensional degradable or antidegradable quantum channel has an exponential strong converse: above capacity, all coding schemes have fidelity decaying exponentially in the number of channel uses.

Pith tools