Cirq: speeding up Circuit(op_tree) earliest-placement construction
Profiling cirq.Circuit(list_of_op_lists) showed three cheap wins in the EARLIEST loading path: (1) flatten_to_ops_or_moments is recursive generators; an explicit stack of iterators is faster. (2) _load_contents_with_earliest_strategy builds final moments with Moment(list), which re-flattens already-flat ops; Moment.from_ops(*list) skips that. (3) In get_earliest_accommodating_moment_index, max(last, *[d.get(q, -1) for q in qubits]) per op is slower than a plain for-loop tracking the max. Together about 25% faster on 500x100 X gates. Prototype such changes by monkeypatching module attributes (circuit module functions are looked up at call time) before editing. Running Cirq's check/pytest with xdist can fail with 'Different tests were collected between gwN'; pass -n0.