134 citations · 254 across the 10 of their papers we have counts for
10 papers
Quantum Weakest Preconditions Revisited: Pre-expectations for Expected Runtime Analysis
Christina Gehnen, Dominique Unruh, Joost-Pieter Katoen
Quantum weakest preconditions are a fundamental tool for program verification of quantum programs. Many variations have been reported in the literature. We revisit quantum weakest…
Quantum references
Dominique Unruh
We present a theory of "quantum references", similar to lenses in classical functional programming, that allow to point to a subsystem of a larger quantum system, and to mutate/mea…
Local Variables and Quantum Relational Hoare Logic
Dominique Unruh
We add local variables to quantum relational Hoare logic (Unruh, POPL 2019). We derive reasoning rules for supporting local variables (including an improved "adversary rule"). We e…
Quantum Relational Hoare Logic with Expectations
Yangjia Li, Dominique Unruh
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 pa…
Quantum Hoare Logic with Ghost Variables
Dominique Unruh
Quantum Hoare logic allows us to reason about quantum programs. We present an extension of quantum Hoare logic that introduces "ghost variables" to extend the expressive power of p…
Quantum Relational Hoare Logic
Dominique Unruh
We present a logic for reasoning about pairs of interactive quantum programs - quantum relational Hoare logic (qRHL). This logic follows the spirit of probabilistic relational Hoar…
Quantum Attacks on Classical Proof Systems - The Hardness of Quantum Rewinding
Andris Ambainis, Ansis Rosmanis, Dominique Unruh
Quantum zero-knowledge proofs and quantum proofs of knowledge are inherently difficult to analyze because their security analysis uses rewinding. Certain cases of quantum rewinding…
An adaptive attack on Wiesner's quantum money
Aharon Brodutch, Daniel Nagaj, Or Sattath +1
Unlike classical money, which is hard to forge for practical reasons (e.g. producing paper with a certain property), quantum money is attractive because its security might be based…
Universally Composable Quantum Multi-Party Computation
Dominique Unruh
The Universal Composability model (UC) by Canetti (FOCS 2001) allows for secure composition of arbitrary protocols. We present a quantum version of the UC model which enjoys the sa…
Simulatable security for quantum protocols
Dominique Unruh
The notion of simulatable security (reactive simulatability, universal composability) is a powerful tool for allowing the modular design of cryptographic protocols (composition of…