2 citations · 8 across the 16 of their papers we have counts for
17 papers
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…
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…
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…
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…
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…
Solving Segment Display Problems Using Quantum Grover's Search Algorithm
Shanyan Chen, Ali Al-Bayaty, Xiaoyu Song +1
This paper introduces a new Boolean-based methodology for constructing Segment Display Problems (SDPs) in the quantum domain and solving them using Grover's quantum search algorith…
Stesso: A reconfigurable decomposition of -bit Toffoli gates using symmetrical logical structures and adjustable support qubits
Shanyan Chen, Ali Al-Bayaty, Xiaoyu Song +1
An -bit Toffoli gate is mainly utilized to construct other quantum gates and operators, such as Fredkin gates, arithmetical adders, and logical comparators, where …
Visualizing the state space and transformations of higher order quantum logics via toric geometry
Steven Bleiler, Shanyan Chen, Emma O'Neil +7
We propose some new uses of toric variety structures in the study of quantum computation for small radices. In particular, we observe the concurrence of the equivalence classes of…
A Cost-Effective Layout-Aware Quantum Circuit Synthesis For Triangular, Square, and Heavy-Hex Layouts
Sonia Yang, Ali Al-Bayaty, Marek Perkowski
The quantum layout and the mapping of logical to physical qubits are crucial in quantum circuit synthesis for a real quantum computer. Circuits that include large -bit Toffoli g…
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…
Synthesis of Binary-Input Multi-Valued Output Optical Cascades for Reversible and Quantum Technologies
Ishani Agarwal, Miroslav Saraivanov, Marek Perkowski
This paper extends the decomposition from the group theory based methods of Sasao and Saraivanov to design binary input multivalued output quantum cascades realized with optical NO…
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…
Superposition States on Different Axes of the Bloch Sphere for Cost-Effective Circuits Realization on IBM Quantum Computers
A. Al-Bayaty, M. Perkowski
A proposed method for preparing the superposition states of qubits using different axes of the Bloch sphere. This method utilizes the Y-axis of the Bloch sphere using IBM native (s…
GALA-n: Generic Architecture of Layout-Aware n-Bit Quantum Operators for Cost-Effective Realization on IBM Quantum Computers
A. Al-Bayaty, M. Perkowski
A generic architecture of n-bit quantum operators is proposed for cost-effective transpilation, based on the layouts and the number of n neighbor physical qubits for IBM quantum co…