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 on many qubits.
No-Go Theorem for Generic Simulation of Qubit Channels with Finite Classical Resources
1 Pith paper cite this work. Polarity classification is still indexing.
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.
citation-role summary
citation-polarity summary
fields
quant-ph 1years
2026 1verdicts
ACCEPT 1roles
background 1polarities
background 1representative citing papers
citing papers explorer
-
A lower bound on the classical simulation cost of star-network correlations
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 on many qubits.