Abhoy Kole
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Abhoy Kole has a total of 26 co-authors. Here are the top co-authors by number of shared publications:
- Rolf Drechsler
Faculty 03 Mathematics and Computer Science, University of Bremen
13 shared publications - Kamalika Datta
Cyber-Physical Systems, DFKI GmbH, Bremen, Germany
12 shared publications - Indranil Sengupta
Department of Computer Science and Engineering, Indian Institute of Technology Kharagpur, Kharagpur, India
4 shared publications - Fatemeh Shirinzadeh
Cyber-Physical Systems, DFKI GmbH, Bremen, Germany
2 shared publications - Lennart Weingarten
University of Bremen
2 shared publications - Saeideh Shirinzadeh
Cyber-Physical Systems, DFKI GmbH, Bremen, Germany
2 shared publications
Latest Publications
- 23 September 2026
- Published by Springer Nature in Journal of Signal Processing Systems
- Vol. 98 (2) , 46
Hardware Non-Idealities and Reliability in RRAM Crossbar Neuromorphic Character Recognition Systems
- 23 September 2026
- Published by Springer Nature in Journal of Signal Processing Systems
- Vol. 98 (2) , 46
Hardware Non-Idealities and Reliability in RRAM Crossbar Neuromorphic Character Recognition Systems
- 21 August 2026
- Published by Springer Nature in Journal of Signal Processing Systems
- Vol. 98 (2) , 41
Multi-Scheduling Crossbar Mapping and Design-Space Exploration of MAGIC-Based ReRAM Arithmetic Circuits for In-Memory Computing
- 21 August 2026
- Published by Springer Nature in Journal of Signal Processing Systems
- Vol. 98 (2) , 41
Multi-Scheduling Crossbar Mapping and Design-Space Exploration of MAGIC-Based ReRAM Arithmetic Circuits for In-Memory Computing
- 11 May 2026
- Published by Springer Nature
- p. 504-519
Ensuring Correctness Efficiently for RISC-V Processors with Customised Multiplier Designs
- 11 May 2026
- Published by Springer Nature
- p. 504-519
Ensuring Correctness Efficiently for RISC-V Processors with Customised Multiplier Designs
- 1 May 2026
- Published by Springer Nature
- p. 317-337
Assertion-Based Debugging of Quantum Circuits: Techniques, Effectiveness, and Challenges
- 1 May 2026
- Published by Springer Nature
- p. 317-337
Assertion-Based Debugging of Quantum Circuits: Techniques, Effectiveness, and Challenges
- Open Access
- 17 September 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Quantum Engineering
- Vol. 6, 1-25
Exploration of Design Alternatives for Reducing Idle Time in Shor's Algorithm: A Study on Monolithic and Distributed Quantum Systems
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-level modular arithmetic optimizations, a broader perspective can provide additional opportunities for improvement. By adopting a mid-level abstraction, we analyze the algorithm as a sequence of computational tasks, enabling systematic identification of idle time and optimization of execution flow. Building on this perspective, we first introduce an alternating design approach to minimize idle time while preserving qubit efficiency in Shor's algorithm. By strategically reordering tasks for simultaneous execution, we achieve a substantial reduction in overall execution time. Extending this approach to distributed implementations, we demonstrate how task rearrangement enhances execution efficiency in the presence of multiple distribution channels. Furthermore, to effectively evaluate the impact of design choices, we employ static timing analysis (STA)—a technique from classical circuit design—to analyze circuit delays while accounting for hardware-specific execution characteristics, such as measurement and reset delays in monolithic architectures and ebit generation time in distributed settings. Finally, we validate our approach by integrating modular exponentiation circuits from QRISP and constructing circuits for factoring numbers up to 64 bits. Through an extensive study across neutral atom, superconducting, and ion trap quantum computing platforms, we analyze circuit delays, highlighting trade-offs between qubit efficiency and execution time. Our findings provide a structured framework for optimizing compiled quantum circuits for Shor's algorithm, tailored to specific hardware constraints.
- 17 September 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Quantum Engineering
- Vol. 6, 1-25
Open AccessExploration of Design Alternatives for Reducing Idle Time in Shor's Algorithm: A Study on Monolithic and Distributed Quantum Systems
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-level modular arithmetic optimizations, a broader perspective can provide additional opportunities for improvement. By adopting a mid-level abstraction, we analyze the algorithm as a sequence of computational tasks, enabling systematic identification of idle time and optimization of execution flow. Building on this perspective, we first introduce an alternating design approach to minimize idle time while preserving qubit efficiency in Shor's algorithm. By strategically reordering tasks for simultaneous execution, we achieve a substantial reduction in overall execution time. Extending this approach to distributed implementations, we demonstrate how task rearrangement enhances execution efficiency in the presence of multiple distribution channels. Furthermore, to effectively evaluate the impact of design choices, we employ static timing analysis (STA)—a technique from classical circuit design—to analyze circuit delays while accounting for hardware-specific execution characteristics, such as measurement and reset delays in monolithic architectures and ebit generation time in distributed settings. Finally, we validate our approach by integrating modular exponentiation circuits from QRISP and constructing circuits for factoring numbers up to 64 bits. Through an extensive study across neutral atom, superconducting, and ion trap quantum computing platforms, we analyze circuit delays, highlighting trade-offs between qubit efficiency and execution time. Our findings provide a structured framework for optimizing compiled quantum circuits for Shor's algorithm, tailored to specific hardware constraints.
- Open Access
- 30 April 2025
- Published by Association for Computing Machinery (ACM) in ACM Journal on Emerging Technologies in Computing Systems
- Vol. 21 (2) , 1-15
qSAT: Design of an Efficient Quantum Satisfiability Solver for Hardware Equivalence Checking
The use of Boolean Satisfiability (SAT) solver for hardware verification incurs exponential runtime in several instances. In this work, we have proposed an efficient quantum SAT (qSAT) solver for equivalence checking of Boolean circuits employing Grover’s algorithm. The Exclusive-Sum-of-Product (ESOP)-based generation of the Conjunctive Normal Form (CNF) equivalent clauses demands less qubits and minimizes the gates and depth of quantum circuit interpretation. The consideration of reference circuits for verification affecting Grover’s iterations and quantum resources are also presented as a case study. Experimental results are presented assessing the benefits of the proposed verification approach using open source Qiskit platform and IBM quantum computer.
- 30 April 2025
- Published by Association for Computing Machinery (ACM) in ACM Journal on Emerging Technologies in Computing Systems
- Vol. 21 (2) , 1-15
Open AccessqSAT: Design of an Efficient Quantum Satisfiability Solver for Hardware Equivalence Checking
The use of Boolean Satisfiability (SAT) solver for hardware verification incurs exponential runtime in several instances. In this work, we have proposed an efficient quantum SAT (qSAT) solver for equivalence checking of Boolean circuits employing Grover’s algorithm. The Exclusive-Sum-of-Product (ESOP)-based generation of the Conjunctive Normal Form (CNF) equivalent clauses demands less qubits and minimizes the gates and depth of quantum circuit interpretation. The consideration of reference circuits for verification affecting Grover’s iterations and quantum resources are also presented as a case study. Experimental results are presented assessing the benefits of the proposed verification approach using open source Qiskit platform and IBM quantum computer.
- Open Access
- 22 October 2024
- Published by Association for Computing Machinery (ACM) in ACM Journal on Emerging Technologies in Computing Systems
- Vol. 20 (4) , 1-19
Exploiting the Extended Neighborhood of Hexagonal Qubit Architecture for Mapping Quantum Circuits
In this work mapping of quantum circuits to regular hexagonal grid with coupling degree of six has been investigated. Architectures involving superconducting qubits impose restrictions on 2-qubit gate operations to be carried out only between physically coupled qubits, also referred to as nearest-neighbor (NN) constraint. The noise introduced by the 2-qubit gates and the execution time greatly affect the computational reliability. Existing mapping techniques suffer either from the adopted approach to reduce gate overhead or from their inability to take advantage of such architectural regularity. We outlined three different qubit mapping approaches using Remote-CNOT templates, Swap gates and combination of both. We show the benefits of assigning the Cartesian coordinate system in hexagonal grid for runtime elevation and devised approaches for reduction in gate overheads. While the template-based approach gives a strict upper bound of additional gate overheads for a particular qubit mapping, the combined approach provides better result employing a larger lookahead window. Experiments on benchmark quantum circuits confirm that the proposed Swap-based method provides an average \(25\%\) improvement in gate overheads over a recent work and the combined approach contributes further \(15\%\) average improvement on the result at the expense of a little higher runtime.- 22 October 2024
- Published by Association for Computing Machinery (ACM) in ACM Journal on Emerging Technologies in Computing Systems
- Vol. 20 (4) , 1-19
Open AccessExploiting the Extended Neighborhood of Hexagonal Qubit Architecture for Mapping Quantum Circuits
In this work mapping of quantum circuits to regular hexagonal grid with coupling degree of six has been investigated. Architectures involving superconducting qubits impose restrictions on 2-qubit gate operations to be carried out only between physically coupled qubits, also referred to as nearest-neighbor (NN) constraint. The noise introduced by the 2-qubit gates and the execution time greatly affect the computational reliability. Existing mapping techniques suffer either from the adopted approach to reduce gate overhead or from their inability to take advantage of such architectural regularity. We outlined three different qubit mapping approaches using Remote-CNOT templates, Swap gates and combination of both. We show the benefits of assigning the Cartesian coordinate system in hexagonal grid for runtime elevation and devised approaches for reduction in gate overheads. While the template-based approach gives a strict upper bound of additional gate overheads for a particular qubit mapping, the combined approach provides better result employing a larger lookahead window. Experiments on benchmark quantum circuits confirm that the proposed Swap-based method provides an average \(25\%\) improvement in gate overheads over a recent work and the combined approach contributes further \(15\%\) average improvement on the result at the expense of a little higher runtime. - Open Access
qSAT: Design of an Efficient Quantum Satisfiability Solver for Hardware Equivalence Checking
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 (qSAT) solver for equivalence checking of Boolean circuits employing Grover's algorithm. The Exclusive-Sum-of-Product based generation of the Conjunctive Normal Form equivalent clauses demand less qubits and minimizes the gates and depth of quantum circuit interpretation. The consideration of reference circuits for verification affecting Grover's iterations and quantum resources are also presented as a case study. Experimental results are presented assessing the benefits of the proposed verification approach using open-source Qiskit platform and IBM quantum computer.
Open AccessqSAT: Design of an Efficient Quantum Satisfiability Solver for Hardware Equivalence Checking
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 (qSAT) solver for equivalence checking of Boolean circuits employing Grover's algorithm. The Exclusive-Sum-of-Product based generation of the Conjunctive Normal Form equivalent clauses demand less qubits and minimizes the gates and depth of quantum circuit interpretation. The consideration of reference circuits for verification affecting Grover's iterations and quantum resources are also presented as a case study. Experimental results are presented assessing the benefits of the proposed verification approach using open-source Qiskit platform and IBM quantum computer.
- Open Access
- 12 June 2024
- Published by Association for Computing Machinery (ACM)
- p. 502-506
Exploring the Potential of Decision Diagrams for Efficient In-Memory Design Verification
- 12 June 2024
- Published by Association for Computing Machinery (ACM)
- p. 502-506
Open AccessExploring the Potential of Decision Diagrams for Efficient In-Memory Design Verification
- 29 May 2024
- Published by Springer Nature
- p. 201-217
Is Simulation the only Alternative for Effective Verification of Dynamic Quantum Circuits?
- 29 May 2024
- Published by Springer Nature
- p. 201-217
Is Simulation the only Alternative for Effective Verification of Dynamic Quantum Circuits?