Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

162 Lean 4 Theorems for Post-Quantum Infrastructure: Three-Tier Formal Verification of QuantumTimeSandwich, QSSH, and QuantumHarmony

Sylvain Cormier

Published Feb 16, 2026• 0 citations
Publisher
DOI
10.5281/zenodo.18663124

Related papers

Interface-First Formal Verification for Hybrid Cryptography: Verified Scaffolding for QKD + Post-Quantum KEM Composition in Lean 4

Apoth3osis R&d, Richard Goodman

•Jan 1, 2026•0 citations

Formal Verification Techniques for Post-quantum Cryptography: A Systematic Review

Yuexi Xu, Zhenyuan Li, Naipeng Dong +3 more

Lecture notes in computer science•Sep 28, 2024•6 citations

Formal Verification of a Post-quantum Signal Protocol with Tamarin

Hugo Beguinet, Céline Chevalier, Thomas Ricosset +1 more

Lecture notes in computer science•Dec 18, 2023•6 citations

Lean-QIT: Towards a Formal Infrastructure for Quantum Information Theory

Chengkai Zhu, Ziao Tang, Guocheng Zhen +6 more

Quantum information theory (QIT) characterizes the capabilities and fundamental limits of quantum information processing, underpinning quantum communication, computation, and error correction. Formalizing its coding theorems requires connecting finite-block protocols, analytic inequalities, and asymptotic limits within a unified machine-checked framework. Existing developments, however, lack a reusable operational layer that defines codes, error criteria, achievable rates, and capacities independently of their information-theoretic characterizations. In this work, we present LeanQIT, a Lean 4 library for finite-dimensional QIT. It provides composable, kernel-checked interfaces for quantum states and channels, source and channel codes, finite-block performance criteria, hypothesis testing, one-shot quantities, and asymptotic rate constructions. Using this infrastructure, we formalize Schumacher's quantum source-coding theorem, the Holevo--Schumacher--Westmoreland classical-capacity theorem, and the entanglement-assisted classical-capacity theorem together with its strong converse. By separating operational definitions from analytic characterizations and exposing reusable achievability, converse, and asymptotic components, Lean-QIT provides a machine-readable foundation for formal QIT and a compositional knowledge substrate for emerging AI-assisted formalization, automated proof search, and agentic reasoning in quantum information and computation.

quant-pharXiv:2607.09632•Jul 13, 2026•10 citations

Comprehensive Review of Quantum Complexity Theory Classes in Formal Verification

Mahmoud Naderi, Muhammad Naveed Zafar, Marko Pezer +1 more

Lecture notes on data engineering and communications technologies•Jan 1, 2026•0 citations

Formalization of Ternary Quantum Systems in Lean4

Xudong Wang, Zhiping Shi, Shanyan Chen +4 more

•Jan 1, 2026•0 citations
Quantum information theory (QIT) characterizes the capabilities and fundamental limits of quantum information processing, underpinning quantum communication, computation, and error correction. Formalizing its coding theorems requires connecting finite-block protocols, analytic inequalities, and asymptotic limits within a unified machine-checked framework. Existing developments, however, lack a reusable operational layer that defines codes, error criteria, achievable rates, and capacities independently of their information-theoretic characterizations. In this work, we present LeanQIT, a Lean 4 library for finite-dimensional QIT. It provides composable, kernel-checked interfaces for quantum states and channels, source and channel codes, finite-block performance criteria, hypothesis testing, one-shot quantities, and asymptotic rate constructions. Using this infrastructure, we formalize Schumacher's quantum source-coding theorem, the Holevo--Schumacher--Westmoreland classical-capacity theorem, and the entanglement-assisted classical-capacity theorem together with its strong converse. By separating operational definitions from analytic characterizations and exposing reusable achievability, converse, and asymptotic components, Lean-QIT provides a machine-readable foundation for formal QIT and a compositional knowledge substrate for emerging AI-assisted formalization, automated proof search, and agentic reasoning in quantum information and computation.