FILE 01 / 05 · § SELF ARCHIVE NO. 001

Yingte Xu许英特

PhD candidate · MPI-SP / Ruhr University Bochum

lucianoxu@foxmail.com · github · Chinese (native) / English / Japanese (N1)

§ Self

Yingte's research applies formal methods to study the programming theory for quantum computing — semantics, verification techniques, proof automation. The aim is a practical, end-to-end toolchain (from verification to compilation) that can naturally express most quantum algorithms and protocols.

He is also drawn to ML / AI research, especially language and multimodal models. He believes persona AI agents on edge devices will become prominent, demanding new architectures, training methods, and evaluation metrics, and is working toward this field.

He is fascinated by the design of systems — from formal reasoning and intelligent agents to creative worlds and human imagination — and excited by tangible work that explores novel ideas and creative expression. People consider him an amateur artist.

Born 1999-10-23 · Suzhou, Jiangsu · P.R. China

§ Education & Employment

Max Planck Institute for Security and Privacy (MPI-SP) 2024 — now

Research Assistant

Ruhr University Bochum 2024 — now

PhD Student

The COVID pandemic and visa issues kept Yingte in Beijing for two years.

Max Planck Institute for Security and Privacy (MPI-SP) 2023 — 2024

Remote Internship

State Key Laboratory of Computer Science, Institute of Software, Chinese Academy of Sciences 2022 — 2023

Internship

Lanzhou University 2018 — 2022

Bachelor of Science (Physics)

Suzhou High School 2015 — 2018

§ Publications

[LICS '26 (Accepted)] Complete Relational Logic for Infinite-Dimensional Quantum Programs with Unbounded Assertions

Gilles Barthe, Minbo Gao, Jam Kabeer Ali Khan, Matthijs Muis, Ivan Renison, Keiya Sakabe, Michael Walter, Yingte Xu, Tianshi Yu, Li Zhou

[CAV '25] D-Hammer: Efficient Equational Reasoning for Labelled Dirac Notation

Yingte Xu, Li Zhou, and Gilles Barthe

[POPL '25] Automating Equational Proofs in Dirac Notation

Yingte Xu, Gilles Barthe, and Li Zhou

[TOSEM '25] Refinement Calculus of Quantum Programs with Projective Assertions

Yuan Feng, Li Zhou, Yingte Xu, and Xiaoquan Xu

[ASPLOS '23] Verification of Nondeterministic Quantum Programs

Yuan Feng and Yingte Xu

§ Awards

Winner of CHES 2025 Deep Learning SCA Battle 2025

CHES 2025, GE Wars Organization Committee

National Scholarship 2019

Ministry of Education of the People's Republic of China

§ Projects

Fanal 2025-2026

A Lean project for building a practical tool that encodes and verifies quantum programs. Full concrete syntax with support for quantum arrays. An auto-formalization pipeline was experimented. The project website is equipped with an AI chatbot assistant.

D-Hammer 2025

A C++ tool that efficiently decides equations of labelled Dirac notations.

DiracDec 2024-2025

A prototype for proof automation of Dirac notation equations. Implemented in Mathematica, integrated with its computer algebra system for reals.

EquationNN 2025

An attempt to solve hard equational reasoning problems using LLM + Reinforcement Learning.

QRefine 2024

A prototype IDE for quantum program development with program refinement support, implemented in Python.

NQPV 2023

Artifact for verification of nondeterministic quantum programs.