Compiling and Running High-level Quantum Programs
summary
Claims a working compilation framework from Silq to a new graph IR called HQIR that preserves Silq semantics and is physically realizable; implements automatic uncomputation by synthesizing a forget node that walks value-dependence graphs, encodes quantum conditionals with split and merge/select nodes and control edges, and represents loops symbolically with indexed nodes so arbitrary classically-computable bounds run without full unrolling. The prototype compiles and simulates Silq examples and demonstrates these transformations end-to-end.
AI-written summary · about
chapters (9)
- 0:00Introduction
- 0:22Highlevel Quantum Programs
- 1:46Challenges
- 3:10Intermediate Representation
- 4:03HQIR
- 6:09Forget
- 8:17If statements
- 10:55Loops
- 13:15Conclusion
related talks
26mQrisp: A Framework for Compilable High-Level Programming of Gate-Based Quantu...
15mToward A Quantum Programming Language for Higher Level Formal Verification
22mSimuQ: A Framework for Programming Quantum Hamiltonian Simulation with Analog Co...
40mQ# - going beyond quantum circuits
55mScalable Quantum Compilation With Jasp
23mHUGR: A Quantum-Classical Intermediate Representation
22mCoqQ: Foundational Verification of Quantum Programs
33mVerified Compilation of Quantum Oracles