{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:HBXEEECSUDVICDWFIDBXBKNDI7","short_pith_number":"pith:HBXEEECS","schema_version":"1.0","canonical_sha256":"386e421052a0ea810ec540c370a9a347fd95be7abc9588220b02d90c3a6c5de6","source":{"kind":"arxiv","id":"2411.04104","version":1},"attestation_state":"computed","paper":{"title":"Optimizing Quantum Circuits, Fast and Slow","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":["quant-ph"],"primary_cat":"cs.PL","authors_text":"Abtin Molavi, Amanda Xu, Aws Albarghouthi, Swamit Tannu","submitted_at":"2024-11-06T18:34:35Z","abstract_excerpt":"Optimizing quantum circuits is critical: the number of quantum operations needs to be minimized for a successful evaluation of a circuit on a quantum processor. In this paper we unify two disparate ideas for optimizing quantum circuits, rewrite rules, which are fast standard optimizer passes, and unitary synthesis, which is slow, requiring a search through the space of circuits. We present a clean, unifying framework for thinking of rewriting and resynthesis as abstract circuit transformations. We then present a radically simple algorithm, GUOQ, for optimizing quantum circuits that exploits th"},"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":"2411.04104","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.PL","submitted_at":"2024-11-06T18:34:35Z","cross_cats_sorted":["quant-ph"],"title_canon_sha256":"4a001d8c776fcd3616bfa7c773484802dbc667f14a760fb51e26f532fbdcca5c","abstract_canon_sha256":"24274fffde06dff71a8c29250c37f3ad1c28a39c46a8c9be1a89592419ee58ee"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:32:01.079363Z","signature_b64":"GetdjJ0vE9EabvoxbJM1WSMGOKe9HSntQ/vklxPfhLSnynUGYFbp2EcgQ98RvltoJhZjZxTS98LPD6HRdMamBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"386e421052a0ea810ec540c370a9a347fd95be7abc9588220b02d90c3a6c5de6","last_reissued_at":"2026-07-05T09:32:01.078870Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:32:01.078870Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Optimizing Quantum Circuits, Fast and Slow","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":["quant-ph"],"primary_cat":"cs.PL","authors_text":"Abtin Molavi, Amanda Xu, Aws Albarghouthi, Swamit Tannu","submitted_at":"2024-11-06T18:34:35Z","abstract_excerpt":"Optimizing quantum circuits is critical: the number of quantum operations needs to be minimized for a successful evaluation of a circuit on a quantum processor. In this paper we unify two disparate ideas for optimizing quantum circuits, rewrite rules, which are fast standard optimizer passes, and unitary synthesis, which is slow, requiring a search through the space of circuits. We present a clean, unifying framework for thinking of rewriting and resynthesis as abstract circuit transformations. We then present a radically simple algorithm, GUOQ, for optimizing quantum circuits that exploits th"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2411.04104","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/2411.04104/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":"2411.04104","created_at":"2026-07-05T09:32:01.078930+00:00"},{"alias_kind":"arxiv_version","alias_value":"2411.04104v1","created_at":"2026-07-05T09:32:01.078930+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2411.04104","created_at":"2026-07-05T09:32:01.078930+00:00"},{"alias_kind":"pith_short_12","alias_value":"HBXEEECSUDVI","created_at":"2026-07-05T09:32:01.078930+00:00"},{"alias_kind":"pith_short_16","alias_value":"HBXEEECSUDVICDWF","created_at":"2026-07-05T09:32:01.078930+00:00"},{"alias_kind":"pith_short_8","alias_value":"HBXEEECS","created_at":"2026-07-05T09:32:01.078930+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2506.13720","citing_title":"POPQC: Parallel Optimization for Quantum Circuits (Extended Version)","ref_index":58,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/HBXEEECSUDVICDWFIDBXBKNDI7","json":"https://pith.science/pith/HBXEEECSUDVICDWFIDBXBKNDI7.json","graph_json":"https://pith.science/api/pith-number/HBXEEECSUDVICDWFIDBXBKNDI7/graph.json","events_json":"https://pith.science/api/pith-number/HBXEEECSUDVICDWFIDBXBKNDI7/events.json","paper":"https://pith.science/paper/HBXEEECS"},"agent_actions":{"view_html":"https://pith.science/pith/HBXEEECSUDVICDWFIDBXBKNDI7","download_json":"https://pith.science/pith/HBXEEECSUDVICDWFIDBXBKNDI7.json","view_paper":"https://pith.science/paper/HBXEEECS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2411.04104&json=true","fetch_graph":"https://pith.science/api/pith-number/HBXEEECSUDVICDWFIDBXBKNDI7/graph.json","fetch_events":"https://pith.science/api/pith-number/HBXEEECSUDVICDWFIDBXBKNDI7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HBXEEECSUDVICDWFIDBXBKNDI7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HBXEEECSUDVICDWFIDBXBKNDI7/action/storage_attestation","attest_author":"https://pith.science/pith/HBXEEECSUDVICDWFIDBXBKNDI7/action/author_attestation","sign_citation":"https://pith.science/pith/HBXEEECSUDVICDWFIDBXBKNDI7/action/citation_signature","submit_replication":"https://pith.science/pith/HBXEEECSUDVICDWFIDBXBKNDI7/action/replication_record"}},"created_at":"2026-07-05T09:32:01.078930+00:00","updated_at":"2026-07-05T09:32:01.078930+00:00"}