Cover Image

Quantangle-SAT: A Quantum SAT Solver Based on Entanglement and Equivalence Checking

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Lin, Shang-Wei, Yan, Ji-Qing, Chen, Yean-Ru, Hou, Zhe, Sanán, David
Format:	Preprint
Published:	2026
Subjects:	Quantum Physics
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

qSAT: Design of an Efficient Quantum Satisfiability Solver for Hardware Equivalence Checking
by: Kole, Abhoy, et al.
Published: (2024)

Performance Gains in Quantum SAT Solvers Using ESOP Encoding
by: Assaad, Majd, et al.
Published: (2026)

A Modular and T-Gate Efficient Architecture for Quantum Leading-Zero/One Counter
by: Yao, Lei-Han, et al.
Published: (2026)

Quokka#: Quantum Computing with #SAT
by: Mei, Jingyi, et al.
Published: (2026)

Q3SAT-GPT: A Generative Model for Discovering Quantum Circuits for the 3-SAT Problem
by: Ugale, Pratim, et al.
Published: (2026)

Reducing Quantum Circuit Synthesis to #SAT
by: Zak, Dekel, et al.
Published: (2025)

Quantum Approximate Optimisation for Not-All-Equal SAT
by: El-Kadi, Andrew, et al.
Published: (2024)

Equivalence Checking of Parameterised Quantum Circuits
by: Hong, Xin, et al.
Published: (2024)

A SAT Solver and Computer Algebra Attack on the Minimum Kochen-Specker Problem
by: Li, Zhengyu, et al.
Published: (2023)

Quantum Graph-State Synthesis with SAT
by: Brand, Sebastiaan, et al.
Published: (2023)

Depth-Optimal Quantum Layout Synthesis as SAT
by: Jakobsen, Anna B., et al.
Published: (2025)

Quantum k-SAT Related Hypergraph Problems
by: Kremer, Simon-Luca, et al.
Published: (2025)

Complexity of Fermionic 2-SAT
by: Stroeks, Maarten, et al.
Published: (2024)

SAT Strikes Back: Parameter and Path Relations in Quantum Toolchains
by: Schmidbauer, Lukas, et al.
Published: (2025)

Partial Equivalence Checking of Quantum Circuits
by: Chen, Tian-Fu, et al.
Published: (2022)

Runtime-coherence trade-offs for hybrid SAT-solvers
by: Eshaghian, Vahideh, et al.
Published: (2024)

Approximation Methods for Simulation and Equivalence Checking of Noisy Quantum Circuits
by: Huang, Mingyu, et al.
Published: (2025)

Decoding quantum color codes with MaxSAT
by: Berent, Lucas, et al.
Published: (2023)

CNOT-Optimal Clifford Synthesis as SAT
by: Shaik, Irfansha, et al.
Published: (2025)

SAT, Gadgets, Max2XOR, and Quantum Annealers
by: Ansótegui, Carlos, et al.
Published: (2024)

Solving k-SAT problems with generalized quantum measurement
by: Zhang, Yipei, et al.
Published: (2024)

Solving Max-3SAT Using QUBO Approximation
by: Zielinski, Sebastian, et al.
Published: (2024)

Equivalence Checking of Quantum Circuits by Model Counting
by: Mei, Jingyi, et al.
Published: (2024)

Manjushri: A Tool for Equivalence Checking of Quantum Circuits
by: Trinh, Xuan Du, et al.
Published: (2026)

MaxSAT decoders for arbitrary CSS codes
by: Noormandipour, Mohammadreza, et al.
Published: (2024)

A SAT Encoding for Optimal Clifford Circuit Synthesis
by: Schneider, Sarah, et al.
Published: (2022)

Quantum SAT Problems with Finite Sets of Projectors are Complete for a Plethora of Classes
by: Cardoso, Ricardo Rivera, et al.
Published: (2025)

Grover-QAOA for 3-SAT: Quadratic Speedup, Fair-Sampling, and Parameter Clustering
by: Zhang, Zewen, et al.
Published: (2024)

Distributed quantum-classical hybrid algorithm for solving K-SAT problem
by: Huang, Huaijing, et al.
Published: (2026)

Performance of quantum annealing for 2-SAT problems with multiple satisfying assignments
by: Mehta, Vrinda, et al.
Published: (2025)

Local Quantum Search Algorithm for Random $k$-SAT with $Ω(n^{1+ε})$ Clauses
by: Wu, Mingyou
Published: (2024)

Using an Evolutionary Algorithm to Create (MAX)-3SAT QUBOs
by: Zielinski, Sebastian, et al.
Published: (2024)

A parallel and distributed fixed-point quantum search algorithm for solving SAT problems
by: Wang, He, et al.
Published: (2026)

Scalable Equivalence Checking and Verification of Shallow Quantum Circuits
by: Yu, Nengkun, et al.
Published: (2025)

Amplitude amplification-inspired QAOA: Improving the success probability for solving 3SAT
by: Mandl, Alexander, et al.
Published: (2023)

Planted-solution SAT and Ising benchmarks from integer factorization
by: Hen, Itay
Published: (2026)

Strong Structural Bounds for MaxSAT: The Fine Details of Using Neuromorphic and Quantum Hardware Accelerators
by: Bannach, Max, et al.
Published: (2024)

Assessing fault-tolerant quantum advantage for $k$-SAT with structure
by: Brehm, Martijn, et al.
Published: (2024)

A SAT Scalpel for Lattice Surgery: Representation and Synthesis of Subroutines for Surface-Code Fault-Tolerant Quantum Computing
by: Tan, Daniel Bochen, et al.
Published: (2024)

Search-Driven Clause Learning for Product-State Quantum $k$-SAT (PRODSAT-QSAT)
by: González-Castillo, Samuel, et al.
Published: (2026)