{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:ONN77ZTGKHUYCZ6LZSPTWTQ2XU","short_pith_number":"pith:ONN77ZTG","schema_version":"1.0","canonical_sha256":"735bffe66651e98167cbcc9f3b4e1abd304104d64b9fc1281a9b07e9f3b9b53e","source":{"kind":"arxiv","id":"2305.10485","version":2},"attestation_state":"computed","paper":{"title":"Making the cut: two methods for breaking down a quantum algorithm","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Duarte Magano, Miguel Mur\\c{c}a, Yasser Omar","submitted_at":"2023-05-17T18:00:06Z","abstract_excerpt":"Despite the promise that fault-tolerant quantum computers can efficiently solve classically intractable problems, it remains a major challenge to find quantum algorithms that may reach computational advantage in the present era of noisy, small-scale quantum hardware. Thus, there is substantial ongoing effort to create new quantum algorithms (or adapt existing ones) to accommodate depth and space restrictions. By adopting a hybrid query perspective, we identify and characterize two methods of ``breaking down'' quantum algorithms into rounds of lower (query) depth, designating these approaches a"},"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":"2305.10485","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2023-05-17T18:00:06Z","cross_cats_sorted":[],"title_canon_sha256":"3c47646f6f6b24b32710a79941e26446315e65aebfe66cd10ef3ea2e769cab0d","abstract_canon_sha256":"2d43a24bd88902aed7a0c8d1beed48407c56f3384c16df5b13b26e4fc094dae5"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:34:09.034537Z","signature_b64":"e1fCGCTZYzNT4zRJ9iBd3UwVTrvcuILqYeML13o5uDkg5XL6hI1Pg8/APcQ4y7nw4rcJDO4k3oB4d6D4jDmuCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"735bffe66651e98167cbcc9f3b4e1abd304104d64b9fc1281a9b07e9f3b9b53e","last_reissued_at":"2026-07-05T09:34:09.034056Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:34:09.034056Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Making the cut: two methods for breaking down a quantum algorithm","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Duarte Magano, Miguel Mur\\c{c}a, Yasser Omar","submitted_at":"2023-05-17T18:00:06Z","abstract_excerpt":"Despite the promise that fault-tolerant quantum computers can efficiently solve classically intractable problems, it remains a major challenge to find quantum algorithms that may reach computational advantage in the present era of noisy, small-scale quantum hardware. Thus, there is substantial ongoing effort to create new quantum algorithms (or adapt existing ones) to accommodate depth and space restrictions. By adopting a hybrid query perspective, we identify and characterize two methods of ``breaking down'' quantum algorithms into rounds of lower (query) depth, designating these approaches a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2305.10485","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/2305.10485/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":"2305.10485","created_at":"2026-07-05T09:34:09.034111+00:00"},{"alias_kind":"arxiv_version","alias_value":"2305.10485v2","created_at":"2026-07-05T09:34:09.034111+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2305.10485","created_at":"2026-07-05T09:34:09.034111+00:00"},{"alias_kind":"pith_short_12","alias_value":"ONN77ZTGKHUY","created_at":"2026-07-05T09:34:09.034111+00:00"},{"alias_kind":"pith_short_16","alias_value":"ONN77ZTGKHUYCZ6L","created_at":"2026-07-05T09:34:09.034111+00:00"},{"alias_kind":"pith_short_8","alias_value":"ONN77ZTG","created_at":"2026-07-05T09:34:09.034111+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/ONN77ZTGKHUYCZ6LZSPTWTQ2XU","json":"https://pith.science/pith/ONN77ZTGKHUYCZ6LZSPTWTQ2XU.json","graph_json":"https://pith.science/api/pith-number/ONN77ZTGKHUYCZ6LZSPTWTQ2XU/graph.json","events_json":"https://pith.science/api/pith-number/ONN77ZTGKHUYCZ6LZSPTWTQ2XU/events.json","paper":"https://pith.science/paper/ONN77ZTG"},"agent_actions":{"view_html":"https://pith.science/pith/ONN77ZTGKHUYCZ6LZSPTWTQ2XU","download_json":"https://pith.science/pith/ONN77ZTGKHUYCZ6LZSPTWTQ2XU.json","view_paper":"https://pith.science/paper/ONN77ZTG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2305.10485&json=true","fetch_graph":"https://pith.science/api/pith-number/ONN77ZTGKHUYCZ6LZSPTWTQ2XU/graph.json","fetch_events":"https://pith.science/api/pith-number/ONN77ZTGKHUYCZ6LZSPTWTQ2XU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ONN77ZTGKHUYCZ6LZSPTWTQ2XU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ONN77ZTGKHUYCZ6LZSPTWTQ2XU/action/storage_attestation","attest_author":"https://pith.science/pith/ONN77ZTGKHUYCZ6LZSPTWTQ2XU/action/author_attestation","sign_citation":"https://pith.science/pith/ONN77ZTGKHUYCZ6LZSPTWTQ2XU/action/citation_signature","submit_replication":"https://pith.science/pith/ONN77ZTGKHUYCZ6LZSPTWTQ2XU/action/replication_record"}},"created_at":"2026-07-05T09:34:09.034111+00:00","updated_at":"2026-07-05T09:34:09.034111+00:00"}