Quantum Gate Scheduler

Before a quantum program ever touches real hardware, a compiler has to schedule its gates into time layers — and that scheduling choice is one of the biggest levers on whether the program survives long enough to finish. This tool takes a fixed program of G gate operations spread across a qubit grid and lets you compile it two ways: sequentially, one gate per time step, or in parallel, packing every independent gate that can share a layer into the same step. Both schedules run the identical control-error-plus-decoherence fidelity model, F(N) = (1-ε)^N · exp(-N·t_gate/T2), against whichever circuit depth N the schedule actually produces, so the live readouts show exactly how many fewer layers — and how much surviving fidelity — a real transpiler's parallelization buys for free, with qubits lighting up per layer and shrinking and reddening as they decohere.