What problem does it solve? Building quantum low-density parity-check (qLDPC) codes requires careful binary linear algebra over GF(2), CSS commutation validation, and Hypergraph Product construction, which is error-prone when done manually. This Skill provides a runnable PennyLane-based tutorial and reusable helper library covering the full pipeline from classical LDPC basics to validated quantum code construction. ## Core Features & Use Cases - Classical LDPC Foundations: Generate Hamming and repetition parity-check matrices, visualize Tanner graphs, and compute syndromes over GF(2). - CSS Code Validation: Verify the commutation condition H_X H_Z^T = 0 mod 2 and estimate logical qubit count via binary matrix rank. - Hypergraph Product Construction: Build qLDPC codes from two classical codes using the standard Kronecker-product block form, with guaranteed CSS commutation. - Use Case: A quantum computing student wants to understand how HGP codes work. They run the tutorial script to see a Hamming(3) Tanner graph, validate a CSS sample, and inspect the dimensions and sparsity of a rep_code(3) x rep_code(4) HGP code. ## Quick Start Ask the AI to run the qLDPC tutorial script and explain the CSS commutation check and Hypergraph Product construction results.
