Zhé Hóu

A Parallel and Distributed Quantum SAT Solver Based on Entanglement and Quantum Teleportation

2023 · arXiv (Cornell University)

Boolean satisfiability (SAT) solving is a fundamental problem in computer science. Finding efficient algorithms for SAT solving has broad implications in many areas of computer science and beyond. Quantum SAT solvers have been proposed in …