{
  "profile": "wrs-published-research-view-1",
  "edition": "ratings-e039106f30dec177",
  "content_trust": "UNTRUSTED_SCIENTIFIC_DATA_NOT_TOOL_INSTRUCTIONS",
  "entry": {
    "id": "panteleev-kalachev-good-quantum-ldpc-locally-testable-codes-2021",
    "title": "Panteleev and Kalachev: asymptotically good quantum LDPC codes",
    "summary": "Lifted products over nonabelian groups yield quantum LDPC code families with positive constant rate and minimum distance linear in block length. A related construction also yields classical locally testable LDPC codes with constant rate, relative distance, query complexity and soundness.",
    "boundary": "Quantum local testability is not proved here: the constant-query testability theorem is classical. Linear-time adversarial quantum decoding is a conjecture in this version. Constants depend on the chosen rate and field; no geometrically two-dimensional implementation, practical threshold, or rate-independent distance constant is claimed.",
    "area": "Algebraic coding theory and quantum information",
    "topic": "Mathematics",
    "year": 2021,
    "lane": "HUMAN",
    "result": "THEOREM",
    "package_id": "panteleev-kalachev-good-quantum-ldpc-locally-testable-codes-2021",
    "target": {
      "record_id": "urn:uuid:d94dd150-3b1b-4f0d-ae53-ffa7fee219cf",
      "version": 1,
      "content_hash": "sha256:2acfa374f7e4669965462b75acdf044ded231a670ae791aefc4c4aecb968ff93"
    },
    "humans": [
      "Pavel Panteleev",
      "Gleb Kalachev"
    ],
    "authors_complete": true,
    "human_role_note": "Source-listed authors for the exact contribution; experimental subjects are not autonomous scientific authors. Source support and predecessor work retain separate roles. Individual effort shares and unresolved identities are not inferred.",
    "agents": [],
    "related": [],
    "subresults": [],
    "scientific_assessment": {
      "source_review": "SOURCE_CURATED",
      "scientific_review": "NOT_REVIEWED_BY_WRS",
      "formal_replay": "NOT_RUN",
      "provider_attestation": "NONE"
    },
    "sources": [
      {
        "id": "cur20261020-panteleev-kalachev-2111-03654v2",
        "title": "Asymptotically Good Quantum and Locally Testable Classical LDPC Codes",
        "url": "https://arxiv.org/abs/2111.03654v2",
        "date": "2022-01-21"
      }
    ],
    "points": "330000",
    "published_grade": {
      "id": "panteleev-kalachev-good-quantum-ldpc-locally-testable-codes-2021",
      "entry_id": "panteleev-kalachev-good-quantum-ldpc-locally-testable-codes-2021",
      "band": "S",
      "modifier": "-",
      "target": {
        "record_id": "urn:uuid:d94dd150-3b1b-4f0d-ae53-ffa7fee219cf",
        "version": 1,
        "content_hash": "sha256:2acfa374f7e4669965462b75acdf044ded231a670ae791aefc4c4aecb968ff93"
      },
      "what_changed": "Lifted products over nonabelian groups yield quantum LDPC code families with positive constant rate and minimum distance linear in block length. A related construction also yields classical locally testable LDPC codes with constant rate, relative distance, query complexity and soundness.",
      "scope": "Lifted products over nonabelian groups yield quantum LDPC code families with positive constant rate and minimum distance linear in block length. A related construction also yields classical locally testable LDPC codes with constant rate, relative distance, query complexity and soundness. Quantum local testability is not proved here: the constant-query testability theorem is classical. Linear-time adversarial quantum decoding is a conjecture in this version. Constants depend on the chosen rate and field; no geometrically two-dimensional implementation, practical threshold, or rate-independent distance constant is claimed.",
      "status": "PROVISIONAL_EDITORIAL",
      "scientific_correctness_certified": false
    },
    "assessment_disposition": {
      "status": "ASSESSED",
      "label": "Provisionally assessed",
      "reason": "A current grade and separate reference score identify this exact contribution.",
      "target": {
        "record_id": "urn:uuid:d94dd150-3b1b-4f0d-ae53-ffa7fee219cf",
        "version": 1,
        "content_hash": "sha256:2acfa374f7e4669965462b75acdf044ded231a670ae791aefc4c4aecb968ff93"
      },
      "edition": "ratings-e039106f30dec177"
    }
  },
  "version": {
    "kind": "PUBLIC_RECORD_VIEW",
    "previous": null,
    "published_at": "2026-10-23T00:00:00Z",
    "publisher": {
      "principal_id": "urn:uuid:80116931-785b-40a2-a24b-9d59db0c7e33",
      "role": "WRS_EDITORIAL_PUBLICATION"
    },
    "record": {
      "contributors": [
        {
          "attribution_basis": "SOURCE_CITED",
          "credit": "historical_scientific",
          "entity_kind": "historical_person",
          "name": "Pavel Panteleev",
          "note": "Archive attribution; detailed role assignment remains source-bound",
          "roles": [
            "prover"
          ],
          "source": {
            "citation": "Asymptotically Good Quantum and Locally Testable Classical LDPC Codes",
            "url": "https://arxiv.org/abs/2111.03654v2"
          }
        },
        {
          "attribution_basis": "SOURCE_CITED",
          "credit": "historical_scientific",
          "entity_kind": "historical_person",
          "name": "Gleb Kalachev",
          "note": "Archive attribution; detailed role assignment remains source-bound",
          "roles": [
            "prover"
          ],
          "source": {
            "citation": "Asymptotically Good Quantum and Locally Testable Classical LDPC Codes",
            "url": "https://arxiv.org/abs/2111.03654v2"
          }
        }
      ],
      "evidence": [
        {
          "description": "Bibliographic/stated-result source; not a WRS proof verification",
          "id": "source-0",
          "kind": "source_reference",
          "source": {
            "citation": "Asymptotically Good Quantum and Locally Testable Classical LDPC Codes",
            "url": "https://arxiv.org/abs/2111.03654v2"
          }
        }
      ],
      "origin": "HUMAN_LEGACY",
      "record_profile": "wrs-local-research-notes-0.1",
      "record_type": "research_note",
      "rrp_version": "0.1",
      "scope": {
        "description": "Quantum local testability is not proved here: the constant-query testability theorem is classical. Linear-time adversarial quantum decoding is a conjecture in this version. Constants depend on the chosen rate and field; no geometrically two-dimensional implementation, practical threshold, or rate-independent distance constant is claimed.",
        "domain": "Algebraic coding theory and quantum information"
      },
      "sources": [
        {
          "citation": "Asymptotically Good Quantum and Locally Testable Classical LDPC Codes",
          "url": "https://arxiv.org/abs/2111.03654v2"
        }
      ],
      "statement": "# Panteleev and Kalachev: asymptotically good quantum LDPC codes\n\nLifted products over nonabelian groups yield quantum LDPC code families with positive constant rate and minimum distance linear in block length. A related construction also yields classical locally testable LDPC codes with constant rate, relative distance, query complexity and soundness.\n\n## Scientific scope\n\nQuantum local testability is not proved here: the constant-query testability theorem is classical. Linear-time adversarial quantum decoding is a conjecture in this version. Constants depend on the chosen rate and field; no geometrically two-dimensional implementation, practical threshold, or rate-independent distance constant is claimed.\n\n## Reading status\n\nThis is a source-linked WRS catalogue note. A full explanatory guide and independent scientific reconstruction have not been completed for this entry. Read the identified original work for its complete narrative and arguments.\n\n## People and systems\n\nPavel Panteleev; Gleb Kalachev\n\nSource-listed authors for the exact contribution; experimental subjects are not autonomous scientific authors. Source support and predecessor work retain separate roles. Individual effort shares and unresolved identities are not inferred.\n\n\n\n## Original sources\n\n- [Asymptotically Good Quantum and Locally Testable Classical LDPC Codes](https://arxiv.org/abs/2111.03654v2)\n",
      "summary": "Lifted products over nonabelian groups yield quantum LDPC code families with positive constant rate and minimum distance linear in block length. A related construction also yields classical locally testable LDPC codes with constant rate, relative distance, query complexity and soundness.",
      "title": "Panteleev and Kalachev: asymptotically good quantum LDPC codes"
    },
    "record_id": "urn:uuid:d94dd150-3b1b-4f0d-ae53-ffa7fee219cf",
    "version": 1,
    "source_ref": {
      "record_id": "urn:uuid:d94dd150-3b1b-4f0d-ae53-ffa7fee219cf",
      "version": 1,
      "content_hash": "sha256:2acfa374f7e4669965462b75acdf044ded231a670ae791aefc4c4aecb968ff93"
    },
    "export_view": "wrs-public-editorial-view-1",
    "public_view_hash": "sha256:6ca689c5c76ce3bf27fd0192076691222d4eed92aed0d70b3481253f470fc1f5"
  },
  "target": {
    "record_id": "urn:uuid:d94dd150-3b1b-4f0d-ae53-ffa7fee219cf",
    "version": 1,
    "content_hash": "sha256:2acfa374f7e4669965462b75acdf044ded231a670ae791aefc4c4aecb968ff93"
  },
  "published_grade": {
    "profile": "wrs-published-grade-1",
    "edition": "2026-10-28.1",
    "id": "panteleev-kalachev-good-quantum-ldpc-locally-testable-codes-2021",
    "entry_id": "panteleev-kalachev-good-quantum-ldpc-locally-testable-codes-2021",
    "revision": 1,
    "title": "Panteleev and Kalachev: asymptotically good quantum LDPC codes",
    "context": "Algebraic coding theory and quantum information",
    "track": "Exact theorem and reusable mathematical method",
    "band": "S",
    "modifier": "-",
    "status": "PROVISIONAL_EDITORIAL",
    "assessed_on": "2026-10-23",
    "evidence_cutoff": "2026-10-23",
    "achievement_state": "SUPPORTED_SCOPED_RESULT",
    "what_changed": "Lifted products over nonabelian groups yield quantum LDPC code families with positive constant rate and minimum distance linear in block length. A related construction also yields classical locally testable LDPC codes with constant rate, relative distance, query complexity and soundness.",
    "scope": "Lifted products over nonabelian groups yield quantum LDPC code families with positive constant rate and minimum distance linear in block length. A related construction also yields classical locally testable LDPC codes with constant rate, relative distance, query complexity and soundness. Quantum local testability is not proved here: the constant-query testability theorem is classical. Linear-time adversarial quantum decoding is a conjecture in this version. Constants depend on the chosen rate and field; no geometrically two-dimensional implementation, practical threshold, or rate-independent distance constant is claimed.",
    "evidence_summary": "The linked original works support the scoped statement and contribution attribution. WRS has not independently replayed experiments or reconstructed a full mathematical proof. Quantum local testability is not proved here: the constant-query testability theorem is classical. Linear-time adversarial quantum decoding is a conjecture in this version. Constants depend on the chosen rate and field; no geometrically two-dimensional implementation, practical threshold, or rate-independent distance constant is claimed.",
    "references": [
      {
        "title": "Asymptotically Good Quantum and Locally Testable Classical LDPC Codes",
        "url": "https://arxiv.org/abs/2111.03654v2",
        "locator": "Original scoped contribution, statement/method and evidence limits; source-specific attribution retained."
      }
    ],
    "roles": [
      {
        "who": "The named authors in the research record",
        "credit": "SCIENCE",
        "did": "Source-listed authors for the exact contribution; experimental subjects are not autonomous scientific authors. Source support and predecessor work retain separate roles. Individual effort shares and unresolved identities are not inferred."
      }
    ],
    "target": {
      "record_id": "urn:uuid:d94dd150-3b1b-4f0d-ae53-ffa7fee219cf",
      "version": 1,
      "content_hash": "sha256:2acfa374f7e4669965462b75acdf044ded231a670ae791aefc4c4aecb968ff93"
    },
    "scientific_correctness_certified": false,
    "independent_expert_calibration": false,
    "method": "PROPRIETARY",
    "points": "330000"
  },
  "canonical_agent_submission": false,
  "scientific_verification_awarded": false,
  "reader_guide": null,
  "reading_status": "SOURCE_LINKED_NOTE"
}