activity
20112025
most citedLinear Nearest Neighbor Synthesis of Reversible Circuits by Graph Partitioning

49 citations · 191 across the 35 of their papers we have counts for

collaborators
Showing 2021Show all

6 papers · 1 filter

cs.CR2021★ 1 cited

FuCE: Fuzzing+Concolic Execution guided Trojan Detection in Synthesizable Hardware Designs

Mukta Debnath, Animesh Basak Chowdhury, Debasri Saha +1

High-level synthesis (HLS) is the next emerging trend for designing complex customized architectures for applications such as Machine Learning, Video Processing. It provides a high…

quant-ph2021★ 1 cited

Efficient Decoding of Surface Code Syndromes for Error Correction in Quantum Computing

Debasmita Bhoumik, Pinaki Sen, Ritajit Majumdar +3

Errors in surface code have typically been decoded by Minimum Weight Perfect Matching (MWPM) based method. Recently, neural-network-based Machine Learning (ML) techniques have been…

quant-ph2021

Depth Optimized Ansatz Circuit in QAOA for Max-Cut

Ritajit Majumdar, Debasmita Bhoumik, Dhiraj Madan +3

While a Quantum Approximate Optimization Algorithm (QAOA) is intended to provide a quantum advantage in finding approximate solutions to combinatorial optimization problems, noise…

quant-ph2021★ 12 cited

-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…

quant-ph2021

Faster Search of Clustered Marked States with Lackadaisical Quantum Walks

Amit Saha, Ritajit Majumdar, Debasri Saha +2

The nature of discrete-time quantum walk in the presence of multiple marked states has been studied by Nahimovs and Rivosh. They introduced an exceptional configuration of clustere…

quant-ph2021★ 20 cited

Optimizing Ansatz Design in QAOA for Max-cut

Ritajit Majumdar, Dhiraj Madan, Debasmita Bhoumik +3

Quantum Approximate Optimization Algorithm (QAOA) is studied primarily to find approximate solutions to combinatorial optimization problems. For a graph with vertices and e…