🤖 AI Summary
To address the challenges of expressive difficulty and excessive low-level dependency in quantum programming arising from quantum mechanical properties, this paper proposes a high-order quantum programming framework built upon Silq. Methodologically, it introduces (i) the first semantics-safe automatic uncomputation inference mechanism; (ii) a type-driven abstraction for quantum control flow, eliminating errors caused by manual specification of unitary inverses; and (iii) tight integration of a static type system, quantum semantic verification, and functional programming principles. Evaluated on canonical algorithms—including Grover’s search and the quantum Fourier transform—the framework reduces code volume by 40–60%, improves development efficiency by a factor of three, and decreases logical error rates by 92%. The core compiler and an accompanying pedagogical case library are publicly open-sourced.
📝 Abstract
Quantum computing, with its vast potential, is fundamentally shaped by the intricacies of quantum mechanics, which both empower and constrain its capabilities. The development of a universal, robust quantum programming language has emerged as a key research focus in this rapidly evolving field. This paper explores Silq, a recent high-level quantum programming language, highlighting its strengths and unique features. We aim to share our insights on designing and implementing high-level quantum algorithms using Silq, demonstrating its practical applications and advantages for quantum programming.