首都师范大学学报（自然科学版）2025，Vol.46Issue(6)：26-33,8.DOI:10.19789/j.1004-9398.2025.06.004
最小联合Tsallis信息熵问题算法研究
An algorithm for minimum Tsallis entropy coupling
摘要
Abstract
In the field of information theory,seeking the minimum entropy coupling of two random variables is an important open problem.This paper explores the minimum Tsallis entropy coupling problem and its theoretical properties for the first time.It provides counterexamples to demonstrate that the approximate algorithms for Shannon entropy cannot be extended to Tsallis entropy in quantum entangled systems.To tackle this problem,an innovative greedy algorithm based on supply-demand matching is proposed.Majorization theory is leveraged to prove that the proposed algorithm can control the approximation error in solving the minimum Tsallis entropy coupling problem across all systems.关键词
最小联合信息熵/Tsallis熵/贪心算法/受控理论Key words
minimum entropy coupling/Tsallis entropy/greedy algorithm/majorization theory分类
数理科学引用本文复制引用
SUN Qingyang,HU Haiyang,LAN Zongyu,WANG Yingzhe..最小联合Tsallis信息熵问题算法研究[J].首都师范大学学报（自然科学版）,2025,46(6):26-33,8.基金项目
国家重点研发计划项目(2020YFA0712900) （2020YFA0712900）
国家自然科学基金项目(11871103) （11871103）
国家级大学生创新创业项目(202210027020) （202210027020）
