63 citations · 157 across the 12 of their papers we have counts for
12 papers
Ensemble-IR: Concise Representation for Quantum Ensemble Programs
Sourish Wawdhane, Sashwat Anagolum, Poulami Das +1
Emerging quantum applications such as error mitigation, system characterization, and hybrid protocols often require running large families of related quantum circuits. Existing int…
Clifford Assisted Optimal Pass Selection for Quantum Transpilation
Siddharth Dangwal, Gokul Subramanian Ravi, Lennart Maximilian Seifert +3
The fidelity of quantum programs in the NISQ era is limited by high levels of device noise. To increase the fidelity of quantum programs running on NISQ devices, a variety of optim…
VarSaw: Application-tailored Measurement Error Mitigation for Variational Quantum Algorithms
Siddharth Dangwal, Gokul Subramanian Ravi, Poulami Das +3
For potential quantum advantage, Variational Quantum Algorithms (VQAs) need high accuracy beyond the capability of today's NISQ devices, and thus will benefit from error mitigation…
FrozenQubits: Boosting Fidelity of QAOA by Skipping Hotspot Nodes
Ramin Ayanzadeh, Narges Alavisamani, Poulami Das +1
Quantum Approximate Optimization Algorithm (QAOA) is one of the leading candidates for demonstrating the quantum advantage using near-term quantum computers. Unfortunately, high de…
HAMMER: boosting fidelity of noisy Quantum circuits by exploiting Hamming behavior of erroneous outcomes
Swamit Tannu, Poulami Das, Ramin Ayanzadeh +1
Quantum computers with hundreds of qubits will be available soon. Unfortunately, high device error-rates pose a significant challenge in using these near-term quantum systems to po…
ForeSight: Reducing SWAPs in NISQ Programs via Adaptive Multi-Candidate Evaluations
Poulami Das, Suhas K. Vittal, Moinuddin Qureshi
Near-term quantum computers are noisy and have limited connectivity between qubits. Compilers are required to introduce SWAP operations in order to perform two-qubit gates between…
JigSaw: Boosting Fidelity of NISQ Programs via Measurement Subsetting
Poulami Das, Swamit Tannu, Moinuddin Qureshi
Near-term quantum computers contain noisy devices, which makes it difficult to infer the correct answer even if a program is run for thousands of trials. On current machines, qubit…
ADAPT: Mitigating Idling Errors in Qubits via Adaptive Dynamical Decoupling
Poulami Das, Swamit Tannu, Siddharth Dangwal +1
The fidelity of applications on near-term quantum computers is limited by hardware errors. In addition to errors that occur during gate and measurement operations, a qubit is susce…
EQUAL: Improving the Fidelity of Quantum Annealers by Injecting Controlled Perturbations
Ramin Ayanzadeh, Poulami Das, Swamit S. Tannu +1
Quantum computing is an information processing paradigm that uses quantum-mechanical properties to speedup computationally hard problems. Although promising, existing gate-based qu…
LILLIPUT: A Lightweight Low-Latency Lookup-Table Based Decoder for Near-term Quantum Error Correction
Poulami Das, Aditya Locharla, Cody Jones
The error rates of quantum devices are orders of magnitude higher than what is needed to run most quantum applications. To close this gap, Quantum Error Correction (QEC) encodes lo…
A Scalable Decoder Micro-architecture for Fault-Tolerant Quantum Computing
Poulami Das, Christopher A. Pattison, Srilatha Manne +4
Quantum computation promises significant computational advantages over classical computation for some problems. However, quantum hardware suffers from much higher error rates than…
A Case for Superconducting Accelerators
Swamit S. Tannu, Poulami Das, Michael L. Lewis +3
As the scaling of conventional CMOS-based technologies slows down, there is growing interest in alternative technologies that can improve performance or energy-efficiency. Supercon…