{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:ZPSIJBPMVGEYV2HM5FT7EHBHGZ","short_pith_number":"pith:ZPSIJBPM","schema_version":"1.0","canonical_sha256":"cbe48485eca9898ae8ece967f21c273652a2b219cf92170b82b044ee9d8d55cd","source":{"kind":"arxiv","id":"2405.03776","version":1},"attestation_state":"computed","paper":{"title":"Near-optimal decoding algorithm for color codes using Population Annealing","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Fernando Mart\\'inez-Garc\\'ia, Francisco Revson F. Pereira, Pedro Parrado-Rodr\\'iguez","submitted_at":"2024-05-06T18:17:42Z","abstract_excerpt":"The development and use of large-scale quantum computers relies on integrating quantum error-correcting (QEC) schemes into the quantum computing pipeline. A fundamental part of the QEC protocol is the decoding of the syndrome to identify a recovery operation with a high success rate. In this work, we implement a decoder that finds the recovery operation with the highest success probability by mapping the decoding problem to a spin system and using Population Annealing to estimate the free energy of the different error classes. We study the decoder performance on a 4.8.8 color code lattice unde"},"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":"2405.03776","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2024-05-06T18:17:42Z","cross_cats_sorted":[],"title_canon_sha256":"d30ac9b06e5aecb89db9dbaa3027f2e11713bdc8315f35a10c432818768b8a27","abstract_canon_sha256":"9383c6ca4e74cd287abe10e39ee78fe7eda183cef8d54100dcc8e9bffc7ada79"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:16:10.631071Z","signature_b64":"R6nrhAKjnSVhyN6JhPe22+mxRhhwI+F+5tVdlZLTD1qXlnaZP5Ct1as5IDuLQtdIQabZNHGZiaurkcH36pSzDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cbe48485eca9898ae8ece967f21c273652a2b219cf92170b82b044ee9d8d55cd","last_reissued_at":"2026-07-05T08:16:10.630524Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:16:10.630524Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Near-optimal decoding algorithm for color codes using Population Annealing","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Fernando Mart\\'inez-Garc\\'ia, Francisco Revson F. Pereira, Pedro Parrado-Rodr\\'iguez","submitted_at":"2024-05-06T18:17:42Z","abstract_excerpt":"The development and use of large-scale quantum computers relies on integrating quantum error-correcting (QEC) schemes into the quantum computing pipeline. A fundamental part of the QEC protocol is the decoding of the syndrome to identify a recovery operation with a high success rate. In this work, we implement a decoder that finds the recovery operation with the highest success probability by mapping the decoding problem to a spin system and using Population Annealing to estimate the free energy of the different error classes. We study the decoder performance on a 4.8.8 color code lattice unde"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2405.03776","kind":"arxiv","version":1},"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/2405.03776/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":"2405.03776","created_at":"2026-07-05T08:16:10.630591+00:00"},{"alias_kind":"arxiv_version","alias_value":"2405.03776v1","created_at":"2026-07-05T08:16:10.630591+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2405.03776","created_at":"2026-07-05T08:16:10.630591+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZPSIJBPMVGEY","created_at":"2026-07-05T08:16:10.630591+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZPSIJBPMVGEYV2HM","created_at":"2026-07-05T08:16:10.630591+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZPSIJBPM","created_at":"2026-07-05T08:16:10.630591+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2501.07638","citing_title":"Problem hardness of diluted Ising models: Population Annealing versus Simulated Annealing","ref_index":38,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/ZPSIJBPMVGEYV2HM5FT7EHBHGZ","json":"https://pith.science/pith/ZPSIJBPMVGEYV2HM5FT7EHBHGZ.json","graph_json":"https://pith.science/api/pith-number/ZPSIJBPMVGEYV2HM5FT7EHBHGZ/graph.json","events_json":"https://pith.science/api/pith-number/ZPSIJBPMVGEYV2HM5FT7EHBHGZ/events.json","paper":"https://pith.science/paper/ZPSIJBPM"},"agent_actions":{"view_html":"https://pith.science/pith/ZPSIJBPMVGEYV2HM5FT7EHBHGZ","download_json":"https://pith.science/pith/ZPSIJBPMVGEYV2HM5FT7EHBHGZ.json","view_paper":"https://pith.science/paper/ZPSIJBPM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2405.03776&json=true","fetch_graph":"https://pith.science/api/pith-number/ZPSIJBPMVGEYV2HM5FT7EHBHGZ/graph.json","fetch_events":"https://pith.science/api/pith-number/ZPSIJBPMVGEYV2HM5FT7EHBHGZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZPSIJBPMVGEYV2HM5FT7EHBHGZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZPSIJBPMVGEYV2HM5FT7EHBHGZ/action/storage_attestation","attest_author":"https://pith.science/pith/ZPSIJBPMVGEYV2HM5FT7EHBHGZ/action/author_attestation","sign_citation":"https://pith.science/pith/ZPSIJBPMVGEYV2HM5FT7EHBHGZ/action/citation_signature","submit_replication":"https://pith.science/pith/ZPSIJBPMVGEYV2HM5FT7EHBHGZ/action/replication_record"}},"created_at":"2026-07-05T08:16:10.630591+00:00","updated_at":"2026-07-05T08:16:10.630591+00:00"}