Article citationsMore>>

Gonthier, G., Asperti, A., Avigad, J., Bertot, Y., Cohen, C., Garillot, F., Roux, S.L., Mahboubi, A., O’Connor, R., Biha, S.O., et al. (2013) A Machine-Checked Proof of the Odd Order Theorem. Lecture Notes in Computer Science, 7998, 163-179.
http://dx.doi.org/10.1007/978-3-642-39634-2_14

has been cited by the following article:

• TITLE: Formal Verification of Robertson-Type Uncertainty Relation

  AUTHORS: Takaaki Masuhara, Toru Kuriyama, Masakazu Yoshida, Jun Cheng

  KEYWORDS: Formal Verification, Proof Assistant Coq, Uncertainty Relation

  JOURNAL NAME: Journal of Quantum Information Science, Vol.5 No.2, June 11, 2015

  ABSTRACT: Formal verification using interactive theorem provers have been noticed as a method of verification of proofs that are too big for humans to check the validity of them. The purpose of this work is to verify the validity of Robertson-type uncertainty relation toward verifying unconditional security of quantum key distributions. We verify the validity of the relation by using proof assistant Coq and it is turned out that the theorem regarding the relation formally holds. The source code for Coq which represents the validity of the theorem is printed in Appendix.