1 citations · 2 across the 6 of their papers we have counts for
4 papers · 1 filter
SAQC: A SAT-Aware Compilation Framework for QAOA-Based Quantum Optimization
Till Schnittka, Julie Maria Raju, Abhoy Kole +1
The Quantum Approximate Optimization Algorithm (QAOA) is a promising variational approach for solving Boolean satisfiability (SAT) problems. Existing SAT-to-QAOA workflows first tr…
Adaptive Clifford+T Decomposition of Large Toffoli Gates with One Clean Ancilla
Abhoy Kole, Majd Assaad, Till Schnittka +1
Multi-controlled Toffoli gates are fundamental building blocks in quantum computation, with applications in quantum arithmetic, simulation, and search algorithms. In fault-tolerant…
Measurement-Driven Adaptive Low-Overhead Implementation of Multi-Controlled Toffoli Gates
Abhoy Kole, Till Schnittka, Rolf Drechsler
The Toffoli gate is a fundamental building block for quantum arithmetic and reversible logic, yet its efficient realization remains a major challenge in both near-term and fault-to…
Performance Gains in Quantum SAT Solvers Using ESOP Encoding
Majd Assaad, Abhoy Kole, Rolf Drechsler
The Boolean Satisfiability (SAT) problem is a canonical NP-complete problem and a natural candidate for quantum acceleration via search-based algorithms. In Grover-based quantum SA…