Tag Archives: chaos and computation

Noisy quantum circuits: how do we know that we have robust experimental outcomes at all? (And do we care?)

In a recent post we discussed Google’s claim of achieving “quantum supremacy” and my reasons to think that these claims will not stand. (See also this comment for necessary requirements from a quantum supremacy experiment.) This debate gives a good … Continue reading

Posted in Computer Science and Optimization, Quantum | Tagged , , | 10 Comments