Swamit Tannu
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Swamit Tannu has a total of 30 co-authors. Here are the top co-authors by number of shared publications:
- Abtin Molavi
University of Wisconsin-Madison, Madison, USA
5 shared publications - Amanda Xu
University of Wisconsin-Madison, Madison, WI, USA
5 shared publications - Aws Albarghouthi
University of Wisconsin-Madison, Madison, USA
5 shared publications - Satvik Maurya
University of Wisconsin-Madison, Madison, WI, USA
4 shared publications - Chaithanya Naik Mude
University of Wisconsin-Madison
3 shared publications - Moinuddin Qureshi
Georgia Institute of Technology, Atlanta, GA, USA
2 shared publications
Latest Publications
- Open Access
- 26 April 2026
- Published by Association for Computing Machinery (ACM)
- p. 514-531
A Case for Elastic Quantum Error Correction Decoders
- 26 April 2026
- Published by Association for Computing Machinery (ACM)
- p. 514-531
Open AccessA Case for Elastic Quantum Error Correction Decoders
- 17 April 2026
- Published by American Physical Society (APS) in Physical Review Applied
- Vol. 25 (4)
Efficient measurement of neutral-atom qubits with matched filters
- 17 April 2026
- Published by American Physical Society (APS) in Physical Review Applied
- Vol. 25 (4)
Efficient measurement of neutral-atom qubits with matched filters
- Open Access
- 22 March 2026
- Published by Association for Computing Machinery (ACM)
- p. 1589-1604
Reducing T Gates with Unitary Synthesis
Quantum error correction is essential for achieving practical quantum computing but has a significant computational overhead. Among fault-tolerant (FT) gate operations, non-Clifford gates, such as T, are particularly expensive due to their reliance on magic state distillation. These costly T gates appear frequently in FT circuits as many quantum algorithms require arbitrary single-qubit rotations, such as Rx and Rz gates, which must be decomposed into a sequence of T and Clifford gates. In many quantum circuits, Rx and Rz gates can be fused to form a single U3 unitary. However, existing synthesis methods, such as gridsynth, rely on indirect decompositions, requiring separate Rz decompositions that result in a threefold increase in T count. This work presents TensoR-based Arbitrary unitary SYNthesis (TRASYN), a novel FT synthesis algorithm that directly synthesizes arbitrary single-qubit unitaries, avoiding the overhead of separate Rz decompositions. By leveraging tensor network-based search, our approach enables native U3 synthesis, reducing the T count, Clifford gate count, and approximation error. Compared to gridsynth-based circuit synthesis, for 187 representative benchmarks, our design reduces the T count by up to 3.5 ×, and Clifford gates by 7 ×, resulting in up to 4 × improvement in overall circuit infidelity.
- 22 March 2026
- Published by Association for Computing Machinery (ACM)
- p. 1589-1604
Open AccessReducing T Gates with Unitary Synthesis
Quantum error correction is essential for achieving practical quantum computing but has a significant computational overhead. Among fault-tolerant (FT) gate operations, non-Clifford gates, such as T, are particularly expensive due to their reliance on magic state distillation. These costly T gates appear frequently in FT circuits as many quantum algorithms require arbitrary single-qubit rotations, such as Rx and Rz gates, which must be decomposed into a sequence of T and Clifford gates. In many quantum circuits, Rx and Rz gates can be fused to form a single U3 unitary. However, existing synthesis methods, such as gridsynth, rely on indirect decompositions, requiring separate Rz decompositions that result in a threefold increase in T count. This work presents TensoR-based Arbitrary unitary SYNthesis (TRASYN), a novel FT synthesis algorithm that directly synthesizes arbitrary single-qubit unitaries, avoiding the overhead of separate Rz decompositions. By leveraging tensor network-based search, our approach enables native U3 synthesis, reducing the T count, Clifford gate count, and approximation error. Compared to gridsynth-based circuit synthesis, for 187 representative benchmarks, our design reduces the T count by up to 3.5 ×, and Clifford gates by 7 ×, resulting in up to 4 × improvement in overall circuit infidelity.
- Open Access
- 22 March 2026
- Published by Association for Computing Machinery (ACM)
- p. 1476-1491
PropHunt: Automated Optimization of Quantum Syndrome Measurement Circuits
- 22 March 2026
- Published by Association for Computing Machinery (ACM)
- p. 1476-1491
Open AccessPropHunt: Automated Optimization of Quantum Syndrome Measurement Circuits
- 6 March 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Computer Architecture Letters
- Vol. 25 (1) , 85-88
Reducing LLM Inference Memory Bandwidth via Frequent Exponent Value Encoding
We consider the issue of the memory bandwidth required for the transfer of weights of an LLM between the memory and the processor (CPU or GPU). Observing that a few exponent values dominate for FP8 and BF16 floating-point formats, we propose an alternate (compressed) representation and storage of the exponents in memory, and a design for reconstructing the full, exact weight values in the processor. The proposed approach reduces the memory bandwidth needed by up to 10% and 30% for LLMs using weight in FP8 and BF16 formats, respectively, without changing any of the computation carried out by the original LLM inference software.
- 6 March 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Computer Architecture Letters
- Vol. 25 (1) , 85-88
Reducing LLM Inference Memory Bandwidth via Frequent Exponent Value Encoding
We consider the issue of the memory bandwidth required for the transfer of weights of an LLM between the memory and the processor (CPU or GPU). Observing that a few exponent values dominate for FP8 and BF16 floating-point formats, we propose an alternate (compressed) representation and storage of the exponents in memory, and a design for reconstructing the full, exact weight values in the processor. The proposed approach reduces the memory bandwidth needed by up to 10% and 30% for LLMs using weight in FP8 and BF16 formats, respectively, without changing any of the computation carried out by the original LLM inference software.
- Open Access
- 8 January 2026
- Published by Association for Computing Machinery (ACM) in Proceedings of the ACM on Programming Languages
- Vol. 10 (POPL) , 2265-2294
Generating Compilers for Qubit Mapping and Routing
To evaluate a quantum circuit on a quantum processor, one must find a mapping from circuit qubits to processor qubits and plan the instruction execution while satisfying the processor's constraints. This is known as the qubit mapping and routing (QMR) problem. High-quality QMR solutions are key to maximizing the utility of scarce quantum resources and minimizing the probability of logical errors affecting computation. The challenge is that the landscape of quantum processors is incredibly diverse and fast-evolving. Given this diversity, dozens of papers have addressed the QMR problem for different qubit hardware, connectivity constraints, and quantum error correction schemes by a developing a new algorithm for a particular context. We present an alternative approach: automatically generating qubit mapping and routing compilers for arbitrary quantum processors. Though each QMR problem is different, we identify a common core structure—device state machine—that we use to formulate an abstract QMR problem. Our formulation naturally leads to a compact domain-specific language for specifying QMR problems and a powerful parametric algorithm that can be instantiated for any QMR specification. Our thorough evaluation on case studies of important QMR problems shows that generated compilers are competitive with handwritten, specialized compilers in terms of runtime and solution quality.
- 8 January 2026
- Published by Association for Computing Machinery (ACM) in Proceedings of the ACM on Programming Languages
- Vol. 10 (POPL) , 2265-2294
Open AccessGenerating Compilers for Qubit Mapping and Routing
To evaluate a quantum circuit on a quantum processor, one must find a mapping from circuit qubits to processor qubits and plan the instruction execution while satisfying the processor's constraints. This is known as the qubit mapping and routing (QMR) problem. High-quality QMR solutions are key to maximizing the utility of scarce quantum resources and minimizing the probability of logical errors affecting computation. The challenge is that the landscape of quantum processors is incredibly diverse and fast-evolving. Given this diversity, dozens of papers have addressed the QMR problem for different qubit hardware, connectivity constraints, and quantum error correction schemes by a developing a new algorithm for a particular context. We present an alternative approach: automatically generating qubit mapping and routing compilers for arbitrary quantum processors. Though each QMR problem is different, we identify a common core structure—device state machine—that we use to formulate an abstract QMR problem. Our formulation naturally leads to a compact domain-specific language for specifying QMR problems and a powerful parametric algorithm that can be instantiated for any QMR specification. Our thorough evaluation on case studies of important QMR problems shows that generated compilers are competitive with handwritten, specialized compilers in terms of runtime and solution quality.
- Open Access
- 17 October 2025
- Published by Association for Computing Machinery (ACM)
- p. 579-594
Accurate Leakage Speculation for Quantum Error Correction
- 17 October 2025
- Published by Association for Computing Machinery (ACM)
- p. 579-594
Open AccessAccurate Leakage Speculation for Quantum Error Correction
- Open Access
- 20 June 2025
- Published by Association for Computing Machinery (ACM)
- p. 1370-1385
Synchronization for Fault-Tolerant Quantum Computers
- 20 June 2025
- Published by Association for Computing Machinery (ACM)
- p. 1370-1385
Open AccessSynchronization for Fault-Tolerant Quantum Computers
- Open Access
- 20 June 2025
- Published by Association for Computing Machinery (ACM)
- p. 1539-1553
Accelerating Simulation of Quantum Circuits under Noise via Computational Reuse
- 20 June 2025
- Published by Association for Computing Machinery (ACM)
- p. 1539-1553
Open AccessAccelerating Simulation of Quantum Circuits under Noise via Computational Reuse
- Top Cited PapersOpen Access
- 9 April 2025
- Published by Association for Computing Machinery (ACM) in Proceedings of the ACM on Programming Languages
- Vol. 9 (OOPSLA1) , 57-84
Dependency-Aware Compilation for Surface Code Quantum Architectures
Practical applications of quantum computing depend on fault-tolerant devices with error correction. We study the problem of compiling quantum circuits for quantum computers implementing surface codes. Optimal or near-optimal compilation is critical for both efficiency and correctness. The compilation problem requires (1) mapping circuit qubits to the device qubits and (2) routing execution paths between interacting qubits. We solve this problem efficiently and near-optimally with a novel algorithm that exploits the dependency structure of circuit operations to formulate discrete optimization problems that can be approximated via simulated annealing , a classic and simple algorithm. Our extensive evaluation shows that our approach is powerful and flexible for compiling realistic workloads.
- 9 April 2025
- Published by Association for Computing Machinery (ACM) in Proceedings of the ACM on Programming Languages
- Vol. 9 (OOPSLA1) , 57-84
Top Cited PapersOpen AccessDependency-Aware Compilation for Surface Code Quantum Architectures
Practical applications of quantum computing depend on fault-tolerant devices with error correction. We study the problem of compiling quantum circuits for quantum computers implementing surface codes. Optimal or near-optimal compilation is critical for both efficiency and correctness. The compilation problem requires (1) mapping circuit qubits to the device qubits and (2) routing execution paths between interacting qubits. We solve this problem efficiently and near-optimally with a novel algorithm that exploits the dependency structure of circuit operations to formulate discrete optimization problems that can be approximated via simulated annealing , a classic and simple algorithm. Our extensive evaluation shows that our approach is powerful and flexible for compiling realistic workloads.