【校级报告】More than perfect: ℏ-perfect graphs and their applications
发布日期:2025-12-16   作者:李泽云   浏览次数:10

报告题目:More than perfect: ℏ-perfect graphs and their applications

报告人:许振朋 教授

报告人单位:安徽大学

主持人:吴典 研究员

地点:光学大楼B325会议室

时间:2025年12月18日(周四)14:00

报告内容:

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.

参考文献:

[1] PRX Quantum 5, 020318, 2024

[2] arXiv: 2511.13531

报告人简介:

许振朋教授现就职于安徽大学,毕业于南开大学陈省身数学研究所,毕业后在德国锡根大学从事博士后工作,期间获德国洪堡基金会支持。研究方向为量子力学基础问题和量子信息,专注于不同系统中的量子关联。迄今已在量子信息理论基础领域发表SCI 论文四十余篇,含Physical Review Letters 8 篇(第一/通讯作者 4 篇),Nature CommunicationsScience AdvancesPRX Quantum 1 篇。基于以往工作,申请人荣获2021年度奥地利科学院颁发的埃伦费斯特量子基础最佳论文奖。