{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:XO2GFN2DAULFC4ZHLEF2XOOE5K","short_pith_number":"pith:XO2GFN2D","schema_version":"1.0","canonical_sha256":"bbb462b7430516517327590babb9c4ea819a75ed65a22e17b74995f67afd1985","source":{"kind":"arxiv","id":"2409.09103","version":1},"attestation_state":"computed","paper":{"title":"Improving the Reliability of Quantum Circuits by Evolving Heterogeneous Ensembles","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.ET"],"primary_cat":"quant-ph","authors_text":"John Clark, Owain Parry, Phil McMinn","submitted_at":"2024-09-13T12:38:17Z","abstract_excerpt":"Quantum computers can perform certain operations exponentially faster than classical computers, but designing quantum circuits is challenging. To that end, researchers used evolutionary algorithms to produce probabilistic quantum circuits that give the correct output more often than not for any input. They can be executed multiple times, with the outputs combined using a classical method (such as voting) to produce the final output, effectively creating a homogeneous ensemble of circuits (i.e., all identical). Inspired by n-version programming and ensemble learning, we developed a tool that us"},"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.09103","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2024-09-13T12:38:17Z","cross_cats_sorted":["cs.ET"],"title_canon_sha256":"47d53a68a2ec897a55e7b7b24418eca91b66b8f798777e378587ba4cff09d1ed","abstract_canon_sha256":"d4a8bcde3c6dd61cd135e34421bc81a5763ead79bb6b321eefcf4b917404b285"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:07:04.961988Z","signature_b64":"9PhZc3WNojOEz4mP2xh5om5MQLzbUDMFqCBHXQEvXTp4Vsm0TcBsil81KYQF3NXjBxwMiuAWt+XMpRmLGiwoCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bbb462b7430516517327590babb9c4ea819a75ed65a22e17b74995f67afd1985","last_reissued_at":"2026-07-05T09:07:04.961519Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:07:04.961519Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Improving the Reliability of Quantum Circuits by Evolving Heterogeneous Ensembles","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.ET"],"primary_cat":"quant-ph","authors_text":"John Clark, Owain Parry, Phil McMinn","submitted_at":"2024-09-13T12:38:17Z","abstract_excerpt":"Quantum computers can perform certain operations exponentially faster than classical computers, but designing quantum circuits is challenging. To that end, researchers used evolutionary algorithms to produce probabilistic quantum circuits that give the correct output more often than not for any input. They can be executed multiple times, with the outputs combined using a classical method (such as voting) to produce the final output, effectively creating a homogeneous ensemble of circuits (i.e., all identical). Inspired by n-version programming and ensemble learning, we developed a tool that us"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2409.09103","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.09103/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.09103","created_at":"2026-07-05T09:07:04.961575+00:00"},{"alias_kind":"arxiv_version","alias_value":"2409.09103v1","created_at":"2026-07-05T09:07:04.961575+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2409.09103","created_at":"2026-07-05T09:07:04.961575+00:00"},{"alias_kind":"pith_short_12","alias_value":"XO2GFN2DAULF","created_at":"2026-07-05T09:07:04.961575+00:00"},{"alias_kind":"pith_short_16","alias_value":"XO2GFN2DAULFC4ZH","created_at":"2026-07-05T09:07:04.961575+00:00"},{"alias_kind":"pith_short_8","alias_value":"XO2GFN2D","created_at":"2026-07-05T09:07:04.961575+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.20968","citing_title":"Profiling the Effective Limits of Error Mitigation via Circuit Replication","ref_index":13,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/XO2GFN2DAULFC4ZHLEF2XOOE5K","json":"https://pith.science/pith/XO2GFN2DAULFC4ZHLEF2XOOE5K.json","graph_json":"https://pith.science/api/pith-number/XO2GFN2DAULFC4ZHLEF2XOOE5K/graph.json","events_json":"https://pith.science/api/pith-number/XO2GFN2DAULFC4ZHLEF2XOOE5K/events.json","paper":"https://pith.science/paper/XO2GFN2D"},"agent_actions":{"view_html":"https://pith.science/pith/XO2GFN2DAULFC4ZHLEF2XOOE5K","download_json":"https://pith.science/pith/XO2GFN2DAULFC4ZHLEF2XOOE5K.json","view_paper":"https://pith.science/paper/XO2GFN2D","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2409.09103&json=true","fetch_graph":"https://pith.science/api/pith-number/XO2GFN2DAULFC4ZHLEF2XOOE5K/graph.json","fetch_events":"https://pith.science/api/pith-number/XO2GFN2DAULFC4ZHLEF2XOOE5K/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/XO2GFN2DAULFC4ZHLEF2XOOE5K/action/timestamp_anchor","attest_storage":"https://pith.science/pith/XO2GFN2DAULFC4ZHLEF2XOOE5K/action/storage_attestation","attest_author":"https://pith.science/pith/XO2GFN2DAULFC4ZHLEF2XOOE5K/action/author_attestation","sign_citation":"https://pith.science/pith/XO2GFN2DAULFC4ZHLEF2XOOE5K/action/citation_signature","submit_replication":"https://pith.science/pith/XO2GFN2DAULFC4ZHLEF2XOOE5K/action/replication_record"}},"created_at":"2026-07-05T09:07:04.961575+00:00","updated_at":"2026-07-05T09:07:04.961575+00:00"}