{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:3KNN6VVDVFEWLTLJ7ABPGQKDJJ","short_pith_number":"pith:3KNN6VVD","schema_version":"1.0","canonical_sha256":"da9adf56a3a94965cd69f802f341434a6cef3850db4440e37492135a516b0858","source":{"kind":"arxiv","id":"2409.13017","version":1},"attestation_state":"computed","paper":{"title":"Engineering Quantum Error Correction Codes Using Evolutionary Algorithms","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Dan Browne, Mark Webster","submitted_at":"2024-09-19T18:00:02Z","abstract_excerpt":"Quantum error correction and the use of quantum error correction codes is likely to be essential for the realisation of practical quantum computing. Because the error models of quantum devices vary widely, quantum codes which are tailored for a particular error model may have much better performance. In this work, we present a novel evolutionary algorithm which searches for an optimal stabiliser code for a given error model, number of physical qubits and number of encoded qubits. We demonstrate an efficient representation of stabiliser codes as binary strings -- this allows for random generati"},"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":"2409.13017","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2024-09-19T18:00:02Z","cross_cats_sorted":[],"title_canon_sha256":"6a239a5ffc881cfdb67c42d3318df25e58ecbfc18d52a210a97961068af57f3c","abstract_canon_sha256":"0bfe5bb87ff6d818276d1d7769995e5684a81f35ff23e7aa7716bbc5608d5ac0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:09:27.954248Z","signature_b64":"wMEAd6GHSzS89iXMXGm6a3HKeo5ZLheCzbRboD536o8sVM88e9rd8Khaizl1midRIN1K1vUB/TNKi45hGYp6BQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"da9adf56a3a94965cd69f802f341434a6cef3850db4440e37492135a516b0858","last_reissued_at":"2026-07-05T09:09:27.953829Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:09:27.953829Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Engineering Quantum Error Correction Codes Using Evolutionary Algorithms","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Dan Browne, Mark Webster","submitted_at":"2024-09-19T18:00:02Z","abstract_excerpt":"Quantum error correction and the use of quantum error correction codes is likely to be essential for the realisation of practical quantum computing. Because the error models of quantum devices vary widely, quantum codes which are tailored for a particular error model may have much better performance. In this work, we present a novel evolutionary algorithm which searches for an optimal stabiliser code for a given error model, number of physical qubits and number of encoded qubits. We demonstrate an efficient representation of stabiliser codes as binary strings -- this allows for random generati"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2409.13017","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/2409.13017/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":"2409.13017","created_at":"2026-07-05T09:09:27.953894+00:00"},{"alias_kind":"arxiv_version","alias_value":"2409.13017v1","created_at":"2026-07-05T09:09:27.953894+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2409.13017","created_at":"2026-07-05T09:09:27.953894+00:00"},{"alias_kind":"pith_short_12","alias_value":"3KNN6VVDVFEW","created_at":"2026-07-05T09:09:27.953894+00:00"},{"alias_kind":"pith_short_16","alias_value":"3KNN6VVDVFEWLTLJ","created_at":"2026-07-05T09:09:27.953894+00:00"},{"alias_kind":"pith_short_8","alias_value":"3KNN6VVD","created_at":"2026-07-05T09:09:27.953894+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2501.09622","citing_title":"Optimizing hypergraph product codes with random walks, simulated annealing and reinforcement learning","ref_index":34,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/3KNN6VVDVFEWLTLJ7ABPGQKDJJ","json":"https://pith.science/pith/3KNN6VVDVFEWLTLJ7ABPGQKDJJ.json","graph_json":"https://pith.science/api/pith-number/3KNN6VVDVFEWLTLJ7ABPGQKDJJ/graph.json","events_json":"https://pith.science/api/pith-number/3KNN6VVDVFEWLTLJ7ABPGQKDJJ/events.json","paper":"https://pith.science/paper/3KNN6VVD"},"agent_actions":{"view_html":"https://pith.science/pith/3KNN6VVDVFEWLTLJ7ABPGQKDJJ","download_json":"https://pith.science/pith/3KNN6VVDVFEWLTLJ7ABPGQKDJJ.json","view_paper":"https://pith.science/paper/3KNN6VVD","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2409.13017&json=true","fetch_graph":"https://pith.science/api/pith-number/3KNN6VVDVFEWLTLJ7ABPGQKDJJ/graph.json","fetch_events":"https://pith.science/api/pith-number/3KNN6VVDVFEWLTLJ7ABPGQKDJJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3KNN6VVDVFEWLTLJ7ABPGQKDJJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3KNN6VVDVFEWLTLJ7ABPGQKDJJ/action/storage_attestation","attest_author":"https://pith.science/pith/3KNN6VVDVFEWLTLJ7ABPGQKDJJ/action/author_attestation","sign_citation":"https://pith.science/pith/3KNN6VVDVFEWLTLJ7ABPGQKDJJ/action/citation_signature","submit_replication":"https://pith.science/pith/3KNN6VVDVFEWLTLJ7ABPGQKDJJ/action/replication_record"}},"created_at":"2026-07-05T09:09:27.953894+00:00","updated_at":"2026-07-05T09:09:27.953894+00:00"}