Seminar: Computations with Weyl Algebra

Thời gian: 10:00 đến 11:00 Ngày 19/05/2026

Địa điểm: Phòng C101, VIASM

Báo cáo viên: Prof. Yvo G. Desmedt, The University of Texas at Dallas, USA

Tóm tắt: A classical computer uses Boolean circuits and can only operate on one input at a time. Quantum computers compute on a superposition of states, but need a measurement to extract the result. In this presentation we propose the use of Weyl Algebra to perform computations on N inputs at once. We also need a generalization of a "measurement" to obtain a useful result. Although this new type of computation is inspired by quantum computers, we do not need to follow the laws of quantum physics. We look at the computational complexity of certain computation when using this new approach. In particular at (i) the potential impact on porting Shor's quantum algorithm to a classical computer while maintaining polynomial running time, and (ii) whether co-NP=P, which would imply NP=P.