主 题: More than perfect: ℏ-perfect graphs and their applications
报告人：许振朋
摘 要：A set of Pauli stings is well characterized by the graph that encodes its commutatitivity structure, i.e., by its frustration graph. This graph provides a natural interface between graph theory and quantum information, which we explore in this work. We investigate all aspects of this interface for a special class of graphs that bears tight connections between the groundstate structures of a spin systems and topological structure of a graph. We call this class ℏ-perfect, as it extends the class of perfect and h-perfect graphs. Having an ℏ-perfect graph opens up several applications: we find efficient schemes for entanglement detection, a connection to the complexity of shadow tomography, tight uncertainty relations and a construction for computing good lower on bounds ground state energies. Conversely this also induces quantum algorithms for computing the independence number. Albeit those algorithms do not immediately promise an advantage in runtime, we show that an approximate Hamilton encoding of the independence number can be achieved with an amount of qubits that typically scales logarithmically in the number of vertices. We also we also determine the behavior of ℏ-perfectness under basic graph operations and evaluate their prevalence among all graphs.
报告人简介：许振朋，安徽大学物理学院教授，博士毕业于南开大学陈省身数学研究所，之后在德国锡根大学从事博士后工作，获德国洪堡基金会支持。研究方向为量子力学基础问题和量子信息，专注于不同系统中量子关联的刻画与应用。迄今已在量子信息理论基础领域发表SCI论文四十余篇，其中第一／通讯作者（含共同）Physical Review Letters 5篇，Nature Communications、Science Advances各1篇。研究工作获2021年度奥地利科学院颁发的埃伦费斯特量子基础最佳论文奖，天津市自然科学一等奖。入选海外博后引才专项，安徽省百人计划。
报告时间：2026年7月7日上午9:30-11:00
报告地点：创新北楼414会议室
欢迎广大师生参加！
内蒙古大学数学科学学院
2026年7月3日
蒙ICP16002391号-1