activity
20232026
most citedCost-Effective Realization of n-Bit Toffoli Gates for IBM Quantum Computers Using the Bloch Sphere Approach and IBM Native Gates

2 citations · 8 across the 16 of their papers we have counts for

collaborators
Showing 2026Show all

5 papers · 1 filter

quant-ph2026

Factorized Boolean representations for efficient quantum synthesis

Mehul Shah, Robert Fiszer, Marek Perkowski

Quantum algorithms promise advantages beyond classical reach, but running them on error-corrected hardware requires translating Boolean specifications into reversible circuits, and…

quant-ph2026

Factorization of Exclusive-Sum-Of-Products Expressions with Rectangle Covering to Reduce Quantum Circuit Cost

Audrey Hou, Lucia Zhang, Ali Al-Bayaty +1

The implementation of quantum circuits is currently very expensive, especially due to the usage of large Toffoli gates. Therefore, it is critical to optimize circuit costs by facto…

quant-ph2026

Quantum-Adaptive KS(): A Parameterized Three-Qubit Gate Family Embedding Toffoli with Measurement-Free Phase Kickback and Intrinsic Error Non-Amplification

Kripa Sankaranarayanan, Marek Perkowski

We introduce Quantum-Adaptive KS() ( = kickback, = sandwich), a parameterized three-qubit gate family that structurally embeds the Toffoli (CCX) gate within two additiona…

quant-ph2026

Minimization of AND-XOR Expressions with Decoders for Quantum Circuits

Sonia Yang, Ali Al-Bayaty, Marek Perkowski

This paper introduces a new logic structure for reversible quantum circuit synthesis. Our synthesis method aims to minimize the quantum cost of reversible quantum circuits with dec…

quant-ph2026

A Geometrical Design Tool for Building Cost-Effective Layout-Aware n-Bit Quantum Gates Using the Bloch Sphere Approach

Ali Al-Bayaty, Marek Perkowski

The conventional design technique of any n-bit quantum gate is mainly achieved using unitary matrices multiplication, where n >= 2 and 1 <= m <= n-1 for m target qubits and n-m con…