19 citations · 29 across the 19 of their papers we have counts for
5 papers · 2 filters
Cost-Effective Realization of n-Bit Toffoli Gates for IBM Quantum Computers Using the Bloch Sphere Approach and IBM Native Gates
Ali Al-Bayaty, Marek Perkowski
A cost-effective n-bit Toffoli gate is proposed to be realized (or transpiled) based on the layouts (linear, T-like, and I-like) and the number of n physical qubits for IBM quantum…
EQB: Synthesizing Permutative Quantum Gates and Circuits Using Rotation-Based Group Decomposition
Ishani Agarwal, Miroslav Saraivanov, Ali Al-Bayaty +1
The decomposition from the group theory-based methods of Sasao and Saraivanov is extended to design binary quantum cascades, using the quantum rotational gates by the X-axis (CNOT…
p-SWAP: A Generic Cost-Effective Quantum Boolean-Phase SWAP Gate Using Two CNOT Gates and the Bloch Sphere Approach
Ali Al-Bayaty, Marek Perkowski
A Boolean-Phase swapping gate is introduced for quantum generality and cost-effectiveness, which is termed the "p-SWAP gate", where p is a customizable phase difference for a set o…
CALA-: A Quantum Library for Realizing Cost-Effective 2-, 3-, 4-, and 5-bit Gates on IBM Quantum Computers using Bloch Sphere Approach, Clifford+T Gates, and Layouts
Ali Al-Bayaty, Xiaoyu Song, Marek Perkowski
We introduce a new quantum layout-aware approach to realize cost-effective -bit gates using the Bloch sphere, for qubits. These -bit gates are entirely constr…
BHT-QAOA: Generalizing Quantum Approximate Optimization Algorithm to Solve Arbitrary Boolean Problems as Hamiltonians
Ali Al-Bayaty, Marek Perkowski
A new methodology is proposed to solve classical Boolean problems as Hamiltonians, using the quantum approximate optimization algorithm (QAOA). Our methodology successfully finds a…