Effect of quantum fluctuations on the coloring of random graphs

被引:1
作者
Bapst, Victor [1 ]
Semerjian, Guilhem
Zamponi, Francesco
机构
[1] CNRS, Unite Mixte Rech UMR 8549, LPTENS, F-75231 Paris 05, France
来源
PHYSICAL REVIEW A | 2013年 / 87卷 / 04期
关键词
SPIN-GLASS MODEL; GIBBS-STATES; POTTS GLASS; TRANSITION; COMPLEXITY; MECHANICS; ENTROPY;
D O I
10.1103/PhysRevA.87.042322
中图分类号
O43 [光学];
学科分类号
070207 ; 0803 ;
摘要
We present a study of the coloring problem (antiferromagnetic Potts model) of random regular graphs, submitted to quantum fluctuations induced by a transverse field, using the quantum cavity method and quantum Monte Carlo simulations. We determine the order of the quantum phase transition encountered at low temperature as a function of the transverse field and discuss the structure of the quantum spin-glass phase. In particular, we conclude that the quantum adiabatic algorithm would fail to solve efficiently typical instances of these problems because of avoided level crossings within the quantum spin-glass phase, caused by a competition between energetic and entropic effects. DOI: 10.1103/PhysRevA.87.042322
引用
收藏
页数:23
相关论文
共 50 条
  • [41] Parasupersymmetry in quantum graphs
    Ohya, Satoshi
    [J]. ANNALS OF PHYSICS, 2013, 331 : 299 - 312
  • [42] Quantum fluctuations as deviation from classical dynamics of ensemble of trajectories parameterized by unbiased hidden random variable
    Budiyono, Agung
    [J]. PHYSICA A-STATISTICAL MECHANICS AND ITS APPLICATIONS, 2012, 391 (11) : 3102 - 3118
  • [43] Quantum fluctuations from thermal fluctuations in Jacobson formalism
    Faizal, Mir
    Ashour, Amani
    Alcheikh, Mohammad
    Alasfar, Lina
    Alsaleh, Salwa
    Mahroussah, Ahmed
    [J]. EUROPEAN PHYSICAL JOURNAL C, 2017, 77 (09):
  • [44] Clique Clustering Yields a PTAS for Max-Coloring Interval Graphs
    Nonner, Tim
    [J]. ALGORITHMICA, 2018, 80 (10) : 2941 - 2956
  • [45] Coloring Graphs Using Two Colors While Avoiding Monochromatic Cycles
    Nobibon, Fabrice Talla
    Hurkens, Cor A. J.
    Leus, Roel
    Spieksma, Frits C. R.
    [J]. INFORMS JOURNAL ON COMPUTING, 2012, 24 (03) : 485 - 499
  • [46] Coloring clique-hypergraphs of graphs with no subdivision of K5
    Shan, Erfang
    Kang, Liying
    [J]. THEORETICAL COMPUTER SCIENCE, 2015, 592 : 166 - 175
  • [47] Restricted coloring problems on Graphs with few P4's
    Linhares-Sales, Claudia
    Maia, Ana Karolinna
    Martins, Nicolas
    Sampaio, Rudini M.
    [J]. ANNALS OF OPERATIONS RESEARCH, 2014, 217 (01) : 385 - 397
  • [48] Clique-transversal sets and clique-coloring in planar graphs
    Shan, Erfang
    Liang, Zuosong
    Kang, Liying
    [J]. EUROPEAN JOURNAL OF COMBINATORICS, 2014, 36 : 367 - 376
  • [49] A linear-time algorithm for clique-coloring planar graphs
    Liang, Zuosong
    Shan, Erfang
    Xing, Huiyu
    Bai, Chunsong
    [J]. OPERATIONS RESEARCH LETTERS, 2019, 47 (04) : 241 - 243
  • [50] Exact Algorithms for Weighted Coloring in Special Classes of Tree and Cactus Graphs
    Benkoczi, Robert
    Dahal, Ram
    Gaur, Daya Ram
    [J]. Combinatorial Algorithms, 2016, 9843 : 347 - 358