{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:MLPZ3KSCTYEKRCMJZQVZKJNOJF","short_pith_number":"pith:MLPZ3KSC","schema_version":"1.0","canonical_sha256":"62df9daa429e08a88989cc2b9525ae4950ab396dba6746dcfcb2bbf057e51371","source":{"kind":"arxiv","id":"2502.09240","version":1},"attestation_state":"computed","paper":{"title":"Composing Quantum Algorithms","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Stacey Jeffery","submitted_at":"2025-02-13T11:56:35Z","abstract_excerpt":"Composition is something we take for granted in classical algorithms design, and in particular, we take it as a basic axiom that composing ``efficient'' algorithms should result in an ``efficient'' algorithm -- even using this intuition to justify our definition of ``efficient.'' Composing quantum algorithms is a much more subtle affair than composing classical algorithms. It has long been known that zero-error quantum algorithms \\emph{do not} compose, but it turns out that, using the right algorithmic lens, bounded-error quantum algorithms do. In fact, in the bounded-error setting, quantum al"},"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":"2502.09240","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2025-02-13T11:56:35Z","cross_cats_sorted":[],"title_canon_sha256":"43f73c3a097dc87181460e7587a85b1dd1bf3f9b1d468c8896fd8da1cf9bcf3b","abstract_canon_sha256":"7eac26aeeb0a2aefd89c25784502c9a50bc58eb3f93bac0971d0134cbe60f114"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:13:54.393683Z","signature_b64":"yqCwR5Me1UhIk47l8zmKH9EYB+zrW37HpZM/ErbP4eedW4ZQEBr9U9KYGXzAt7ca5CrRZQFnmVLzBZ4S9N3LDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"62df9daa429e08a88989cc2b9525ae4950ab396dba6746dcfcb2bbf057e51371","last_reissued_at":"2026-07-05T10:13:54.393252Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:13:54.393252Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Composing Quantum Algorithms","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Stacey Jeffery","submitted_at":"2025-02-13T11:56:35Z","abstract_excerpt":"Composition is something we take for granted in classical algorithms design, and in particular, we take it as a basic axiom that composing ``efficient'' algorithms should result in an ``efficient'' algorithm -- even using this intuition to justify our definition of ``efficient.'' Composing quantum algorithms is a much more subtle affair than composing classical algorithms. It has long been known that zero-error quantum algorithms \\emph{do not} compose, but it turns out that, using the right algorithmic lens, bounded-error quantum algorithms do. In fact, in the bounded-error setting, quantum al"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2502.09240","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/2502.09240/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":"2502.09240","created_at":"2026-07-05T10:13:54.393309+00:00"},{"alias_kind":"arxiv_version","alias_value":"2502.09240v1","created_at":"2026-07-05T10:13:54.393309+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2502.09240","created_at":"2026-07-05T10:13:54.393309+00:00"},{"alias_kind":"pith_short_12","alias_value":"MLPZ3KSCTYEK","created_at":"2026-07-05T10:13:54.393309+00:00"},{"alias_kind":"pith_short_16","alias_value":"MLPZ3KSCTYEKRCMJ","created_at":"2026-07-05T10:13:54.393309+00:00"},{"alias_kind":"pith_short_8","alias_value":"MLPZ3KSC","created_at":"2026-07-05T10:13:54.393309+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/MLPZ3KSCTYEKRCMJZQVZKJNOJF","json":"https://pith.science/pith/MLPZ3KSCTYEKRCMJZQVZKJNOJF.json","graph_json":"https://pith.science/api/pith-number/MLPZ3KSCTYEKRCMJZQVZKJNOJF/graph.json","events_json":"https://pith.science/api/pith-number/MLPZ3KSCTYEKRCMJZQVZKJNOJF/events.json","paper":"https://pith.science/paper/MLPZ3KSC"},"agent_actions":{"view_html":"https://pith.science/pith/MLPZ3KSCTYEKRCMJZQVZKJNOJF","download_json":"https://pith.science/pith/MLPZ3KSCTYEKRCMJZQVZKJNOJF.json","view_paper":"https://pith.science/paper/MLPZ3KSC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2502.09240&json=true","fetch_graph":"https://pith.science/api/pith-number/MLPZ3KSCTYEKRCMJZQVZKJNOJF/graph.json","fetch_events":"https://pith.science/api/pith-number/MLPZ3KSCTYEKRCMJZQVZKJNOJF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MLPZ3KSCTYEKRCMJZQVZKJNOJF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MLPZ3KSCTYEKRCMJZQVZKJNOJF/action/storage_attestation","attest_author":"https://pith.science/pith/MLPZ3KSCTYEKRCMJZQVZKJNOJF/action/author_attestation","sign_citation":"https://pith.science/pith/MLPZ3KSCTYEKRCMJZQVZKJNOJF/action/citation_signature","submit_replication":"https://pith.science/pith/MLPZ3KSCTYEKRCMJZQVZKJNOJF/action/replication_record"}},"created_at":"2026-07-05T10:13:54.393309+00:00","updated_at":"2026-07-05T10:13:54.393309+00:00"}