Jad Issa is a doctoral researcher at CEA Paris-Saclay specializing in formal verification of quantum and hybrid programs, with nine years of experience bridging mathematics and computer science. His work combines deep foundations—type theory, category theory, proof theory—and hands-on formalization using proof assistants to make quantum computing verifiable and reliable. He has applied path-sum semantics to quantum error correction during an internship at CEA-List and now pursues a PhD that connects theoretical logic with practical quantum program assurance. Educated across top French and Lebanese institutions with strong academic results in both math and CS, Jad brings a rare dual fluency in rigorous proofs and applied verification workflows.
9 years of coding experience
Bachelor of Science - BS, Mathematics, 86.24/100, Bachelor of Science - BS, Mathematics, 86.24/100 at Lebanese University - Faculty of Sciences
Master's degree, Mathematics and Computer Science, Master's degree, Mathematics and Computer Science at Univ Paris Diderot
Master's degree, Mathematics, Master's degree, Mathematics at Université Paris-Saclay
Engineer's degree, Engineering, 92.52/100, Engineer's degree, Engineering, 92.52/100 at Lebanese University - Faculty of Engineering II
High School Diploma, General Sciences, 17.5/20, High School Diploma, General Sciences, 17.5/20 at Carmelites - Fanar
Bachelor of Science - BS, Computer Science, GPA 4.14, Bachelor of Science - BS, Computer Science, GPA 4.14 at American University of Beirut
Find and Hire Top DevelopersWe’ve analyzed the programming source code of over 60 million software developers on GitHub and scored them by 50,000 skills. Sign-up on Prog,AI to search for software developers.