Proto-Quipper-M的抽象机器语义研究
On Abstract Machine Semantics for Proto-Quipper-M
摘要:
Quipper是一种用于描述量子电路的特定领域程序设计语言。因为它是作为Haskell中的嵌入式语言实现的,所以Quipper是一种非常实用的函数式语言。然而,出于同样的原因,它缺乏正式的语义,并且受到Haskell类型系统的限制。特别是,由于Haskell缺乏线性类型,很容易编写违反量子态不可克隆特性的Quipper程序。为了以类型安全的方式形式化Quipper的相关片段,在过去几年中引入了Proto-Quipper家族的研究语言。在本文中,我们首先回顾Proto-Quipper-M,Proto-Quipper家族的一个实例,它基于量子电路的分类模型,具有线性类型系统,保证了非克隆属性在编译时保持不变。然后,我们推导出一个试探性的小步操作语义的大步骤语义的Proto-Quipper-M,我们证明了这两个是等价的。在证明了试探性语义的主题缩减和进展结果后,我们在此基础上构建了一个真正的抽象机器风格的小步语义,我们最终证明了它与原始语义是等价的。
英文摘要:
Quipper is a domain-specific programming language for the description of quantum circuits. Because it is implemented as an embedded language in Haskell, Quipper is a very practical functional language. However, for the same reason, it lacks a formal semantics and it is limited by Haskell's type system. In particular, because Haskell lacks linear types, it is easy to write Quipper programs that violate the non-cloning property of quantum states. In order to formalize relevant fragments of Quipper in a type-safe way, the Proto-Quipper family of research languages has been introduced over the last years. In this paper we first review Proto-Quipper-M, an instance of the Proto-Quipper family based on a categorical model for quantum circuits, which features a linear type system that guarantees that the non-cloning property holds at compile time. We then derive a tentative small-step operational semantics from the big-step semantics of Proto-Quipper-M and we prove that the two are equivalent. After proving subject reduction and progress results for the tentative semantics, we build upon it to obtain a truly small-step semantics in the style of an abstract machine, which we eventually prove to be equivalent to the original semantics.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。