activity
20162026
most citedOn Optimality of CSS Codes for Transversal

53 citations · 259 across the 33 of their papers we have counts for

collaborators

34 papers

quant-ph2026

Towards Block-Level Fault-Tolerant Quantum Simulation on Small High-Rate Non-CSS Codes

Zhuangzhuang Chen, Narayanan Rengaswamy

Small high-rate non-CSS stabilizer codes provide compact platforms for encoded quantum computation, but mixed-Pauli checks and limited native transversal logical gates complicate f…

quant-ph2026

GHZ is All You Need: Quantum Sensing with VISTA

Oskar Novak, Christos N. Gagatsos, Narayanan Rengaswamy

Quantum metrology holds the potential to enhance magnetic field sensing beyond current limits. However, in the presence of realistic noise, this advantage degrades to the Standard…

quant-ph2026

Stabilizers for Compiling Logical Circuits under Hardware Constraints

Jack Weinberg, Narayanan Rengaswamy

To implement quantum algorithms on a quantum computer, we must overcome the twin problems of fault-tolerance -- how can we realize a relatively noiseless computation by cleverly co…

quant-ph2026

Networked Realization of Quantum LDPC Codes

Swayangprabha Shaw, Narayanan Rengaswamy

Quantum low-density parity-check (QLDPC) codes with good parameters are promising candidates for low-overhead fault-tolerant quantum computing, but their non-local stabilizers requ…

cs.IT2026

Transversal gates for quantum CSS codes

Eduardo Camps-Moreno, Hiram H. López, Gretchen L. Matthews +2

In this paper, we focus on the problem of computing the set of diagonal transversal gates fixing a CSS code. We determine the logical actions of the gates as well as the groups of…

cs.IT2025

Linear Time Iterative Decoders for Hypergraph-Product and Lifted-Product Codes

Asit Kumar Pradhan, Nithin Raveendran, Narayanan Rengaswamy +1

Quantum low-density parity-check (QLDPC) codes with asymptotically non-zero rates are prominent candidates for achieving fault-tolerant quantum computation, primarily due to their…

quant-ph2025

Adaptive Entanglement Distillation

Sijie Cheng, Narayanan Rengaswamy

Quantum network applications impose a variety of requirements on entanglement resources in terms of rate, fidelity, latency, and more. The repeaters in the quantum network must com…

quant-ph2025

Fault Tolerant Quantum Simulation via Symplectic Transvections

Zhuangzhuang Chen, Jack Owen Weinberg, Narayanan Rengaswamy

Conventional approaches to fault-tolerant quantum computing realize logical circuits gate-by-gate, synthesizing each gate independently on one or more code blocks. This incurs exce…

quant-ph2025

Explaining Robust Quantum Metrology by Counting Codewords

Oskar Novak, Narayanan Rengaswamy

Quantum sensing holds great promise for high-precision magnetic field measurements. However, its performance is significantly limited by noise. The investigation of active quantum…

quant-ph2024★ 1 cited

Tutorial on Quantum Error Correction for 2024 Quantum Information Knowledge (QuIK) Workshop

Priya J. Nadkarni, Narayanan Rengaswamy, Bane Vasić

We provide a brief review of the fundamentals of quantum computation and quantum error correction for the participants of the first Quantum Information Knowledge (QuIK) workshop at…

quant-ph2024

Quantum Repeater Protocol using Quantum Error Correction for Distillation

Ashlesha Patil, Michele Pacenti, Bane Vasić +2

Bell-state measurement (BSM) on entangled states shared between quantum repeaters is the fundamental operation used to route entanglement in quantum networks. Performing BSMs on We…

quant-ph2024

GNarsil: Splitting Stabilizers into Gauges

Oskar Novak, Narayanan Rengaswamy

Quantum subsystem codes have been shown to improve error-correction performance, ease the implementation of logical operations on codes, and make stabilizer measurements easier by…

quant-ph2024★ 1 cited

