We present a variant of the quantum relational Hoare logic from (Unruh, POPL 2019) that allows us to use "expectations" in pre- and postconditions. That is, when reasoning about pairs of programs, our logic allows us to quantitatively reason about how much certain pre-/postconditions are satisfied that refer to the relationship between the programs inputs/outputs
We know that quantum logics are the most prominent logical systems associated to the lattices of clo...
Early in the development of Hoare logic, Owicki and Gries introduced auxiliary variables as a way of...
© 2018, British Computer Society. This paper summarises the results obtained by the author and his c...
Hoare logic provides a syntax-oriented method to reason about program correctness and has been prove...
AbstractA logic for reasoning about states of basic quantum imperative programs is presented. The mo...
Abstract. This paper provides a Hoare-style logic for quantum compu-tation. While the usual Hoare lo...
Verifying the functional correctness of programs with both classical and quantum constructs is a cha...
© The Author(s) 2019. We formalize the theory of quantum Hoare logic (QHL) [TOPLAS 33(6),19], an ext...
Quantum Hoare Logic (QHL) was introduced in Ying's work to specify and reason about quantum programs...
Thanks to the rapid progress and growing complexity of quantum algorithms, correctness of quantum pr...
AbstractWe apply the notion of quantum predicate proposed by D’Hondt and Panangaden to analyze a sim...
We apply the notion of quantum predicate proposed by D’Hondt and Panangaden to analyze a simple lang...
We present a computer-verified formalization of the post-quantum security proof of the Fujisaki-Okam...
Quantum computation theory has inspired new forms of quantum logic, called quantum computational log...
Quantum computation and quantum computational logics give rise to some non-standard probability spac...
We know that quantum logics are the most prominent logical systems associated to the lattices of clo...
Early in the development of Hoare logic, Owicki and Gries introduced auxiliary variables as a way of...
© 2018, British Computer Society. This paper summarises the results obtained by the author and his c...
Hoare logic provides a syntax-oriented method to reason about program correctness and has been prove...
AbstractA logic for reasoning about states of basic quantum imperative programs is presented. The mo...
Abstract. This paper provides a Hoare-style logic for quantum compu-tation. While the usual Hoare lo...
Verifying the functional correctness of programs with both classical and quantum constructs is a cha...
© The Author(s) 2019. We formalize the theory of quantum Hoare logic (QHL) [TOPLAS 33(6),19], an ext...
Quantum Hoare Logic (QHL) was introduced in Ying's work to specify and reason about quantum programs...
Thanks to the rapid progress and growing complexity of quantum algorithms, correctness of quantum pr...
AbstractWe apply the notion of quantum predicate proposed by D’Hondt and Panangaden to analyze a sim...
We apply the notion of quantum predicate proposed by D’Hondt and Panangaden to analyze a simple lang...
We present a computer-verified formalization of the post-quantum security proof of the Fujisaki-Okam...
Quantum computation theory has inspired new forms of quantum logic, called quantum computational log...
Quantum computation and quantum computational logics give rise to some non-standard probability spac...
We know that quantum logics are the most prominent logical systems associated to the lattices of clo...
Early in the development of Hoare logic, Owicki and Gries introduced auxiliary variables as a way of...
© 2018, British Computer Society. This paper summarises the results obtained by the author and his c...