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 条
  • [21] List coloring of random and pseudo-random graphs
    Alon, N
    Krivelevich, M
    Sudakov, B
    COMBINATORICA, 1999, 19 (04) : 453 - 472
  • [22] Subgraph fluctuations in random graphs
    Fretter, Christoph
    Mueller-Hannemann, Matthias
    Huett, Marc-Thorsten
    PHYSICAL REVIEW E, 2012, 85 (05):
  • [23] Algorithms for coloring semi-random graphs
    Subramanian, CR
    Furer, M
    Madhavan, CEV
    RANDOM STRUCTURES & ALGORITHMS, 1998, 13 (02) : 125 - 158
  • [24] FAST PARALLEL ALGORITHMS FOR COLORING RANDOM GRAPHS
    KEDEM, ZM
    PALEM, KV
    PANTZIOU, GE
    SPIRAKIS, PG
    ZAROLIAGIS, CD
    LECTURE NOTES IN COMPUTER SCIENCE, 1992, 570 : 135 - 147
  • [25] COLORING RANDOM INTERSECTION GRAPHS AND COMPLEX NETWORKS
    Behrisch, Michael
    Taraz, Anusch
    Ueckerdt, Michael
    SIAM JOURNAL ON DISCRETE MATHEMATICS, 2009, 23 (01) : 288 - 299
  • [26] Coloring random graphs and maximizing local diversity
    Bounkong, S.
    van Mourik, J.
    Saad, D.
    PHYSICAL REVIEW E, 2006, 74 (05):
  • [27] On-line coloring of sparse random graphs and random trees
    Pittel, B
    Weishaar, RS
    JOURNAL OF ALGORITHMS, 1997, 23 (01) : 195 - 205
  • [28] Spectral Fluctuations of Quantum Graphs
    Pluhar, Z.
    Weidenmueller, H. A.
    FOURTH CONFERENCE ON NUCLEI AND MESOSCOPIC PHYSICS 2014, 2014, 1619
  • [29] RANDOM QUANTUM GRAPHS
    Chirvasitu, Alexandru
    Wasilewski, Mateusz
    TRANSACTIONS OF THE AMERICAN MATHEMATICAL SOCIETY, 2022, 375 (05) : 3061 - 3087
  • [30] COLORING RANDOM AND SEMI-RANDOM K-COLORABLE GRAPHS
    BLUM, A
    SPENCER, J
    JOURNAL OF ALGORITHMS, 1995, 19 (02) : 204 - 234