activity
20132026
most citedThe Classical Capacity of Additive Quantum Queue-Channels

15 citations · 41 across the 27 of their papers we have counts for

collaborators
Showing quant-phShow all

8 papers · 1 filter

quant-ph2026

Optimal Resource Scaling for Early Fault Tolerant Iterative Quantum Phase Estimation under Cost Error Tradeoffs

Mrudula A Mahindrakar, Avhishek Chatterjee

The iterative quantum phase estimation algorithm (IPEA) is better suited for NISQ and early fault-tolerant hardware compared to the original algorithm, which requires the inverse q…

quant-ph2026

Maximizing Qubit Throughput under Buffer Decoherence and Variability in Generation

Padma Priyanka, Avhishek Chatterjee, Sheetal Kalyani

Quantum communication networks require transmission of high-fidelity, uncoded qubits for applications such as entanglement distribution and quantum key distribution. However, curre…

quant-ph2025

Expander qLDPC Codes against Long-range Correlated Errors in Memory

Yash Deepak Kashtikar, Pranay Mathur, Sudharsan Senthil +1

Fault-tolerance using constant space-overhead against long-range correlated errors is an important practical question. In the pioneering works [Terhal and Burkard, PRA 2005], [Alif…

quant-ph2024

Limited Parallelization in Gate Operations Leads to Higher Space Overhead and Lower Noise Threshold

Sai Sanjay Narayanan, Smita Bagewadi, Avhishek Chatterjee

In a modern error corrected quantum memory or circuit, parallelization of gate operations is severely restricted due to issues like cross-talk. Hence, there are enough idle qubits…

quant-ph2024

Effect of Correlated Errors on Quantum Memory

Smita Bagewadi, Avhishek Chatterjee

Recent results on constant overhead LDPC code-based fault-tolerance against i.i.d. errors naturally lead to the question of fault-tolerance against errors with long-range correlati…

quant-ph2023★ 1 cited

Limits of Fault-Tolerance on Resource-Constrained Quantum Circuits for Classical Problems

Uthirakalyani. G, Anuj K. Nayak, Avhishek Chatterjee +1

Existing lower bounds on redundancy in fault-tolerant quantum circuits are applicable when both the input and the intended output are quantum states. These bounds may not necessari…

quant-ph2022★ 3 cited

A Converse for Fault-tolerant Quantum Computation

Uthirakalyani G, Anuj K. Nayak, Avhishek Chatterjee

As techniques for fault-tolerant quantum computation keep improving, it is natural to ask: what is the fundamental lower bound on redundancy? In this paper, we obtain a lower bound…

quant-ph2021★ 2 cited

Unital Qubit Queue-channels: Classical Capacity and Product Decoding

Vikesh Siddhu, Avhishek Chatterjee, Krishna Jagannathan +2

Quantum queue-channels arise naturally in the context of buffering in quantum networks, wherein the noise suffered by the quantum states depends on the time spent waiting in the bu…