# qubit: stability of classical shadows under gate-dependent noise

<< Expectation values of observables are routinely estimated using so-called classical shadows—the outcomes of randomized bases measurements on a repeatedly prepared quantum state. In order to trust the accuracy of shadow estimation in practice, it is crucial to understand the behavior of the estimators under realistic noise. >>

<< In this Letter, (AA) prove that any shadow estimation protocol involving Clifford unitaries is stable under gate-dependent noise for observables with bounded stabilizer norm—originally introduced in the context of simulating Clifford circuits. In contrast, (They) demonstrate with concrete examples that estimation of “magic” observables can lead to highly misleading results in the presence of miscalibration errors and a worst case bias scaling exponentially in the system size. >>

AA << further find that so-called robust shadows, aiming at mitigating noise, can introduce a large bias in the presence of gate-dependent noise compared to unmitigated classical shadows. Nevertheless, (AA) guarantee the functioning of robust shadows for a more general noise setting than in previous works. On a technical level, (They) identify average noise channels that affect shadow estimators and allow for a more fine-grained control of noise-induced biases. >>️

Raphael Brieger, Markus Heinrich, et al. Stability of Classical Shadows under Gate-Dependent Noise. Phys. Rev. Lett. 134, 090801. Mar 4, 2025. 

https://journals.aps.org/prl/abstract/10.1103/PhysRevLett.134.090801  arXiv: 2310.19947v3 [quant-ph]. Feb 19, 2025.   https://arxiv.org/abs/2310.19947

Also: qubit, in FonT  https://flashontrack.blogspot.com/search?q=qubit  noise, ai (artificial intell) (bot), in https://www.inkgmr.net/kwrds.html   

Keywords: qubit, noise, realistic noise, shadows, robust shadows

# qubit: communication power of a noisy qubit.

<< A fundamental limitation of quantum communication is that a single qubit can carry at most one bit of classical information. For an important class of quantum communication channels, known as entanglement breaking, this limitation holds even if the sender and receiver share entangled particles. But does this mean that, for the purpose of communicating classical messages, a noisy entanglement-breaking qubit channel can be replaced by a noisy bit channel? >>

Here AA << answer the question in the negative. (They) introduce a game, similar to the Monty Hall problem in classical statistics, where a sender assists a receiver in finding a valuable item (the “prize”) hidden in one of four possible boxes, while avoiding a hazardous item (the “bomb”) hidden in one of the remaining three boxes. (AA) show that no classical strategy using a noisy bit channel can ensure that the bomb is avoided, even if the sender and receiver share arbitrary amounts of randomness. >>

<< In contrast, communication of a qubit through a class of noisy entanglement-breaking channels, which (They) call quantum not channels, allows the players to deterministically avoid the bomb and to find the prize with a guaranteed nonzero probability. >>

AA << findings show that the communication of classical messages through a noisy entanglement-breaking qubit channel assisted by quantum entanglement cannot, in general, be simulated by communication through a noisy bit channel assisted by classical correlations. >>️

Giulio Chiribella, Saptarshi Roy, et al. Communication Power of a Noisy Qubit. Phys. Rev. Lett. 134, 080803. Feb 28, 2025. 

https://journals.aps.org/prl/abstract/10.1103/PhysRevLett.134.080803     arXiv: 2405.17946v2 [quant-ph]. https://arxiv.org/abs/2405.17946  

Also: qubit, in https://flashontrack.blogspot.com/search?q=qubit  game, in  https://flashontrack.blogspot.com/search?q=game  noise, in  https://flashontrack.blogspot.com/search?q=noise 

Keywords: qubit, games, noise