arXiv subjects

Kengo Hirata

Publications and source records attributed to Kengo Hirata.

7 recordsLinked to original sources

arXiv2026

Programming with Quantum-Controlled Quantum Channels

In contrast to a classical bit, which can only take the value $0$ or $1$, its quantum counterpart -- a qubit -- can exist in a superposition of $0$ and $1$. This is a superposition of data values, naturally raising the question of whether one can superpose not only data but also programs. For example, a particular superposition of programs, known as the quantum SWITCH, has attracted much attention, and its implementations and computational advantages have been studied extensively within the physics community. A naive way to control a program by a qubit is by means of a controlled operation. Given an operation $F$, this amounts to considering an operation that behaves as $F$ when the control qubit is $|1\rangle$, and as the identity operation when the control qubit is $|0\rangle$. This idea works well when $F$ is a unitary operation, but it is not well-defined for a general quantum channel. By contrast, the quantum SWITCH is free from the well-definedness issue. This contrast leads to the key insight of this paper: controlled operations and the quantum SWITCH should be regarded as different kinds of quantum control mechanisms. Building on this insight, we develop a novel quantum programming language with quantum control and measurement that can express the quantum SWITCH over quantum channels. Using a semantic analysis based on program transformations, we identify the source of the ill-behavedness of controlled operations as the \emph{correspondence problem}: a lack of coordination between the measurements performed in the then- and else-branches of quantum conditional branching. We address this problem with a linear type system that enforces alignment of the quantum operations used in the two branches, yielding a well-behaved language capable of expressing the quantum SWITCH.

cs.PL↗

arXiv2026

Causality in Pure Quantum Computation with Quantum Control

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 to be physically realizable: while some implementations of the quantum SWITCH have been proposed, the OCB process is suspected to be unrealizable. This difference in realizability is commonly attributed to constraints imposed by physical causality. This paper studies such a causality issue in a higher-order setting, proposing a typed lambda calculus with quantum control and its categorical semantics. Our calculus extends pure quantum computation with higher-order functions and quantum conditional branching, and it is equipped with a type system based on intuitionistic BV logic to enforce causality. We also present a novel model that is closely related to the Caus construction, by which we prove that some physically-unrealizable processes are not definable in our language.

cs.PL↗

arXiv2026

Full Definability in a Profunctorial Model

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 programs and proofs in a highly detailed manner. This paper studies full definability in a model based on the (bi)category of profunctors on groupoids, which is a proof-relevant variant of the relational model. Despite the fact that a profunctor is far more complicated than a relation, we show that a rather straightforward application of the ideas for the relational model, together with the notion of stability in profunctors, provides a complete characterisation of definable profunctors. More precisely, all logical families of stable and total profunctors are definable by proof-nets of multiplicative linear logic with MIX. As a part of the full definability proof, we show that the stability serves as a correctness criterion, which we think is of independent interest.

cs.LO↗

arXiv2025

RapunSL: Untangling Quantum Computing with Separation, Linear Combination and Mixing

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 disentanglement, and the frame rule brings a notion of entanglement-local specification (one that only talks about the qubits entangled with those acted upon by the program). In this paper, we identify two notions of locality unique to the quantum domain, and we construct a novel quantum separation logic, RapunSL, which is able to soundly reduce reasoning about superposition states to reasoning about pure states (basis-locality), and reasoning about mixed states arising from measurement to reasoning about pure states (outcome-locality). To do so, we introduce two connectives, linear combination and mixing, which together with separation provide a dramatic improvement in the scalability of reasoning, as we demonstrate on a series of challenging case studies.

cs.PL↗

arXiv2024

Qurts: Automatic Quantum Uncomputation by Affine Types with Lifetime

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. Whereas quantum information has to be treated linearly by the type system, automatic uncomputation enables the programmer to treat it affinely to some extent. Automatic uncomputation requires a substructural type system between linear and affine, a subtlety that has only been captured by existing languages in an ad hoc way. We extend the Rust type system to the quantum setting to give a uniform framework for automatic uncomputation called Qurts (pronounced quartz). Specifically, we parameterise types by lifetimes, permitting them to be affine during their lifetime, while being restricted to linear use outside their lifetime. We also provide two operational semantics: one based on classical simulation, and one that does not depend on any specific uncomputation strategy.

cs.PL↗

arXiv2024

Generalization of formal monad theory to lax functors

We study lax functors between bicategories as a generalized concept of monads and describe generalized notions and theorems of formal monad theory for lax functors. Our first approach is to use the 2-monad whose lax algebras are lax functors. We define lax doctrinal adjunctions for a 2-monad $T$ on a 2-category $\mathcal{K}$, and we show that if $\mathcal{K}$ admits and $T$ preserves certain codescent objects, the 2-category $\mathrm{Lax}\text{-}{T}\text{-}\mathrm{Alg}_{c}$ of lax algebras and colax morphisms can coreflectively be embedded in the 2-category of lax doctrinal adjunctions. This coreflective embedding generalizes the relation between monads and adjunctions. Our second approach is to see a distributive law for monads as a 2-functor from a lax Gray tensor product, and we show a generalized form of Beck's characterization of distributive laws.

math.CT↗

arXiv2022

Notes on Lax Ends

In enriched category theory, the notion of extranatural transformations is more fundamental than that of ordinary natural transformations, and the ends, the universal extranatural transformations, play a critical role. On the other hand, 2-category theory makes use of several other natural transformations, such as lax and pseudo transformations. For these weak transformations, it is known that we can define the corresponding extranatural transformations or ends. However, there is little literature describing such results in detail. We provide a detailed calculation of the lax end, including its relation to the lax limits. We prove the bicategorical coYoneda lemma as the dual of the bicategorical Yoneda lemma, and also show that the weight of any lax end is a PIE weight, but it might not be a weight for a lax limit.

math.CT↗