Pith. sign in

REVIEW 1 cited by

No-Go Theorem for Generic Simulation of Qubit Channels with Finite Classical Resources

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 2501.15807 v2 pith:JONABPCS submitted 2025-01-27 quant-ph

No-Go Theorem for Generic Simulation of Qubit Channels with Finite Classical Resources

classification quant-ph
keywords classicalqubitsimulationchannelfiniteresourcessystemcommunication
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved
0 comments
Share X Bluesky LinkedIn Reddit HN
read the original abstract

The mathematical framework of quantum theory, though fundamentally distinct from classical physics, raises the question of whether quantum processes can be efficiently simulated using classical resources. For instance, a sender (Alice) possessing the classical description of a qubit state can simulate the action of a qubit channel through finite classical communication with a receiver (Bob), enabling Bob to reproduce measurement statistics for any observable on the state. In this work, we contend that a more general simulation requires reproducing statistics of joint measurements, potentially involving entangled effects, on Alice's system and an additional system held by Bob, even when Bob's system state is unknown or entangled with a larger system. Within this broad framework, we prove that no finite amount of classical messaging, regardless of how many rounds are used or how large each message can be, can reproduce a perfect qubit channel, highlighting an inescapable barrier in quantum channel simulation with classical resources. We also establish that entangled effects crucially underlies this no-go result. However, for noisy qubit channels, such as those with depolarizing noise, we demonstrate that general simulation is achievable with finite communication. Notably, the required communication increases as the noise decreases, revealing an intricate relationship between the noise in the channel and the resources necessary for its classical simulation.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 1 Pith paper

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

  1. A lower bound on the classical simulation cost of star-network correlations

    quant-ph 2026-08 accept novelty 6.0

    A star-network exclusion game is won perfectly with quantum d-level messages, but classically needs a message of at least n^{d-1} symbols, so no fixed-size classical qubit description can simulate joint measurements o...