56 citations · 127 across the 17 of their papers we have counts for
6 papers · 1 filter
Fast Fault-Tolerant Decoders for Hypergraph Product and Lifted-Product Codes
Asit Kumar Pradhan, Nithin Raveendran, David Declercq +1
We design low-complexity, fault-tolerant decoders for quantum low-density parity-check (QLDPC) codes with the goal of reducing decoding latency. We target two major bottlenecks of…
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…
On the Minimum Distances of Finite-Length Lifted Product Quantum LDPC Codes
Nithin Raveendran, David Declercq, Bane Vasić
Quantum error correction (QEC) is critical for practical realization of fault-tolerant quantum computing, and recently proposed families of quantum low-density parity-check (QLDPC)…
Collective Bit Flipping-Based Decoding of Quantum LDPC Codes
Dimitris Chytas, Nithin Raveendran, Bane Vasić
Quantum low-density parity-check (QLDPC) codes have been proven to achieve higher minimum distances at higher code rates than surface codes. However, this family of codes imposes s…
FAID Diversity via Neural Networks
Xin Xiao, Nithin Raveendran, Bane Vasic +2
Decoder diversity is a powerful error correction framework in which a collection of decoders collaboratively correct a set of error patterns otherwise uncorrectable by any individu…
Trapping Sets of Quantum LDPC Codes
Nithin Raveendran, Bane Vasić
Iterative decoders for finite length quantum low-density parity-check (QLDPC) codes are attractive because their hardware complexity scales only linearly with the number of physica…