BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Talks.cam//talks.cam.ac.uk//
X-WR-CALNAME:Talks.cam
BEGIN:VEVENT
SUMMARY:Space-Time Optimisations for Early Fault-Tolerant Quantum Computat
 ion - Sanaa Sharma\, Department of Computer Science and Technology\, Unive
 rsity of Cambridge
DTSTART:20260310T110000Z
DTEND:20260310T115000Z
UID:TALK243598@talks.cam.ac.uk
CONTACT:Sanaa Sharma
DESCRIPTION:This paper is accepted to proceedings of the International Sym
 posium on Code Generation and Optimization (CGO).\nThe paper is available 
 at https://arxiv.org/abs/2511.08848\n\nAbstract:\nFault-tolerance is the f
 uture of quantum computing\, ensuring error-corrected quantum computation 
 that can be used for practical applications. Resource requirements for fau
 lt-tolerant quantum computing (FTQC) are daunting\, and hence\, compilatio
 n techniques must be designed to ensure resource efficiency. There is a gr
 owing need for compilation strategies tailored to the early FTQC regime\, 
 which refers to the first generation of fault-tolerant machines operating 
 under stringent resource constraints of fewer physical qubits and limited 
 distillation capacity. Present-day compilation techniques are largely focu
 sed on overprovisioning of routing paths and make liberal assumptions rega
 rding the availability of distillation factories. Our work develops compil
 ation techniques that are tailored to the needs of early FTQC systems\, in
 cluding distillation-adaptive qubit layouts and routing techniques. In par
 ticular\, we show that simple greedy heuristics are extremely effective fo
 r this problem\, offering up to 60% reduction in the number of qubits comp
 ared to prior works. Our techniques offer results with an average overhead
  of 1.2X in execution time for a 53% reduction in qubits against the theor
 etical lower bounds. As the industry develops early FTQC systems with tens
  to hundreds of logical qubits over the coming years\, our work has the po
 tential to be widely useful for optimising program executions. 
LOCATION:Computer Laboratory\, William Gates Building\, Room FW11
END:VEVENT
END:VCALENDAR
