Quantum Compilation
A programme on translating quantum algorithms into executable structures under the geometry, motion, and control constraints of physical hardware.
Compilation is not only circuit optimisation; it is the mathematical mediation between an abstract computation and the architecture that must realise it.
Research Questions
Which architectural constraints create fundamental compilation bottlenecks rather than implementation inconvenience?
How can reusable circuit and interaction patterns expose structural defects before expensive routing and scheduling?
What principles remain invariant across static silicon layouts, shuttling ion traps, and reconfigurable neutral-atom arrays?
Research Record
Research Map
Architecture-aware intermediate representations
Represent connectivity, motion, instruction, and timing constraints early enough that compilation decisions remain physically meaningful.
Pattern-based structural analysis
Identify recurring local structures that permit fast feasibility checks, defect detection, and architecture-specific transformations.
Compilation across dynamic architectures
Compare movement-based systems through a shared language of transport, interaction zones, parallelism, and scheduling cost.