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 条
  • [1] An Efficient Approach to Solving Random k-sat Problems
    Gilles Dequen
    Olivier Dubois
    Journal of Automated Reasoning, 2006, 37 : 261 - 276
  • [2] An efficient approach to solving random k-SAT problems
    Dequen, Gilles
    Dubois, Olivier
    JOURNAL OF AUTOMATED REASONING, 2006, 37 (04) : 261 - 276
  • [3] An efficient approach to solving random k-sat problems
    Dequen, Gilles
    Dubois, Olivier
    Journal of Automated Reasoning, 2006, 37 (04): : 261 - 276
  • [4] The backtracking survey propagation algorithm for solving random K-SAT problems
    Raffaele Marino
    Giorgio Parisi
    Federico Ricci-Tersenghi
    Nature Communications, 7
  • [5] The backtracking survey propagation algorithm for solving random K-SAT problems
    Marino, Raffaele
    Parisi, Giorgio
    Ricci-Tersenghi, Federico
    NATURE COMMUNICATIONS, 2016, 7
  • [6] A quantum differentiation of k-SAT instances
    Tamir, B.
    Ortiz, G.
    NEW JOURNAL OF PHYSICS, 2010, 12
  • [7] Hardness of Approximation Algorithms on k-SAT and (k,s)-SAT Problems
    Deng, Tianyan
    Xu, Daoyun
    PROCEEDINGS OF THE 9TH INTERNATIONAL CONFERENCE FOR YOUNG COMPUTER SCIENTISTS, VOLS 1-5, 2008, : 60 - 64
  • [8] On Efficiently Solvable Cases of Quantum k-SAT
    Marco Aldi
    Niel de Beaudrap
    Sevag Gharibian
    Seyran Saeedi
    Communications in Mathematical Physics, 2021, 381 : 209 - 256
  • [9] On Efficiently Solvable Cases of Quantum k-SAT
    Aldi, Marco
    de Beaudrap, Niel
    Gharibian, Sevag
    Saeedi, Seyran
    COMMUNICATIONS IN MATHEMATICAL PHYSICS, 2021, 381 (01) : 209 - 256
  • [10] Complexity of k-SAT
    Impagliazzo, R
    Paturi, R
    FOURTEENTH ANNUAL IEEE CONFERENCE ON COMPUTATIONAL COMPLEXITY, PROCEEDINGS, 1999, : 237 - 240
12345