29 citations · 144 across the 21 of their papers we have counts for
22 papers
Efficient Synthesis of Multi-Controlled Toffoli Gates with Ternary Clifford Gates
Amit Saha, Francesco Arzani
Temporary occupation of qutrit levels can reduce the width and depth required for binary circuit logic in quantum computing. We introduce an efficient intermediate-qutrit decomposi…
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…
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…
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…
Distributed Scheduling of Quantum Circuits with Noise and Time Optimization
Debasmita Bhoumik, Ritajit Majumdar, Amit Saha +1
Quantum computers are currently noisy, particularly without error correction and fault tolerance. Methods like error suppression and mitigation are widely used to improve performan…
Intermediate-qudit assisted Improved quantum algorithm for string matching with an Advanced Decomposition of Fredkin gate
Amit Saha, Om Khanna
The circuit-level implementation of a quantum string-matching algorithm, which matches a search string (pattern) of length inside a longer text of length , has already been…
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…
-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…
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…
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…
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 -coloring Problem and Its Implementation on Near-term Quantum Devices
Amit Saha, Debasri Saha, Amlan Chakrabarti
Nowadays in Quantum Computing, the implementation of quantum algorithm has created a stir since Noisy Intermediate-Scale Quantum (NISQ) devices are out in the market. Researchers a…
One-Dimensional Lazy Quantum walk in Ternary System
Amit Saha, Sudhindu Bikash Mandal, Debasri Saha +1
Quantum walks play an important role for developing quantum algorithms and quantum simulations. Here we present one dimensional three-state quantum walk(lazy quantum walk) and show…
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…
Search of clustered marked states with lackadaisical quantum walks
Amit Saha, Ritajit Majumdar, Debasri Saha +2
Nature of quantum walk in presence of multiple marked state has been studied by Nahimovs and Rivosh \cite{10.1007/978-3-662-49192-8_31}. They have shown that if the marked states a…