1 citations · 2 across the 6 of their papers we have counts for
6 papers
Causality in Pure Quantum Computation with Quantum Control
Kengo Hirata, Takeshi Tsukada
Indefinite causal order is a characteristic phenomenon in quantum computation, with examples including the quantum SWITCH and the OCB process. Not all such processes are believed t…
Programming with Quantum-Controlled Quantum Channels
Kengo Hirata, Takeshi Tsukada
In contrast to a classical bit, which can only take the value or , its quantum counterpart -- a qubit -- can exist in a superposition of and . This is a superposition…
Full Definability in a Profunctorial Model
Takeshi Tsukada, Kazuyuki Asada, Kengo Hirata
A semantic model enjoys full definability if every semantic element in the model is a denotation of some proof or program. Full definability indicates that the model captures progr…
Supermartingales for Unique Fixed Points: A Unified Approach to Lower Bound Verification
Satoshi Kura, Hiroshi Unno, Takeshi Tsukada
Many quantitative properties of probabilistic programs can be characterized as least fixed points, but verifying their lower bounds remains a challenging problem. We present a new…
A Primal-Dual Perspective on Program Verification Algorithms (Extended Version)
Takeshi Tsukada, Hiroshi Unno, Oded Padon +1
Many algorithms in verification and automated reasoning leverage some form of duality between proofs and refutations or counterexamples. In most cases, duality is only used as an i…
Enriched Presheaf Model of Quantum FPC
Takeshi Tsukada, Kazuyuki Asada
Selinger gave a superoperator model of a first-order quantum programming language and proved that it is fully definable and hence fully abstract. This paper proposes an extension o…