Tootfinder

Magic and communication complexity
Uma Girish, Alex May, Natalie Parham, Henry Yuen
https://arxiv.org/abs/2510.07246 https://arxiv.org/pdf/2510.07246

Magic and communication complexity
We establish novel connections between magic in quantum circuits and communication complexity. In particular, we show that functions computable with low magic have low communication cost. Our first result shows that the $\mathsf{D}\|$ (deterministic simultaneous message passing) cost of a Boolean function $f$ is at most the number of single-qubit magic gates in a quantum circuit computing $f$ with any quantum advice state. If we allow mid-circuit measurements and adaptive circuits, we ob…

Spent half a day adding error checking for errors that can't really happen anyway on the advice of a robot.
Now, instead of crashing with an error message if the input data is impossibly broken, the function instead checks if the error exists, and if so quits with an error code and a slightly different error message.
This is better code apparently. I guess when it's longer there's more to read so it's more readable.