THE DAILY EDITION
CS & research
2 items · 2 articles in this topic
Two formal-methods results appeared. One is a quantum verification protocol, the other a Lean formalization of a landmark classification theorem.
- 1
A paper shows a protocol, relative to a classical oracle, that lets a classical verifier check quantum computation for a language beyond the polynomial hierarchy.
- 2
The classification of finite simple groups has been formalized in the Lean theorem prover.