paperbot · PL 论文追踪

全部论文 待读 收藏

P2 Semantics for variational Quantum programming

变分量子编程的语义
POPL 6(POPL)2022匹配度 2/10 · 论文属于量子与概率编程语言的形式语义研究,虽涉及概率编程和指称语义,但与用户核心关注的 LLM/Agent、静态分析、浮点程序分析、贝叶斯程序分析与 LLM 交叉等方向基本无关。仅在“概率/形式化语义”上有非常微弱的交集,不构成实质性匹配。引用 14 inbox
Xiaodong Jia, Andre Kornell, Bert Lindenhovius, Michael Mislove, Vladimir Zamdzhiev
crossref: 2026-09-10

AI 速览

一句话:为混合经典-量子变分编程语言建立可靠且计算充分的指称语义,连接概率与量子模型。

本文研究一个可同时处理经典与量子信息的类型安全语言,面向变分量子编程这一经典-量子混合计算范式。经典子系统采用 Probabilistic FixPoint Calculus(PFPC),包含混合变差递归类型、项递归与概率选择;量子子系统是一阶线性类型系统,用于操作量子信息。两者通过混合经典/量子项关联:量子测量诱导经典概率效应,经典概率程序也可影响量子动力学。作者给出该语言的可靠且计算充分的指称语义:经典概率效应由 DCPO 上近期提出的交换概率 monad 解释,量子效应与资源在 von Neumann 代数范畴中解释,并证明该范畴对连续 domain 富集。利用这一富集结构,论文对经典概率编程与量子编程的 domain 论模型进行了细致关联分析。

问题
问题是为兼顾经典与量子信息、支持变分量子编程的混合语言提供语义基础,尤其是统一解释经典概率效应与量子效应之间的关系。
方法
方法上,经典部分以 PFPC 为核心,量子部分采用一阶线性类型系统,并用混合项连接测量与经典概率控制;语义上分别在 DCPO 概率 monad 与 von Neumann 代数范畴中解释经典和量子效应,利用后者对连续 domain 的富集建立关联。
评估
评估是理论性的:作者证明所给指称语义可靠且计算充分,并通过 domain 论分析展示经典概率编程模型与量子编程模型之间的语义联系。
原文摘要(Abstract)

We consider a programming language that can manipulate both classical and quantum information. Our language is type-safe and designed for variational quantum programming, which is a hybrid classical-quantum computational paradigm. The classical subsystem of the language is the Probabilistic FixPoint Calculus (PFPC), which is a lambda calculus with mixed-variance recursive types, term recursion and probabilistic choice. The quantum subsystem is a first-order linear type system that can manipulate quantum information. The two subsystems are related by mixed classical/quantum terms that specify how classical probabilistic effects are induced by quantum measurements, and conversely, how classical (probabilistic) programs can influence the quantum dynamics. We also describe a sound and computationally adequate denotational semantics for the language. Classical probabilistic effects are interpreted using a recently-described commutative probabilistic monad on DCPO. Quantum effects and resources are interpreted in a category of von Neumann algebras that we show is enriched over (continuous) domains. This strong sense of enrichment allows us to develop novel semantic methods that we use to interpret the relationship between the quantum and classical probabilistic effects. By doing so we provide a very detailed denotational analysis that relates domain-theoretic models of classical probabilistic programming to models of quantum programming.

链接与引用

DOI 原文 · PDF(开放获取) ·

BibTeX
@article{paperbot1585,
  title = {Semantics for variational Quantum programming},
  author = {Xiaodong Jia and Andre Kornell and Bert Lindenhovius and Michael Mislove and Vladimir Zamdzhiev},
  journal = {Proceedings of the ACM on Programming Languages},
  volume = {6},
  number = {POPL},
  year = {2022},
  doi = {10.1145/3498687}
}