Quantum Internet Buffer Scheduler

A quantum repeater cannot copy an unknown qubit, so it has to store each half of a heralded entangled pair in quantum memory until a matching pair from the far link is ready to swap with it — and that memory decoheres the whole time it waits. This simulator renders both memory buffers of a repeater node in 3D: entangled pairs arrive stochastically on each link, their fidelity fades exponentially with a controllable T₂, and a scheduler (FIFO or max-fidelity-first) races to swap matched pairs into one long-distance entangled link before they decohere or the buffer overflows. Live readouts track delivered throughput, average output fidelity, and the drop rate — the real resource-contention problem sitting underneath every quantum network architecture diagram.