{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:4XZT4TW4BYKUA5JOEKCECLZ2WF","short_pith_number":"pith:4XZT4TW4","schema_version":"1.0","canonical_sha256":"e5f33e4edc0e1540752e2284412f3ab15643b1d3b53167ae6101e62d6cdba583","source":{"kind":"arxiv","id":"2308.05152","version":2},"attestation_state":"computed","paper":{"title":"Quantum Lego Expansion Pack: Enumerators from Tensor Networks","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cond-mat.str-el"],"primary_cat":"quant-ph","authors_text":"Brad Lackey, ChunJun Cao, Michael J. Gullans, Zitao Wang","submitted_at":"2023-08-09T18:00:02Z","abstract_excerpt":"We provide the first tensor network method for computing quantum weight enumerator polynomials in the most general form. If a quantum code has a known tensor network construction of its encoding map, our method is far more efficient, and in some cases exponentially faster than the existing approach. As a corollary, it produces decoders and an algorithm that computes the code distance. For non-(Pauli)-stabilizer codes, this constitutes the current best algorithm for computing the code distance. For degenerate stabilizer codes, it can be substantially faster compared to the current methods. We a"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"2308.05152","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2023-08-09T18:00:02Z","cross_cats_sorted":["cond-mat.str-el"],"title_canon_sha256":"e7aac7a84f4d42372ba2456c019bcc4ba3432c4c4edb10f76d7faf6b160f7e1d","abstract_canon_sha256":"716a366ed63939a8db8ca2fcf43aa6c6f5b1d6a47866bfaaa110855f6c5b7209"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:51:10.013799Z","signature_b64":"6Er8DzwUetpvTsqFcgJXzdzBUGt1dXhuKONzgCy8a5eXyQ3j9iE5rtoUSEn4Iv0H/hzv6rR535pilRIy/b3WBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e5f33e4edc0e1540752e2284412f3ab15643b1d3b53167ae6101e62d6cdba583","last_reissued_at":"2026-07-05T07:51:10.013363Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:51:10.013363Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Quantum Lego Expansion Pack: Enumerators from Tensor Networks","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cond-mat.str-el"],"primary_cat":"quant-ph","authors_text":"Brad Lackey, ChunJun Cao, Michael J. Gullans, Zitao Wang","submitted_at":"2023-08-09T18:00:02Z","abstract_excerpt":"We provide the first tensor network method for computing quantum weight enumerator polynomials in the most general form. If a quantum code has a known tensor network construction of its encoding map, our method is far more efficient, and in some cases exponentially faster than the existing approach. As a corollary, it produces decoders and an algorithm that computes the code distance. For non-(Pauli)-stabilizer codes, this constitutes the current best algorithm for computing the code distance. For degenerate stabilizer codes, it can be substantially faster compared to the current methods. We a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2308.05152","kind":"arxiv","version":2},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2308.05152/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"aliases":[{"alias_kind":"arxiv","alias_value":"2308.05152","created_at":"2026-07-05T07:51:10.013420+00:00"},{"alias_kind":"arxiv_version","alias_value":"2308.05152v2","created_at":"2026-07-05T07:51:10.013420+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2308.05152","created_at":"2026-07-05T07:51:10.013420+00:00"},{"alias_kind":"pith_short_12","alias_value":"4XZT4TW4BYKU","created_at":"2026-07-05T07:51:10.013420+00:00"},{"alias_kind":"pith_short_16","alias_value":"4XZT4TW4BYKUA5JO","created_at":"2026-07-05T07:51:10.013420+00:00"},{"alias_kind":"pith_short_8","alias_value":"4XZT4TW4","created_at":"2026-07-05T07:51:10.013420+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2506.13619","citing_title":"Blocklet concatenation: Low-overhead fault-tolerant protocols for fusion-based quantum computation","ref_index":22,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/4XZT4TW4BYKUA5JOEKCECLZ2WF","json":"https://pith.science/pith/4XZT4TW4BYKUA5JOEKCECLZ2WF.json","graph_json":"https://pith.science/api/pith-number/4XZT4TW4BYKUA5JOEKCECLZ2WF/graph.json","events_json":"https://pith.science/api/pith-number/4XZT4TW4BYKUA5JOEKCECLZ2WF/events.json","paper":"https://pith.science/paper/4XZT4TW4"},"agent_actions":{"view_html":"https://pith.science/pith/4XZT4TW4BYKUA5JOEKCECLZ2WF","download_json":"https://pith.science/pith/4XZT4TW4BYKUA5JOEKCECLZ2WF.json","view_paper":"https://pith.science/paper/4XZT4TW4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2308.05152&json=true","fetch_graph":"https://pith.science/api/pith-number/4XZT4TW4BYKUA5JOEKCECLZ2WF/graph.json","fetch_events":"https://pith.science/api/pith-number/4XZT4TW4BYKUA5JOEKCECLZ2WF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4XZT4TW4BYKUA5JOEKCECLZ2WF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4XZT4TW4BYKUA5JOEKCECLZ2WF/action/storage_attestation","attest_author":"https://pith.science/pith/4XZT4TW4BYKUA5JOEKCECLZ2WF/action/author_attestation","sign_citation":"https://pith.science/pith/4XZT4TW4BYKUA5JOEKCECLZ2WF/action/citation_signature","submit_replication":"https://pith.science/pith/4XZT4TW4BYKUA5JOEKCECLZ2WF/action/replication_record"}},"created_at":"2026-07-05T07:51:10.013420+00:00","updated_at":"2026-07-05T07:51:10.013420+00:00"}