logo
CanyamAI summaries for academic research
language
MobileMobile
  • Phone FeatureWeChat Mini Program
EnglishEnglish
noticeNotice
BlogBlog
delete
arrow
Return

An Expressive Assertion Language for Quantum Programs

delete2026-01-01
delete0
PRE
AI
B
B. Su
Y
Yuan Feng
M
Mingsheng Ying *
L
L. P. Zhou *
DOI：10.1145/3776658delete
deleteOriginal
deleteOriginal request for help
deleteShare
deleteSave
Abstract

Abstract

En 中文
In this paper, we define an assertion language designed for expectation-based reasoning about quantum programs. The key design idea is a representation of quantum predicates by quasi-probability distributions of generalized Pauli operators. Then we extend classical techniques such as G & ouml;delization to prove that this language is expressive with respect to the quantum programs with loops-specifically, for any program psi and any postcondition /i formulated in the assertion language, the weakest precondition of S with respect to /i can also be expressed as a formula in the assertion language. As an application, we present a sound and relatively complete quantum Hoare logic upon our expressive assertion language.
Keywords:
Quantum Programming Languages
Predicate Transformers
Assertion Language
Expressiveness
Intensional Completeness

Journal

P
Proceedings of the ACM on Programming Languages-PACMPL
IF:
2.8
Papers:
308
Citations:
4.7K

Organization

T
tsinghua university
Scholars:
11.8W
Papers: 10.0W
Citations: 137
U
university of technology sydney
Scholars:
1.6W
Papers: 2.0W
Citations: 25
C
chinese academy of sciences
Scholars:
56.3W
Papers: 44.8W
Citations: 704
researcher View more organizations