5 papers · 1 filter
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…
Exploration of Design Alternatives for Reducing Idle Time in Shor's Algorithm: A Study on Monolithic and Distributed Quantum Systems
Moritz Schmidt, Abhoy Kole, Leon Wichette +3
Shor's algorithm is one of the most prominent quantum algorithms, yet finding efficient implementations remains an active research challenge. While many approaches focus on low-lev…
qSAT: Design of an Efficient Quantum Satisfiability Solver for Hardware Equivalence Checking
Abhoy Kole, Mohammed E. Djeridane, Lennart Weingarten +2
The use of Boolean Satisfiability (SAT) solver for hardware verification incurs exponential run-time in several instances. In this work we have proposed an efficient quantum SAT (q…