29 citations · 118 across the 25 of their papers we have counts for
25 papers
Gate-level Implementation and Resource Analysis of Lackadaisical Quantum Walk Search
Amit Saha, Debanjan Kola, Nishanka Das +1
Lackadaisical quantum walks (LQW) extend discrete-time quantum walks (DTQW) by introducing weighted self-loops, enabling improved spatial-search performance through controlled loca…
Capability-Adaptive Cryptanalysis with Reduced-Space Quantum Verification
Nivedita Dey, Mrityunjay Ghosh, Pranav Kaushal +2
Efficient integration of cryptanalytic evidence with quantum verification remains a fundamental challenge in hybrid classical-quantum cryptanalysis. This work presents a capability…
A Lightweight Fault-Detection Scheme for Barrett Modular Multiplication Using Multiple Conditional Reduction Paths
Rourab Paul, Paresh Baidya, Krishnendu Guha +1
Polynomial multiplication is the most resource-, time-, and energy-critical operation in lattice-based Post-Quantum Cryptography (PQC) and Fully Homomorphic Encryption (FHE) scheme…
Trojan-Resilient NTT: Protecting Against Control Flow and Timing Faults on Reconfigurable Platforms
Rourab Paul, Krishnendu Guha, Amlan Chakrabarti
Number Theoretic Transform (NTT) is the most essential component for polynomial multiplications used in lattice-based Post-Quantum Cryptography (PQC) algorithms such as Kyber, Dili…
AFarePart: Accuracy-aware Fault-resilient Partitioner for DNN Edge Accelerators
Mukta Debnath, Krishnendu Guha, Debasri Saha +2
Deep Neural Networks (DNNs) are increasingly deployed across distributed and resource-constrained platforms, such as System-on-Chip (SoC) accelerators and edge-cloud systems. DNNs…
Fast classical simulation of qubit-qudit hybrid systems
Haemanth Velmurugan, Arnav Das, Turbasu Chatterjee +3
Simulating quantum circuits is a computationally intensive task that relies heavily on tensor products and matrix multiplications, which can be inefficient. Recent advancements, el…
Robust Implementation of Discrete-time Quantum Walks in Any Finite-dimensional Quantum System
Biswayan Nandi, Sandipan Singha, Ankan Datta +2
Research has shown that quantum walks can accelerate certain quantum algorithms and act as a universal paradigm for quantum processing. The discrete-time quantum walk (DTQW) model,…
Lumbar Spine Tumor Segmentation and Localization in T2 MRI Images Using AI
Rikathi Pal, Sudeshna Mondal, Aditi Gupta +4
In medical imaging, segmentation and localization of spinal tumors in three-dimensional (3D) space pose significant computational challenges, primarily stemming from limited data a…
Panoptic Segmentation and Labelling of Lumbar Spine Vertebrae using Modified Attention Unet
Rikathi Pal, Priya Saha, Somoballi Ghoshal +2
Segmentation and labeling of vertebrae in MRI images of the spine are critical for the diagnosis of illnesses and abnormalities. These steps are indispensable as MRI technology pro…
FragQC: An Efficient Quantum Error Reduction Technique using Quantum Circuit Fragmentation
Saikat Basu, Arnav Das, Amit Saha +2
Quantum computers must meet extremely stringent qualitative and quantitative requirements on their qubits in order to solve real-life problems. Quantum circuit fragmentation techni…
Robust Quantum Arithmetic Operations with Intermediate Qutrits in the NISQ-era
Amit Saha, Anupam Chattopadhyay, Amlan Chakrabarti
Numerous scientific developments in this NISQ-era (Noisy Intermediate Scale Quantum) have raised the importance for quantum algorithms relative to their conventional counterparts d…
On Fault Tolerance of Circuits with Intermediate Qutrit-assisted Gate Decomposition
Ritajit Majumdar, Amit Saha, Amlan Chakrabarti +1
The use of a few intermediate qutrits for efficient decomposition of 3-qubit unitary gates has been proposed, to obtain an exponential reduction in the depth of the decomposed circ…
Robust Quantum Circuit for Clique Problem with Intermediate Qudits
Arpita Sanyal, Amit Saha, Banani Saha +1
Clique problem has a wide range of applications due to its pattern matching ability. There are various formulation of clique problem like -clique problem, maximum clique problem…
QuDiet: A Classical Simulation Platform for Qubit-Qudit Hybrid Quantum Systems
Turbasu Chatterjee, Arnav Das, Subhayu Kumar Bala +3
In the recent years, numerous research advancements have extended the limit of classical simulation of quantum algorithms. Although, most of the state-of-the-art classical simulato…
Discrete-time Quantum Walks in Qudit Systems
Amit Saha, Debasri Saha, Amlan Chakrabarti
Quantum walks contribute significantly to developing quantum algorithms and quantum simulations. Here, we introduce a first of its kind one-dimensional quantum walk in the -dime…
Intermediate Qutrit-based Improved Quantum Arithmetic Operations with Application on Financial Derivative Pricing
Amit Saha, Turbasu Chatterjee, Anupam Chattopadhyay +1
In some quantum algorithms, arithmetic operations are of utmost importance for resource estimation. In binary quantum systems, some efficient implementation of arithmetic operation…
Quantum solutions to possible challenges of Blockchain technology
Nivedita Dey, Mrityunjay Ghosh, Amlan Chakrabarti
Technological advancements of Blockchain and other Distributed Ledger Techniques (DLTs) promise to provide significant advantages to applications seeking transparency, redundancy,…
-QER: An Intelligent Approach towards Quantum Error Reduction
Saikat Basu, Amit Saha, Amlan Chakrabarti +1
Quantum computing has become a promising computing approach because of its capability to solve certain problems, exponentially faster than classical computers. A -qubit quantum…
Qurzon: A Prototype for a Divide and Conquer Based Quantum Compiler
Turbasu Chatterjee, Arnav Das, Shah Ishmam Mohtashim +2
When working with algorithms on quantum devices, quantum memory becomes a crucial bottleneck due to low qubit count in NISQ-era devices. In this context, the concept of `divide and…
Moving Quantum States without SWAP via Intermediate Higher Dimensional Qudits
Amit Saha, Debasri Saha, Amlan Chakrabarti
Quantum algorithms can be realized in the form of a quantum circuit. To map quantum circuit for specific quantum algorithm to quantum hardware, qubit mapping is an imperative techn…
Circuit Design for -coloring Problem and Its Implementation in Any Dimensional Quantum System
Amit Saha, Debasri Saha, Amlan Chakrabarti
With the evolution of quantum computing, researchers now-a-days tend to incline to find solutions to NP-complete problems by using quantum algorithms in order to gain asymptotic ad…
Towards Power Efficient DNN Accelerator Design on Reconfigurable Platform
Rourab Paul, Sreetama Sarkar, Suman Sau +3
The exponential emergence of Field Programmable Gate Array (FPGA) has accelerated the research of hardware implementation of Deep Neural Network (DNN). Among all DNN processors, do…
Asymptotically Improved Circuit for -ary Grover's Algorithm with Advanced Decomposition of -qudit Toffoli Gate
Amit Saha, Ritajit Majumdar, Debasri Saha +2
The progress in building quantum computers to execute quantum algorithms has recently been remarkable. Grover's search algorithm in a binary quantum system provides considerable sp…
Circuit Design for Clique Problem and Its Implementation on Quantum Computer
Arpita Sanyal, Amit Saha, Debasri Saha +2
Finding cliques in a graph has several applications for its pattern matching ability. -clique problem, a special case of clique problem, determines whether an arbitrary graph co…