activity
20162026
most citedOn Optimality of CSS Codes for Transversal

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

collaborators
Showing cs.ITShow all

10 papers · 1 filter

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…

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…

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…

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…

cs.IT2020★ 14 cited

Classical Coding Problem from Transversal Gates

Narayanan Rengaswamy, Robert Calderbank, Michael Newman +1

Universal quantum computation requires the implementation of a logical non-Clifford gate. In this paper, we characterize all stabilizer codes whose code subspaces are preserved und…

cs.IT2019★ 9 cited

Kerdock Codes Determine Unitary 2-Designs

Trung Can, Narayanan Rengaswamy, Robert Calderbank +1

The non-linear binary Kerdock codes are known to be Gray images of certain extended cyclic codes of length over . We show that exponentiating these $\mathbb…

cs.IT2018★ 16 cited

Synthesis of Logical Clifford Operators via Symplectic Geometry

Narayanan Rengaswamy, Robert Calderbank, Swanand Kadhe +1

Quantum error-correcting codes can be used to protect qubits involved in quantum computation. This requires that logical operators acting on protected qubits be translated to physi…

cs.IT2016★ 9 cited

Finite-Length Analysis of Spatially-Coupled Regular LDPC Ensembles on Burst-Erasure Channels

Vahid Aref, Narayanan Rengaswamy, Laurent Schmalen

Regular spatially-Coupled LDPC (SC-LDPC) ensembles have gained significant interest since they were shown to universally achieve the capacity of binary memoryless channels under lo…

cs.IT2016

Spatially Coupled LDPC Codes Affected by a Single Random Burst of Erasures

Vahid Aref, Narayanan Rengaswamy, Laurent Schmalen

Spatially-Coupled LDPC (SC-LDPC) ensembles achieve the capacity of binary memoryless channels (BMS), asymptotically, under belief-propagation (BP) decoding. In this paper, we study…