| Time | Mar. 25, 2022, 10:00 am (Taipei Time) |
| Speaker | Chen Yanlin |
| Title | Improved Classical and Quantum Algorithms for the Shortest Vector Problem via Bounded Distance Decoding |
| Abstract | see reference |
| Reference | https://arxiv.org/pdf/2002.07955.pdf |
| Personal information | Yanlin Chen is now a Ph.D. student in QuSoft, and he is supervised by Prof. Ronald de Wolf and Prof. Maris Ozols. His current research interest is quantum algorithms for convex optimization problems. He was a research assistant in Prof. Kai-Min’s group from 2016 to 2020, and he was interested in developing quantum algorithms for the lattice problem. He also went to the centre for quantum technologies in Singapore as a visitor and worked with Prof. Divesh Aggarwal on the project on the shortest vector problem. |
| Video | https://youtu.be/b_SB0Wzc6NY |
