REVIEW 1 cited by
Quantum Channel Simulation in Fidelity is no more difficult than State Splitting
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
read the original abstract
Characterizing the minimal communication needed for the quantum channel simulation is a fundamental task in the quantum information theory. In this paper, we show that, in fidelity, the quantum channel simulation can be directly achieved via quantum state splitting without using a technique known as the de~Finetti reduction, and thus provide a pair of tighter one-shot bounds. Using the bounds, we also recover the quantum reverse Shannon theorem in a much simpler way.
Forward citations
Cited by 1 Pith paper
-
Sharp estimates of quantum covering problems via a novel trace inequality
A novel trace inequality, derived via operator layer cake, sharpens one-shot covering, privacy, splitting, decoupling, and channel simulation bounds by removing spectral-size factors.
Discussion (0). Continue with ORCID to comment.