234 citations · 235 across the 6 of their papers we have counts for
6 papers · 1 filter
Concrete Categorical Model of a Quantum Circuit Description Language with Measurement
Dongho Lee, Valentin Perrelle, Benoît Valiron +1
In this paper, we introduce dynamic lifting to a quantum circuit-description language, following the Proto-Quipper language approach. Dynamic lifting allows programs to transfer th…
Reasoning about Recursive Quantum Programs
Zhaowei Xu, Mingsheng Ying, Benoît Valiron
Most modern (classical) programming languages support recursion. Recursion has also been successfully applied to the design of several quantum algorithms and introduced in a couple…
A Logic for Recursive Quantum Programs
Zhaowei Xu, Mingsheng Ying, Shenggang Ying
Most modern (classical) programming languages support recursion. Recursion has also been successfully applied to the design of several quantum algorithms and introduced in a couple…
Completeness of Hoare Logic over Nonstandard Models
Zhaowei Xu, Yuefei Sui, Wenhui Zhang
The nonstandard approach to program semantics has successfully resolved the completeness problem of Floyd-Hoare logic. The known versions of nonstandard semantics, the Hungary sema…
On Completeness Results of Hoare Logic Relative to the Standard Model
Zhaowei Xu, Wenhui Zhang, Yuefei Sui
The general completeness problem of Hoare logic relative to the standard model of Peano arithmetic has been studied by Cook, and it allows for the use of arbitrary arithmetical…
A New Perspective for Hoare's Logic and Peano's Arithmetic
Zhaowei Xu
Hoare's logic is an axiomatic system of proving programs correct, which has been extended to be a separation logic to reason about mutable heap structure. We develop the most funda…