Tailoring Fault-Tolerance to Quantum Algorithms

Zhuangzhuang Chen, Narayanan Rengaswamy

The standard approach to universal fault-tolerant quantum computing is to develop a general purpose quantum error correction mechanism that can implement a universal set of logical…

quant-ph2022★ 12 cited

Entanglement Purification with Quantum LDPC Codes and Iterative Decoding

Narayanan Rengaswamy, Nithin Raveendran, Ankur Raina +1

Recent constructions of quantum low-density parity-check (QLDPC) codes provide optimal scaling of the number of logical qubits and the minimum distance in terms of the code length,…

quant-ph2022★ 2 cited

Soft Syndrome Decoding of Quantum LDPC Codes for Joint Correction of Data and Syndrome Errors

Nithin Raveendran, Narayanan Rengaswamy, Asit Kumar Pradhan +1

Quantum errors are primarily detected and corrected using the measurement of syndrome information which itself is an unreliable step in practical error correction implementations.…

quant-ph2021★ 40 cited

Finite Rate QLDPC-GKP Coding Scheme that Surpasses the CSS Hamming Bound

Nithin Raveendran, Narayanan Rengaswamy, Filip Rozpędek +3

Quantum error correction has recently been shown to benefit greatly from specific physical encodings of the code qubits. In particular, several researchers have considered the indi…

quant-ph2021

Distilling GHZ States using Stabilizer Codes

Narayanan Rengaswamy, Ankur Raina, Nithin Raveendran +1

Entanglement distillation is a well-studied problem in quantum information, where one typically starts with noisy Bell pairs and distills Bell pairs of higher fidelity. Whi…

cs.IT2021★ 2 cited

A Semiclassical Proof of Duality Between the Classical BSC and the Quantum PSC

Narayanan Rengaswamy, Henry D. Pfister

In 2018, Renes [IEEE Trans. Inf. Theory, vol. 64, no. 1, pp. 577-592 (2018)] (arXiv:1701.05583) developed a general theory of channel duality for classical-input quantum-output (CQ…

quant-ph2020★ 12 cited

Mitigating Coherent Noise by Balancing Weight-2 -Stabilizers

Jingzhen Hu, Qingzhong Liang, Narayanan Rengaswamy +1

Physical platforms such as trapped ions suffer from coherent noise where errors manifest as rotations about a particular axis and can accumulate over time. We investigate passive m…

quant-ph2020

Approximate Unitary 3-Designs from Transvection Markov Chains

Xinyu Tan, Narayanan Rengaswamy, Robert Calderbank

Unitary -designs are probabilistic ensembles of unitary matrices whose first statistical moments match that of the full unitary group endowed with the Haar measure. In prior…

cs.IT2020★ 1 cited

Describing quantum metrology with erasure errors using weight distributions of classical codes

Yingkai Ouyang, Narayanan Rengaswamy

Quantum sensors are expected to be a prominent use-case of quantum technologies, but in practice, noise easily degrades their performance. Quantum sensors can for instance be affli…

quant-ph2020★ 16 cited

Un-Weyl-ing the Clifford Hierarchy

Tefjol Pllaha, Narayanan Rengaswamy, Olav Tirkkonen +1

The teleportation model of quantum computation introduced by Gottesman and Chuang (1999) motivated the development of the Clifford hierarchy. Despite its intrinsic value for quantu…

cs.IT2020

On Cyclic Polar Codes and The Burst Erasure Performance of Spatially-Coupled LDPC Codes

Narayanan Rengaswamy

Polar codes were introduced in 2009 and proven to achieve the symmetric capacity of any binary-input discrete memoryless channel under low-complexity successive cancellation decodi…

quant-ph2020★ 2 cited

Classical Coding Approaches to Quantum Applications

Narayanan Rengaswamy

Quantum information science strives to leverage the quantum-mechanical nature of our universe in order to achieve large improvements in certain information processing tasks. In dee…