activity
20182026
most citedADAPT: Mitigating Idling Errors in Qubits via Adaptive Dynamical Decoupling

63 citations · 350 across the 30 of their papers we have counts for

collaborators
Showing quant-phShow all

22 papers · 1 filter

quant-ph2026

PropHunt: Automated Optimization of Quantum Syndrome Measurement Circuits

Joshua Viszlai, Satvik Maurya, Swamit Tannu +2

Fault-Tolerant Quantum Computing (FTQC) relies on Quantum Error Correction (QEC) codes to reach error rates necessary for large scale quantum applications. At a physical level, QEC…

quant-ph2025★ 1 cited

Accurate Leakage Speculation for Quantum Error Correction

Chaithanya Naik Mude, Swamit Tannu

Quantum Error Correction (QEC) protects qubits against bit- and phase-flip errors in the |0> or |1> subspace, but physical qubits can also leak into higher energy levels (e.g., |2>…

quant-ph2025

Enabling Fast and Accurate Neutral Atom Readout through Image Denoising

Chaithanya Naik Mude, Linipun Phuttitarn, Satvik Maurya +3

Neutral atom quantum computers hold promise for scaling up to hundreds of thousands or more qubits, but their progress is constrained by slow qubit readout. Parallel measurement of…

quant-ph2025★ 4 cited

Synchronization for Fault-Tolerant Quantum Computers

Satvik Maurya, Swamit Tannu

Quantum Error Correction (QEC) codes store information reliably in logical qubits by encoding them in a larger number of less reliable qubits. The surface code, known for its high…

quant-ph2025★ 1 cited

Efficient measurement of neutral-atom qubits with matched filters

Robert M. Kent, Linipun Phuttitarn, Chaithanya Naik Mude +4

Quantum computers require high-fidelity measurement of many qubits to achieve a quantum advantage. Traditional approaches suffer from readout crosstalk for a neutral-atom quantum p…

quant-ph2025

Iceberg Beyond the Tip: Co-Compilation of a Quantum Error Detection Code and a Quantum Algorithm

Yuwei Jin, Zichang He, Tianyi Hao +5

The rapid progress in quantum hardware is expected to make them viable tools for the study of quantum algorithms in the near term. The timeline to useful algorithmic experimentatio…

quant-ph2025★ 3 cited

Reducing T Gates with Unitary Synthesis

Tianyi Hao, Amanda Xu, Swamit Tannu

Quantum error correction is essential for achieving practical quantum computing but has a significant computational overhead. Among fault-tolerant (FT) gate operations, non-Cliffor…

quant-ph2024

Managing Classical Processing Requirements for Quantum Error Correction

Satvik Maurya, Abtin Molavi, Aws Albarghouthi +1

Large-scale quantum computers promise transformative speedups, but their viability hinges on fast and reliable quantum error correction (QEC). At the center of QEC are decoders-cla…

quant-ph2024★ 10 cited

Understanding Side-Channel Vulnerabilities in Superconducting Qubit Readout Architectures

Satvik Maurya, Chaithanya Naik Mude, Benjamin Lienhard +1

Frequency-multiplexing is an effective method to achieve resource-efficient superconducting qubit readout. Allowing multiple resonators to share a common feedline, the number of ca…

quant-ph2024

Variational Quantum Algorithm Landscape Reconstruction by Low-Rank Tensor Completion

Tianyi Hao, Zichang He, Ruslan Shaydulin +2

Variational quantum algorithms (VQAs) are a broad class of algorithms with many applications in science and industry. Applying a VQA to a problem involves optimizing a parameterize…

quant-ph2024

Efficient and Scalable Architectures for Multi-Level Superconducting Qubit Readout

Chaithanya Naik Mude, Satvik Maurya, Benjamin Lienhard +1

Realizing the full potential of quantum computing requires large-scale quantum computers capable of running quantum error correction (QEC) to mitigate hardware errors and maintain…

quant-ph2024★ 1 cited

Exploiting many-body localization for scalable variational quantum simulation

Chenfeng Cao, Yeqing Zhou, Swamit Tannu +2

Variational quantum algorithms (VQAs) represent a promising pathway toward achieving practical quantum advantage on near-term hardware. Despite this promise, for generic, expressiv…

quant-ph2023★ 1 cited

Dependency-Aware Compilation for Surface Code Quantum Architectures

Abtin Molavi, Amanda Xu, Swamit Tannu +1

Practical applications of quantum computing depend on fault-tolerant devices with error correction. Today, the most promising approach is a class of error-correcting codes called s…

quant-ph2023★ 10 cited

Enabling High Performance Debugging for Variational Quantum Algorithms using Compressed Sensing

Kun Liu, Tianyi Hao, Swamit Tannu

Variational quantum algorithms (VQAs) can potentially solve practical problems using contemporary Noisy Intermediate Scale Quantum (NISQ) computers. VQAs find near-optimal solution…

quant-ph2022★ 9 cited

COMPAQT: Compressed Waveform Memory Architecture for Scalable Qubit Control

Satvik Maurya, Swamit Tannu

On superconducting architectures, the state of a qubit is manipulated by using microwave pulses. Typically, the pulses are stored in the waveform memory and then streamed to the Di…

quant-ph2022★ 30 cited

Scaling Qubit Readout with Hardware Efficient Machine Learning Architectures

Satvik Maurya, Chaithanya Naik Mude, William D. Oliver +2

Reading a qubit is a fundamental operation in quantum computing. It translates quantum information into classical information enabling subsequent classification to assign the qubit…

quant-ph2022★ 24 cited

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…

quant-ph2022★ 5 cited

Accelerating Simulation of Quantum Circuits under Noise via Computational Reuse

Meng Wang, Swamit Tannu, Prashant J. Nair

To realize the full potential of quantum computers, we must mitigate qubit errors by developing noise-aware algorithms, compilers, and architectures. Thus, simulating quantum progr…

quant-ph2021★ 37 cited

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…

quant-ph2021★ 63 cited

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…

quant-ph2021

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…

quant-ph2018★ 47 cited

A Case for Variability-Aware Policies for NISQ-Era Quantum Computers

Swamit S. Tannu, Moinuddin K. Qureshi

Recently, IBM, Google, and Intel showcased quantum computers ranging from 49 to 72 qubits. While these systems represent a significant milestone in the advancement of quantum compu…