Searcharxiv⌕ Search

arXiv subjects

Pranav Srinivas Murali

Publications and source records attributed to Pranav Srinivas Murali.

2 recordsLinked to original sources

Distilling Knowledge from Search: Decoder Model Factory for Quantum LDPC Codes

We introduce GraphMP, a learning-based message-passing decoder for quantum low-density parity-check codes that transfers without fine-tuning across code families, code sizes, physical error rates, and noise models. Its local message passing keeps computation scalable as the decoding graph grows. We further embed GraphMP in a beam-search algorithm that progressively refines candidate error patterns, trading additional decoding time for lower logical error rates. To turn this decoding effort into lasting improvements, we propose the decoder model factory, a paradigm for training successive models on data collected by earlier models during decoding. In our implementation, verified search trajectories provide reusable training data for distilling knowledge into subsequent models. Across generations, the model factory yields a search-enhanced decoder that is broadly competitive with Relay-BP. On the largest code block, which encodes $4612$ logical qubits, it achieves a lower logical error rate and about $20$ times the decoding throughput of the standard Relay-BP baseline. These results motivate a coupled quantum-classical architecture with two interacting cycles: rapid decoding protects quantum information, while slower learning adapts the models to changing noise conditions. The long-term vision is a scalable decoder model factory that continually produces high-performance, low-latency decoders for evolving quantum hardware.

quant-ph↗

Quantum Data Processing Unit for Neutral-Atom Quantum Computers

Quantum computers need real-time classical processing to convert measurement data into feedback within device-specific timing constraints. We introduce the quantum data processing unit (QDPU), an architecture between a quantum device and its controller. Its core is a machine-learned quantum data model (QDM), adapted to the measurement response and noise characteristics of the device. We implement an FPGA pipeline for neutral-atom array assembly that performs occupancy detection and rearrangement scheduling in FPGA logic. One calibrated matched-filter lane classifies a $50\times50$ array in 12.5 $μ$s. An atom-loss model using a software reference planner evaluates a $35\times35$ target with a 60 s trap lifetime and 0.1% loss per moved atom. Removing an assumed 150 ms host round trip raises the predicted assembly success from 8% to 85% and reduces the wall-clock time per successful assembly from 19 s to 0.16 s. A GPU-based outer loop is proposed for refitting model parameters between runs. Its NVQLink transport is measured on the board: over 10 GbE to an NVIDIA DGX Spark, the median FPGA-to-host-to-FPGA round trip is 2.74 $μ$s for 128-byte messages forwarded by a CPU core. A separate 12-bit learned qLDPC kernel is placed and routed for the same FPGA target, with a derived latency of 0.84 ms per round for a $[[1122,148]]$ lifted-product code under code-capacity noise. A quantised GraphMP ranking kernel for the same code runs on the board with a median host-to-FPGA-to-host latency of 50.5 $μ$s with one shot in flight, excluding host-side BP+OSD post-processing. Together, these implementations illustrate a shared architecture with workload-specific models and timing requirements.

quant-ph↗