Summary
Lorenzo Laneve is a PhD candidate in Quantum Computing at USI with nine years of experience spanning theoretical computer science, cryptography, and teaching at ETH Zürich. His research focuses on quantum algorithms and complexity, with strong interests in combinatorial optimization, randomized algorithms, and probabilistic methods that bridge theory and practical protocol design. He completed an MSc in Theoretical Computer Science at ETH Zürich and a summa cum laude BSc from Politecnico di Milano, and completed an industry-facing master’s thesis at IBM. Lorenzo has taught applied cryptography, algorithmic game theory, and quantum physics for non-physicists, reflecting an ability to explain deep technical ideas to diverse audiences. He combines formal mathematical rigor with programming-language sensibilities—evident from his GitHub focus on PLs and discrete math—making him adept at translating abstract results into implementable tools. Based in Lugano, he brings a rare mix of academic depth and applied experience aimed at advancing the theoretical foundations of quantum-era cryptography and algorithms.
9 years of coding experience
Laurea Triennale (Bachelor of Science), Computer Science and Engineering, 110 cum laude, Laurea Triennale (Bachelor of Science), Computer Science and Engineering, 110 cum laude at Politecnico di Milano
Computer Science MSc, Theoretical Computer Science, Computer Science MSc, Theoretical Computer Science at ETH Zürich
Doctor of Philosophy - PhD, Quantum Computing, Doctor of Philosophy - PhD, Quantum Computing at USI Università della Svizzera italiana