7 citations · 16 across the 10 of their papers we have counts for
14 papers
A 12-CNOT Double Qubit Excitation Gate
Irfansha Shaik
Effective implementation of high-level quantum gates is essential for practical quantum computing. In this work, we presented, to the best of our knowledge, the first reported 12-C…
Fault-tolerant quantum computations of vibrational wave functions
Marco Majland, Rasmus Berg Jensen, Patrick Ettenhuber +3
Quantum computation of vibrational properties of molecules is a promising platform to obtain computational advantages for computational chemistry. However, fault-tolerant quantum c…
Explanations for Unrealizability of Infinite-State Safety Shields
Andoni Rodriguez, Irfansha Shaik, Davide Corsi +2
Safe Reinforcement Learning focuses on developing optimal policies while ensuring safety. A popular method to address such task is shielding, in which a correct-by-construction saf…
Practical Subarchitectures for Optimal Quantum Layout Synthesis
Kostiantyn V. Milkevych, Jaco van de Pol, Irfansha Shaik
Quantum Layout Synthesis (QLS) maps a logical quantum circuit to a physical quantum platform. Optimal QLS minimizes circuit size and depth, which is essential to reduce the noise o…
Depth-Optimal Quantum Layout Synthesis as SAT
Anna B. Jakobsen, Anders B. Clausen, Jaco van de Pol +1
Quantum circuits consist of gates applied to qubits. Current quantum hardware platforms impose connectivity restrictions on binary CX gates. Hence, Layout Synthesis is an important…
CNOT-Optimal Clifford Synthesis as SAT
Irfansha Shaik, Jaco van de Pol
Clifford circuit optimization is an important step in the quantum compilation pipeline. Major compilers employ heuristic approaches. While they are fast, their results are often su…
Optimal Layout-Aware CNOT Circuit Synthesis with Qubit Permutation
Irfansha Shaik, Jaco van de Pol
CNOT optimization plays a significant role in noise reduction for Quantum Circuits. Several heuristic and exact approaches exist for CNOT optimization. In this paper, we investigat…
Calculating the energy profile of an enzymatic reaction on a quantum computer
Patrick Ettenhuber, Mads Bøttger Hansen, Irfansha Shaik +7
Quantum computing (QC) provides a promising avenue toward enabling quantum chemistry calculations, which are classically impossible due to a computational complexity that increases…
Optimal Layout Synthesis for Deep Quantum Circuits on NISQ Processors with 100+ Qubits
Irfansha Shaik, Jaco van de Pol
Layout synthesis is mapping a quantum circuit to a quantum processor. SWAP gate insertions are needed for scheduling 2-qubit gates only on connected physical qubits. With the ever-…
Search-Space Pruning with Int-Splits for Faster QBF Solving
Maximilian Heisinger, Irfansha Shaik, Martina Seidl +1
In many QBF encodings, sequences of Boolean variables stand for binary representations of integer variables. Examples are state labels in bounded model checking or actions in plann…
Optimal Layout Synthesis for Quantum Circuits as Classical Planning (full version)
Irfansha Shaik, Jaco van de Pol
In Layout Synthesis, the logical qubits of a quantum circuit are mapped to the physical qubits of a given quantum hardware platform, taking into account the connectivity of physica…
Concise QBF Encodings for Games on a Grid (extended version)
Irfansha Shaik, Jaco van de Pol
Encoding 2-player games in QBF correctly and efficiently is challenging and error-prone. To enable concise specifications and uniform encodings of games played on grid boards, like…
Implicit State and Goals in QBF Encodings for Positional Games (extended version)
Irfansha Shaik, Valentin Mayer-Eichberger, Jaco van de Pol +1
We address two bottlenecks for concise QBF encodings of maker-breaker positional games, like Hex and Tic-Tac-Toe. Our baseline is a QBF encoding with explicit variables for board p…
Classical Planning as QBF without Grounding (extended version)
Irfansha Shaik, Jaco van de Pol
Most classical planners use grounding as a preprocessing step, essentially reducing planning to propositional logic. However, grounding involves instantiating all action rules with…