paperbot · PL 论文追踪

全部论文 待读 收藏

P2 A Near-Minimal Axiomatisation of ZX-Calculus for Pure Qubit Quantum Mechanics

面向纯量子比特量子力学的 ZX-Calculus 近极小公理化
LICS 2019 34th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS)2019匹配度 2/10 · 该论文属于量子计算中的 ZX-Calculus 公理化与形式语义研究,虽与形式化方法/形式验证有微弱关联,但完全不涉及用户核心关注的 LLM/Agent 程序静态分析、AI 辅助形式验证、浮点程序分析或贝叶斯程序分析。引用 52 inbox
Renaud Vilmart
crossref: 2026-09-12

AI 速览

一句话:提出两种 ZX-Calculus 完备公理化,规则近乎极小且具物理直观,并引入 ZX 图奇异值分解证明其充分性。

ZX-Calculus 此前虽已有完备公理化,但为达到完备性引入的公理数量多、操作繁琐且缺乏物理解释。本文针对一般 ZX-Calculus 提出两种完备公理化,认为其接近最优:所有等式均必要,且每条规则都有良好物理意义。作者引入 ZX 图的奇异值分解,并以此证明旧公理化中的所有规则都可由新公理化推出,从而建立新系统的完备性与充分性。该工作显著简化并解释了纯量子比特量子力学中的图形化推理。

问题
ZX-Calculus 已有完备公理化但公理繁多、缺少物理直觉,本文旨在给出规则必要且具物理解释的完备公理化。
方法
引入 ZX 图的奇异值分解,用它证明旧公理系统中的规则在新系统中可导,从而构造并论证两个完备公理化。
评估
通过证明新公理化的所有等式必要、旧规则均可推导,以及其规则具有物理意义来评估其近乎最优性。
原文摘要(Abstract)

Recent developments in the ZX-Calculus have resulted in complete axiomatisations first for an approximately universal restriction of the language, and then for the whole language. The main drawbacks were that the axioms that were added to achieve completeness were numerous, tedious to manipulate and lacking a physical interpretation. We present in this paper two complete axiomatisations for the general ZX-Calculus, that we believe are optimal, in that all their equations are necessary and moreover have a nice physical interpretation. To do so, we introduce the singular-value decomposition of a ZX-diagram, and use it to show that all the rules of the former axiomatisation are provable with the new one.

链接与引用

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

BibTeX
@inproceedings{paperbot5029,
  title = {A Near-Minimal Axiomatisation of ZX-Calculus for Pure Qubit Quantum Mechanics},
  author = {Renaud Vilmart},
  booktitle = {LICS},
  year = {2019},
  doi = {10.1109/lics.2019.8785765}
}