时 间:14:00-15:00, Jun 29, 2026 (Mon)地 点:RM 1-222, FIT Building内容:We will discuss recent algorithmic advances for fundamental graph problems, including negative-weight shortest paths, maximum flow, and minimum-cost flow. Classical textbook-style algorithms, such as Bellman-Ford and push-relabel, often lead to \(O(mn)\)-type running times. In recent years, however, there has been trem...
时 间:10:30-12:00, Jun 12, 2026 (Fri)地 点:RM S327, MMW Building内容:Quantum networks promise transformative applications in secure communication, distributed quantum computing, sensing, and precision timekeeping. Realising real-world metropolitan-scale quantum networks requires compact, deployable systems capable of distributing entanglement over long distances beyond laboratory conditi...
时 间:10:00-11:00, Jun 12, 2026 (Fri)地 点:在线会议:https://meeting.tencent.com/dm/nDbunv9P6LYg内容:We introduce Cosmos 3, a family of omnimodal world models designed to jointly process and generate language, image, video, audio, and action sequences within a unified mixture-of-transformers architecture. By supporting highly flexible input-output configurations, Cosmos 3 seamlessly unif...
时 间:09:30-10:30, Jun 12, 2026 (Fri)地 点:RM S327, MMW Building内容:Trapped ions are a versatile platform for quantum simulation of spin models due to their good coherence properties, the possibility to induce variable-range spin-spin interactions as well as the ease of site-resolved single-particle control and readout. We make use of a modified design of a linear Paul trap, which allow...
时 间:10:30-11:30, Jun 11, 2026 (Thu)地 点:线上报告 (腾讯会议:963-955-107)内容:An attractive approach for stabilizing entangled many-body spin states is to employ engineered dissipation. Most existing proposals either target relatively simple collective spin states or require numerous independent and complex dissipative processes. Here, we show a surprisingly versatile scheme [1] for ma...
时 间:10:00-12:00, Jun 10, 2026 (Wed)地 点:RM S327, MMW Building内容:Quadratic Unconstrained Binary Optimization (QUBO) problems are prevalent in various applications and are known to be NP-hard. The seminal work of Goemans and Williamson introduced a semidefinite programming (SDP) relaxation for such problems, solvable in polynomial time that upper bounds the optimal value. Their approa...