We report a cluster of results on k-QSAT, the problem of quantum satisfiability for k-qubit projectors which generalizes classical satisfiability with k-bit clauses to the quantum setting. First we define the NP-complete problem of product satisfiability and give a geometrical criterion for deciding when a QSAT interaction graph is product satisfiable with positive probability. We show that the same criterion suffices to establish quantum satisfiability for all projectors. Second, we apply these results to the random graph ensemble with generic projectors and obtain improved lower bounds on the location of the SAT--unSAT transition. Third, we present numerical results on random, generic satisfiability which provide estimates for the location of the transition for k=3 and k=4 and mild evidence for the existence of a phase which is satisfiable by entangled states alone.
Implementation for Solving Random Satisfiability Problems through CNOT-based circuits in a NMR Quantum Processor
给出了用多量子位控制非门和非门等基本逻辑门构造随机\QTR{it}{satisfiability}(SAT)量子线路的一般方法。这些电路的大小几乎与SAT公式的大小相同。此外,一个并行化方案,以解决随机SAT问题,有效地通过这些量子线路在\QTR{it}{nuclear magnetic resonance}(NMR)系综量子计算。该方案利用真正的混合态而不是伪纯态作为输入态,并结合NMR谱的拓扑性质,以并行的方式识别SAT问题的解。该方案对几个典型的SAT问题进行了实验验证,取得了良好的性能。
Entanglement Barriers from Computational Complexity: Matrix-Product-State Approach to Satisfiability
Technische Universität Dresden(德累斯顿工业大学);Technical University of Munich(慕尼黑工业大学);Munich Center for Quantum Science and Technology (MCQST)(慕尼黑量子科学与技术中心);Max Planck Institute for the Physics of Complex Systems(马普复杂系统物理研究所)
Assessment of Quantum Annealing for the Construction of Satisfiability Filters
S. A. Weaver等人在2014年提出的,是一种新的有前途的过滤器类型,用于解决集合成员测试。为了构造可满足性过滤器,需要找到硬随机$k$ -SAT问题的不同解。本文比较了模拟退火,模拟量子退火和walkSAT,一个开源的SAT求解器,在他们找到这样的解决方案的能力。结果表明,通过模拟量子退火找到的解决方案通常比通过其他求解器找到的解决方案差异较小,因此对于可满足性过滤器的构建不太有用。
The PRODSAT phase of random quantum satisfiability
Leiden University - Leiden Institute of Advanced Computer Science(莱顿大学 - 莱顿高级计算机科学研究所);EPFL - School of Computer and Communications Sciences(洛桑联邦理工学院 - 计算机与通信科学学院)