activity
20182026
most citedAsymptotically Improved Circuit for -ary Grover's Algorithm with Advanced Decomposition of -qudit Toffoli Gate

29 citations · 144 across the 21 of their papers we have counts for

collaborators
Showing 2021Show all

5 papers · 1 filter

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★ 19 cited

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…

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★ 3 cited

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…

cs.ET2021★ 9 cited

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…