56 citations · 127 across the 17 of their papers we have counts for
17 papers
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…
Trapping Sets of Detector Error Models
Michele Pacenti, Nithin Raveendran, Bane Vasic
Message-passing decoders are among the most promising candidates for scalable quantum error correction, yet their behavior in the low-error-rate regime remains poorly understood un…
Impulse Decoding of Quantum LDPC Codes: Equivalence of Degeneracy and Code-Shortening
Shobhit Bhatnagar, Michele Pacenti, Nithin Raveendran +2
Quantum error correction is essential for building scalable quantum computers. Within the stabilizer formalism, the Calderbank-Shor-Steane framework constructs quantum codes from p…
Quantum Low-Density Parity-Check Codes
Bane Vasic, Valentin Savin, Michele Pacenti +2
Quantum error correction (QEC) is a cornerstone of quantum computing, enabling reliable information processing in the presence of noise. Sparse stabilizer codes -- referred to gene…
Fault Tolerant Decoding of QLDPC-GKP Codes with Circuit Level Soft Information
Shantom K. Borah, Asit K. Pradhan, Nithin Raveendran +2
Concatenated bosonic-stabilizer codes have recently gained prominence as promising candidates for achieving low-overhead fault-tolerant quantum computing in the long term. In such…
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)…
Enhanced Min-Sum Decoding of Quantum Codes Using Previous Iteration Dynamics
Dimitris Chytas, Nithin Raveendran, Bane Vasic
In this paper, we propose a novel message-passing decoding approach that leverages the degeneracy of quantum low-density parity-check codes to enhance decoding performance, elimina…
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…
Constant-Overhead Fault-Tolerant Quantum Computation with Reconfigurable Atom Arrays
Qian Xu, J. Pablo Bonilla Ataides, Christopher A. Pattison +7
Quantum low-density parity-check (qLDPC) codes can achieve high encoding rates and good code distance scaling, providing a promising route to low-overhead fault-tolerant quantum co…
Neuro-OSVETA: A Robust Watermarking of 3D Meshes
Bata Vasc, Nithin Raveendran, Bane Vasic
Best and practical watermarking schemes for copyright protection of 3D meshes are required to be blind and robust to attacks and errors. In this paper, we present the latest develo…
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,…
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.…
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…
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…
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…