← 研踪 PaperTrailarXiv:2607.17714 · v2
Formal Verification of Continuous-Variable Quantum Programs
首次提交 2026-07-20 17:09
版本更新 2026-11-19 21:04
雷达观测 2026-11-20 16:53
摘要
Continuous-variable quantum computing (CQC) is a promising paradigm already accessible through public cloud services. Yet, unlike discrete-variable quantum computing (DQC), CQC lacks a formal program logic. Extending existing quantum Hoare logics to CQC poses fundamental challenges: continuous-variable quantum programs act on {\em infinite-dimensional} Hilbert spaces; their measurement outcomes are often {\em unbounded}, so expectation values may {\em diverge}. We overcome these challenges to give a formal semantics to a universal programming language for CQC and, to our knowledge, provide the first Hoare logic for CQC. We introduce an assertion language based on polynomials over canonical observables and establish soundness and relative completeness of the resulting logic. We also implement a symbolic weakest-precondition calculator for CQC. Our tool has successfully verified CQC algorithms from textbooks and calculated their approximation errors for physically realizable implementations, proved the correctness (i.e., equivalence) of gate decompositions for CQC hardware, and computed the resource requirements (i.e., number of photon-number states) for achieving a desired accuracy in the classical simulation of continuous-variable quantum programs.
观测到的版本
相邻记录可能跳过中间版本;首次发现 v2 及以上也会标为版本更新。
v2 · 2026-11-19 21:04 · 最新观测版本
Formal Verification of Continuous-Variable Quantum Programs
Continuous-variable quantum computing (CQC) is a promising paradigm already accessible through public cloud services. Yet, unlike discrete-variable quantum computing (DQC), CQC lacks a formal program logic. Extending existing quantum Hoare logics to CQC poses fundamental challenges: continuous-variable quantum programs act on {\em infinite-dimensional} Hilbert spaces; their measurement outcomes are often {\em unbounded}, so expectation values may {\em diverge}. We overcome these challenges to give a formal semantics to a universal programming language for CQC and, to our knowledge, provide the first Hoare logic for CQC. We introduce an assertion language based on polynomials over canonical observables and establish soundness and relative completeness of the resulting logic. We also implement a symbolic weakest-precondition calculator for CQC. Our tool has successfully verified CQC algorithms from textbooks and calculated their approximation errors for physically realizable implementations, proved the correctness (i.e., equivalence) of gate decompositions for CQC hardware, and computed the resource requirements (i.e., number of photon-number states) for achieving a desired accuracy in the classical simulation of continuous-variable quantum programs.
查看此版本解读 →查看此版本原文 ↗