activity
20242026
most citedAutomating Equational Proofs in Dirac Notation

4 citations · 4 across the 10 of their papers we have counts for

collaborators

11 papers

hep-th2026

Dynamical Tidal Response and Love Numbers of Massless Bosonic and Fermionic Perturbations of Kerr--Anti-de Sitter Black Holes

Himanshu Buragohain, Prabwal Phukon

We examine the tidal response of Kerr--Anti-de Sitter black holes using the Teukolsky formalism in a vacuum background. We consider massless perturbations with spin weights $s = 0,…

cs.PL2026

Quantum Uncomputation of Clean and Dirty Ancilla Qubits

Chenke Liu, Li Zhou, Boning Meng

Automatic uncomputation aims to provide programming-language-level support to facilitate the correct and safe use of ancilla qubits in quantum computing, but efforts have only been…

cs.LO2026

Reasoning about Continuous-Variable Quantum Systems

Tianshi Yu, Gilles Barthe, Minbo Gao +2

Continuous-variable quantum computing (CVQC) is a computing paradigm in which measurements yield values over a continuous domain. CVQC is both a convenient computational framework…

cs.CR2026

CrypFormBench: Benchmarking Formal Analysis Capability of Large Language Models for Cryptographic Schemes

Zhaoxuan Li, Qionglu Zhang, Hengyuan Liu +8

Manual formal analysis of cryptographic schemes is labor-intensive and requires substantial expertise. While model-checking tools (e.g., Scyther and Tamarin) and computational-secu…

cs.AI2026

CAM-Bench: A Benchmark for Computational and Applied Mathematics in Lean

Wentao Long, Yunfei Zhang, Chenyi Li +3

Formal theorem-proving benchmarks enable mechanically verifiable evaluation of mathematical reasoning in large language models. However, existing benchmarks mainly focus on Olympia…

quant-ph2026

A Compilation Framework for Quantum Simulation of Non-unitary Dynamics

Qifan Huang, Minbo Gao, Li Zhou +1

Most quantum compilers assume programs are reversible unitary circuits. This fits closed-system algorithms, but not open-system simulation, where the natural program objects are qu…

quant-ph2025

Complete Relational Logic for Infinite-Dimensional Quantum Programs with Unbounded Assertions

Gilles Barthe, Minbo Gao, Jam Kabeer Ali Khan +7

We present sound and complete relational program logics for infinite-dimensional quantum and classical-quantum programs. The logics model assertions as self-adjoint unbounded linea…

cs.PL2025

D-Hammer: Efficient Equational Reasoning for Labelled Dirac Notation

Yingte Xu, Li Zhou, Gilles Barthe

Labelled Dirac notation is a formalism commonly used by physicists to represent many-body quantum systems and by computer scientists to assert properties of quantum programs. It is…

cs.LO2025

Complete Quantum Relational Hoare Logics from Optimal Transport Duality

Gilles Barthe, Minbo Gao, Theo Wang +1

We introduce a quantitative relational Hoare logic for quantum programs. Assertions of the logic range over a new infinitary extension of positive semidefinite operators. We prove…

cs.PL2024

Laws of Quantum Programming

Mingsheng Ying, Li Zhou, Gilles Barthe

In this paper, we investigate the fundamental laws of quantum programming. We extend a comprehensive set of Hoare et al.'s basic laws of classical programming to the quantum settin…

cs.PL2024★ 4 cited

Automating Equational Proofs in Dirac Notation

Yingte Xu, Gilles Barthe, Li Zhou

Dirac notation is widely used in quantum physics and quantum programming languages to define, compute and reason about quantum states. This paper considers Dirac notation from the…