4 papers
Quantangle-SAT: A Quantum SAT Solver Based on Entanglement and Equivalence Checking
Shang-Wei Lin, Ji-Qing Yan, Yean-Ru Chen +2
Satisfiability (SAT) is a central problem in computer science, and advances in SAT-solving algorithms have a far-reaching impact across many fields. Recent works have proposed quan…
A Modular and T-Gate Efficient Architecture for Quantum Leading-Zero/One Counter
Lei-Han Yao, Shang-Wei Lin, Yu-Chung Chen +1
The Quantum Leading-Zero/One Counter (QLZOC) is a fundamental component in quantum arithmetic, playing a critical role in normalization, floating-point units, dynamic range scaling…
A Parallel and Distributed Quantum SAT Solver Based on Entanglement and Quantum Teleportation
Shang-Wei Lin, Tzu-Fan Wang, Yean-Ru Chen +3
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 sci…
A Quantum SMT Solver for Bit-Vector Theory
Shang-Wei Lin, Si-Han Chen, Tzu-Fan Wang +1
Given a formula of satisfiability modulo theory (SMT), the classical SMT solver tries to (1) abstract as a Boolean formula , (2) find a Boolean solution to , and…