Similar Items: Block Permutation Routing on Ramanujan Hypergraphs for Fault-Tolerant Quantum Computing
- Solving Hypergraph Laplacian Systems in Almost-Linear Time
- Algorithmic Phase Transition for Large Independent Sets in Dense Hypergraphs
- Designing Capacitated Subnetworks for Shortest Path Routing
- Temporal Routing in Static Networks: The Schedule Completion Problem
- Loop Composition in Quantum Algorithms
- Strict Hierarchy for Quantum Channel Certification to Unitary