期刊信息

  • 刊名: 河北师范大学学报(自然科学版)Journal of Hebei Normal University (Natural Science)
  • 主办: 河北师范大学
  • ISSN: 1000-5854
  • CN: 13-1061/N
  • 中国科技核心期刊
  • 中国期刊方阵入选期刊
  • 中国高校优秀科技期刊
  • 华北优秀期刊
  • 河北省优秀科技期刊

图的量子参数——图论在量子信息理论中的一个应用

  • (清华大学 数学科学系,北京 100084)
  • DOI: 10.13763/j.cnki.jhebnu.nse.202301014

Quantum Parameters of Graphs —An Application of Graph Theory in Quantum Information Theory

摘要/Abstract

摘要:

本世纪以来,图论在量子通信中有一系列重要应用. 介绍了图论在量子信息理论中的一个重要应用:图的量子同态和量子参数(量子色数,量子独立数和量子团数). 综述了该领域的基本结果和待研究的问题.

Abstract:

From the beginning of this century,graph theory has a series of applications in quantum communication. This paper introduces one of applications of graph theory in quantum information theory:quantum homomorphism of graphs and quantum parameters of graphs(quantum chromatic number,quantum independence number and quantum clique number). The paper surveys fundamental results and open problems in this research field.

参考文献 12

  • [1] ELPHICK C,WOCJAN P.Spectral Lower Bounds for the Quantum Chromatic Number of a Graph[J].J Comb Theory A,2019,168:338-347.
  • [2] de LIMA L S,OLIVEIRA C S,DE ABREU N M M,et al.The Smallest Eigenvalue of the Signless Laplacian[J].Linear Alg and its Appli,2011,435:2570-2584.
  • [3] WOCJAN P,ELPHICK C.An Inertial Upper Bound for the Quantum Independence Number of a Graph[J].arXiv:1808.10820.
  • [4] AVIS D,HASEGAWA J,KIKUCHI Y,et al.A Quantum Protocol to Win the Graph Coloring Game on all Hadamard Graphs[J].IECET Fund Electr,2006,89 (5):1378-1381.
  • [5] GODSIL C D,NEWMAN M W N.Coloring an Orthogonality Graph[J].SIAM J Discrete Math,2008,22(2):683-692.
  • [6] GAO L,GRIBLING S,LI Y N.On a Tracial Version of Haemer Bound[J].IEEE Trans information Theory,2022,68(10):6585-6606.
  • [7] MANCINSKA L,ROBERSON D E.Quantum Homomorphisms[J].J Comb Theory B,2016,118:226-267.
  • [8] WOCIAN P,ELPHICK C,ABIAD A.Spectral Upper Bound on the Quantum k-independence Number of a Graph[J].Electron J linear Algebra,2002,38:331-338.
  • [9] FRANKL P,RODL V.Forbidden Intersections[J].Trans Amer Math Soc,1987,300:259-286.
  • [10] BEIGI S.Entanglement-assisted Zero-error Capacity is Upper Bound by the Lovasz Theta Function[J].Phys Rev A 2010,82:010303
  • [11] DUAN R,SEVERINI S,WINTER A.Zero-error Communication via Quantum Channels,Non-Commutative Graphs and a Quantum Lovasz Theta Function [J].IEEE Trans Information Theory,2013,59(12):1164-1174.
  • [12] CAMERON P J,MONTANARO A,NEWMAN N W,et al.On the Quantum Chromatic Number of a Graph[J].Electronic Jour of Combinatorics,2007,14 (1):paper81,15pages.