Solving k-SAT problems with generalized quantum measurement

被引：0
|
作者：
Zhang, Yipei [1 ,2 ]
Lewalle, Philippe [1 ,2 ]
Whaley, K. Birgitta [1 ,2 ]
机构：
[1] Department of Chemistry, University of California, Berkeley,CA,94720, United States
[2] Berkeley Center for Quantum Information and Computation, Berkeley,CA,94720, United States
来源：
arXiv |
关键词：
Compilation and indexing terms; Copyright 2025 Elsevier Inc;
D O I：
暂无
中图分类号：
学科分类号：
摘要：
Dynamics
引用
收藏
相关论文
共 50 条
  • [31] Analysis of backtracking of random k-SAT
    Xu, Ke
    Li, Wei
    Jisuanji Xuebao/Chinese Journal of Computers, 2000, 23 (05): : 454 - 458
  • [32] Quantum tunneling and quantum walks as algorithmic resources to solve hard K-SAT instances
    Ernesto Campos
    Salvador E. Venegas-Andraca
    Marco Lanzagorta
    Scientific Reports, 11
  • [33] The K-SAT problem in a simple limit
    Leuzzi, L
    Parisi, G
    JOURNAL OF STATISTICAL PHYSICS, 2001, 103 (5-6) : 679 - 695
  • [34] On the critical exponents of random k-SAT
    Wilson, DB
    RANDOM STRUCTURES & ALGORITHMS, 2002, 21 (02) : 182 - 195
  • [35] Going After the k-SAT Threshold
    Coja-Oghlan, Amin
    Panagiotou, Konstantinos
    STOC'13: PROCEEDINGS OF THE 2013 ACM SYMPOSIUM ON THEORY OF COMPUTING, 2013, : 705 - 714
  • [36] Quantum tunneling and quantum walks as algorithmic resources to solve hard K-SAT instances
    Campos, Ernesto
    Venegas-Andraca, Salvador E.
    Lanzagorta, Marco
    SCIENTIFIC REPORTS, 2021, 11 (01)
  • [37] A novel weighting scheme for random k-SAT关于随机 k-SAT 的新加权方法
    Jun Liu
    Ke Xu
    Science China Information Sciences, 2016, 59
  • [38] A Note on Random k-SAT for Moderately Growing k
    Liu, Jun
    Gao, Zongsheng
    Xu, Ke
    ELECTRONIC JOURNAL OF COMBINATORICS, 2012, 19 (01):
  • [39] BELIEF PROPAGATION ON THE RANDOM k-SAT MODEL
    Coja-Oghlan, Amin
    Mueller, Noela
    Ravelomanan, Jean B.
    ANNALS OF APPLIED PROBABILITY, 2022, 32 (05): : 3718 - 3796
  • [40] On the K-sat model with large number of clauses
    Panchenko, Dmitry
    RANDOM STRUCTURES & ALGORITHMS, 2018, 52 (03) : 536 - 542
12345