s1dev
Joined 7 years ago
Joined 7 years ago
In general, I'm not sure that the classical information theory toolkit allows us to compare a coherent state with some average occupation number N to say, M (not necessarily coherent) states with average occupation number N' such that N' * M = N. For example, you could use a state that is definitely not "classical" / a coherent state or you could use photon number resolving measurements.
A tangential remark: The classical information theory field uses this notion of "energy per bit" to be able to compare more universally between information transmission schemes. So they would ask something like "How many bits can I transmit with X bandwidth and Y transmission power?"
- Mutating default arguments to functions, so subsequent calls have different behavior
- Somewhat particular rules around creating references vs copies
- Things that look like lambda captures but aren’t quite
I also like Knuth’s art of computer programming book which is more about proving correctness of algorithms
In general, stuff like combinatorics, algorithms, etc I find to have a low barrier to entry, so it’s a nice playground
https://www.cambridge.org/highereducation/books/how-to-prove...
These measurements are classical data, and a computation is required in order to infer the most likely error that led to the measured syndrome. This process is known as decoding.
This work is a model that acts as a decoding algorithm for a very common quantum code -- the surface code. The surface code is somewhat like the quantum analog of a repetition code in a sense.