Institution profile

Ecole Normale Supérieure de Lyon

Academic institutioneurope · fr
Official website
Research library175linked papers
Opportunities0open roles
Selected work

Representative Papers

Explorable Parity Automata

Oct 30, 2024arXiv.org

This paper addresses the problem of nondeterminism resolution over both finite and infinite words, generalizing history-deterministic (HD) automata. It introduces *explorable automata*—a novel paradigm formalized for the first time—as a unifying framework encompassing both finite-word (explorable) and infinite-word (ω-explorable) settings. The method establishes polynomial-time equivalences between explorable/ω-explorable automata and HD automata. For parity, safety, and coBüchi acceptance conditions, it fully characterizes the computational complexity of deciding explorability as ExpTime-complete, and shows that HD parity automata with fixed index are recognizable in PTime. Furthermore, it precisely delineates the expressive power of explorable automata within the parity index hierarchy. Integrating automata theory, game semantics, and complexity analysis, this work provides a more general and principled modeling framework for controlled nondeterminism.

2 citationsRead paper

Adversarial quantum channel discrimination

Jun 03, 2025

This work addresses quantum channel discrimination under adversarial conditions: a tester must distinguish between two quantum channels while an adversary has full access to the environment, possesses quantum memory, and may launch adaptive attacks. To tackle this, we introduce the *minimum output channel divergence*, a novel operational measure, and establish the first adversarial extension of the quantum Stein lemma. We prove its strong converse property and generalize the entropy accumulation theorem to divergence analysis over arbitrary channel sequences. Leveraging new chain rules based on measured relative entropy and sandwiched relative entropy, together with constructions of non-adaptive strategies and an efficient algorithm for regularized divergence, we exactly characterize the optimal type-II error exponent in asymmetric hypothesis testing. Remarkably, this exponent is achievable by simple non-adaptive strategies—ensuring computational tractability, universality of the strong converse, and practical feasibility.

1 citationsRead paper

Delooping generated groups in homotopy type theory

May 06, 2024International Conference on Formal Structures for Computation and Deduction

This paper addresses the redundancy and computational intractability of delooping constructions for groups in homotopy type theory. We propose a streamlined internalization method based on generating sets. Our approach abandons reliance on the full group structure and instead defines G-torsors solely from generators, thereby circumventing higher inductive types. Crucially, we abstract the Cayley graph idea into a novel “Cayley group” construction—yielding a substantially compressed delooping type. All definitions and key theorems—including the equivalence of the delooping and the classification of torsors—are fully formalized and verified in Cubical Agda. The resulting framework achieves both theoretical rigor and computational feasibility, offering a lightweight, scalable paradigm for internalizing algebraic structures in type theory.

1 citationsRead paper
Recent publications

Latest Papers

Ramsey Obstructions to Disambiguation

Sep 14, 2026

本文通过构造特定部分矩阵，解决线性分类器的消歧问题，并利用Ramsey理论证明了无论怎样消歧都会包含所有指定大小的二进制矩阵。

0 citationsRead paper