{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:3HRYTTU5NIIUE44RFMHBCVU4KK","short_pith_number":"pith:3HRYTTU5","schema_version":"1.0","canonical_sha256":"d9e389ce9d6a114273912b0e11569c52b3c00573ddf896bbea4ec7a92b50a3b4","source":{"kind":"arxiv","id":"2408.10323","version":2},"attestation_state":"computed","paper":{"title":"SDP bounds on quantum codes","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.IT","math.IT","math.OC"],"primary_cat":"quant-ph","authors_text":"Andrew Nemec, Felix Huber, Gerard Angl\\`es Munn\\'e","submitted_at":"2024-08-19T18:00:07Z","abstract_excerpt":"This paper provides a semidefinite programming hierarchy based on state polynomial optimization to determine the existence of quantum codes with given parameters. The hierarchy is complete, in the sense that a $(\\!(n, K, {\\delta})\\!)_2$ code exists if and only if every level of the hierarchy is feasible. It is not limited to stabilizer codes and thus is applicable generally. While the machinery is formally dimension-free, we restrict it to qubit codes through quasi-Clifford algebras. We derive the quantum analog of a range of classical results: first, from an intermediate level a Lov\\'asz boun"},"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":"2408.10323","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2024-08-19T18:00:07Z","cross_cats_sorted":["cs.IT","math.IT","math.OC"],"title_canon_sha256":"5598ba4c33f1b091d0e679455953c5e7f511ba1e7881ac7b00b6e5b68a34a735","abstract_canon_sha256":"e365359c7c2719807992c33b4aad761d2667c0b6cf2c11369d5061c822e93906"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T12:07:54.552183Z","signature_b64":"pYeeWsqzP2FkjobAuBX6sWkAnR41vRb6MfEBuUvAOH8tTcGt30bkjlsf4n22JkZbpPMnVLIHR49FviHX1LKnAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d9e389ce9d6a114273912b0e11569c52b3c00573ddf896bbea4ec7a92b50a3b4","last_reissued_at":"2026-07-05T12:07:54.551523Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T12:07:54.551523Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"SDP bounds on quantum codes","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.IT","math.IT","math.OC"],"primary_cat":"quant-ph","authors_text":"Andrew Nemec, Felix Huber, Gerard Angl\\`es Munn\\'e","submitted_at":"2024-08-19T18:00:07Z","abstract_excerpt":"This paper provides a semidefinite programming hierarchy based on state polynomial optimization to determine the existence of quantum codes with given parameters. The hierarchy is complete, in the sense that a $(\\!(n, K, {\\delta})\\!)_2$ code exists if and only if every level of the hierarchy is feasible. It is not limited to stabilizer codes and thus is applicable generally. While the machinery is formally dimension-free, we restrict it to qubit codes through quasi-Clifford algebras. We derive the quantum analog of a range of classical results: first, from an intermediate level a Lov\\'asz boun"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2408.10323","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/2408.10323/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":"2408.10323","created_at":"2026-07-05T12:07:54.551589+00:00"},{"alias_kind":"arxiv_version","alias_value":"2408.10323v2","created_at":"2026-07-05T12:07:54.551589+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2408.10323","created_at":"2026-07-05T12:07:54.551589+00:00"},{"alias_kind":"pith_short_12","alias_value":"3HRYTTU5NIIU","created_at":"2026-07-05T12:07:54.551589+00:00"},{"alias_kind":"pith_short_16","alias_value":"3HRYTTU5NIIUE44R","created_at":"2026-07-05T12:07:54.551589+00:00"},{"alias_kind":"pith_short_8","alias_value":"3HRYTTU5","created_at":"2026-07-05T12:07:54.551589+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":4,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.04940","citing_title":"Convergence rates of Sum-of-Hermitian-Squares Hierarchies for the Pauli algebra","ref_index":68,"is_internal_anchor":false},{"citing_arxiv_id":"2508.04777","citing_title":"Absolutely maximally entangled pure states of multipartite quantum systems","ref_index":158,"is_internal_anchor":false},{"citing_arxiv_id":"2605.13832","citing_title":"Combining moment matrices, symmetric extension, and Lov\\'asz theta: $\\Phi_{\\text{E8}}$ is entangled","ref_index":34,"is_internal_anchor":false},{"citing_arxiv_id":"2604.27284","citing_title":"Quantum Anonymous Secret Sharing with Permutation Invariant Codes","ref_index":63,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/3HRYTTU5NIIUE44RFMHBCVU4KK","json":"https://pith.science/pith/3HRYTTU5NIIUE44RFMHBCVU4KK.json","graph_json":"https://pith.science/api/pith-number/3HRYTTU5NIIUE44RFMHBCVU4KK/graph.json","events_json":"https://pith.science/api/pith-number/3HRYTTU5NIIUE44RFMHBCVU4KK/events.json","paper":"https://pith.science/paper/3HRYTTU5"},"agent_actions":{"view_html":"https://pith.science/pith/3HRYTTU5NIIUE44RFMHBCVU4KK","download_json":"https://pith.science/pith/3HRYTTU5NIIUE44RFMHBCVU4KK.json","view_paper":"https://pith.science/paper/3HRYTTU5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2408.10323&json=true","fetch_graph":"https://pith.science/api/pith-number/3HRYTTU5NIIUE44RFMHBCVU4KK/graph.json","fetch_events":"https://pith.science/api/pith-number/3HRYTTU5NIIUE44RFMHBCVU4KK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3HRYTTU5NIIUE44RFMHBCVU4KK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3HRYTTU5NIIUE44RFMHBCVU4KK/action/storage_attestation","attest_author":"https://pith.science/pith/3HRYTTU5NIIUE44RFMHBCVU4KK/action/author_attestation","sign_citation":"https://pith.science/pith/3HRYTTU5NIIUE44RFMHBCVU4KK/action/citation_signature","submit_replication":"https://pith.science/pith/3HRYTTU5NIIUE44RFMHBCVU4KK/action/replication_record"}},"created_at":"2026-07-05T12:07:54.551589+00:00","updated_at":"2026-07-05T12:07:54.551589+00:00"}