1 citations · 1 across the 3 of their papers we have counts for
5 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…
RapunSL: Untangling Quantum Computing with Separation, Linear Combination and Mixing
Yusuke Matsushita, Kengo Hirata, Ryo Wakizaka +1
Quantum Separation Logic (QSL) has been proposed as an effective tool to improve the scalability of deductive reasoning for quantum programs. In QSL, separation is interpreted as d…
Qurts: Automatic Quantum Uncomputation by Affine Types with Lifetime
Kengo Hirata, Chris Heunen
Uncomputation is a feature in quantum programming that allows the programmer to discard a value without losing quantum information, and that allows the compiler to reuse resources.…