{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:3PBNGHK6E5GY5RNTYRIMUPETXU","short_pith_number":"pith:3PBNGHK6","schema_version":"1.0","canonical_sha256":"dbc2d31d5e274d8ec5b3c450ca3c93bd1cebc15f217b49933d94f305026b2b3b","source":{"kind":"arxiv","id":"2502.19526","version":1},"attestation_state":"computed","paper":{"title":"Local Optimization of Quantum Circuits (Extended Version)","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["quant-ph"],"primary_cat":"cs.PL","authors_text":"Dantong Li, Jatin Arora, Mingkuan Xu, Pengyu Liu, Sam Westrick, Umut A. Acar, Yongshan Ding","submitted_at":"2025-02-26T19:53:54Z","abstract_excerpt":"Recent advances in quantum architectures and computing have motivated the development of new optimizing compilers for quantum programs or circuits. Even though steady progress has been made, existing quantum optimization techniques remain asymptotically and practically inefficient and are unable to offer guarantees on the quality of the optimization. Because many global quantum circuit optimization problems belong to the complexity class QMA (the quantum analog of NP), it is not clear whether quality and efficiency guarantees can both be achieved.\n  In this paper, we present optimization techn"},"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.19526","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.PL","submitted_at":"2025-02-26T19:53:54Z","cross_cats_sorted":["quant-ph"],"title_canon_sha256":"b4191437a3bdf9c5ab15ac426fa9cb8c4cf55223c6b1ff6382a73634f8bc1ce4","abstract_canon_sha256":"1b45384384b66323f611fb545fa9ec89a41b01be722dcb8b17d6d974248c9709"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:20:48.103873Z","signature_b64":"pfupp4xWSQxwWhEtlQgcokl+pZ4r687u9MecK9GECLMvLtIxCSXrhRBfuIdzbYOqn5gH2yNUouq2Z9/TC6aaBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"dbc2d31d5e274d8ec5b3c450ca3c93bd1cebc15f217b49933d94f305026b2b3b","last_reissued_at":"2026-07-05T10:20:48.103349Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:20:48.103349Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Local Optimization of Quantum Circuits (Extended Version)","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["quant-ph"],"primary_cat":"cs.PL","authors_text":"Dantong Li, Jatin Arora, Mingkuan Xu, Pengyu Liu, Sam Westrick, Umut A. Acar, Yongshan Ding","submitted_at":"2025-02-26T19:53:54Z","abstract_excerpt":"Recent advances in quantum architectures and computing have motivated the development of new optimizing compilers for quantum programs or circuits. Even though steady progress has been made, existing quantum optimization techniques remain asymptotically and practically inefficient and are unable to offer guarantees on the quality of the optimization. Because many global quantum circuit optimization problems belong to the complexity class QMA (the quantum analog of NP), it is not clear whether quality and efficiency guarantees can both be achieved.\n  In this paper, we present optimization techn"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2502.19526","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.19526/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.19526","created_at":"2026-07-05T10:20:48.103419+00:00"},{"alias_kind":"arxiv_version","alias_value":"2502.19526v1","created_at":"2026-07-05T10:20:48.103419+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2502.19526","created_at":"2026-07-05T10:20:48.103419+00:00"},{"alias_kind":"pith_short_12","alias_value":"3PBNGHK6E5GY","created_at":"2026-07-05T10:20:48.103419+00:00"},{"alias_kind":"pith_short_16","alias_value":"3PBNGHK6E5GY5RNT","created_at":"2026-07-05T10:20:48.103419+00:00"},{"alias_kind":"pith_short_8","alias_value":"3PBNGHK6","created_at":"2026-07-05T10:20:48.103419+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":8,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/3PBNGHK6E5GY5RNTYRIMUPETXU","json":"https://pith.science/pith/3PBNGHK6E5GY5RNTYRIMUPETXU.json","graph_json":"https://pith.science/api/pith-number/3PBNGHK6E5GY5RNTYRIMUPETXU/graph.json","events_json":"https://pith.science/api/pith-number/3PBNGHK6E5GY5RNTYRIMUPETXU/events.json","paper":"https://pith.science/paper/3PBNGHK6"},"agent_actions":{"view_html":"https://pith.science/pith/3PBNGHK6E5GY5RNTYRIMUPETXU","download_json":"https://pith.science/pith/3PBNGHK6E5GY5RNTYRIMUPETXU.json","view_paper":"https://pith.science/paper/3PBNGHK6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2502.19526&json=true","fetch_graph":"https://pith.science/api/pith-number/3PBNGHK6E5GY5RNTYRIMUPETXU/graph.json","fetch_events":"https://pith.science/api/pith-number/3PBNGHK6E5GY5RNTYRIMUPETXU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3PBNGHK6E5GY5RNTYRIMUPETXU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3PBNGHK6E5GY5RNTYRIMUPETXU/action/storage_attestation","attest_author":"https://pith.science/pith/3PBNGHK6E5GY5RNTYRIMUPETXU/action/author_attestation","sign_citation":"https://pith.science/pith/3PBNGHK6E5GY5RNTYRIMUPETXU/action/citation_signature","submit_replication":"https://pith.science/pith/3PBNGHK6E5GY5RNTYRIMUPETXU/action/replication_record"}},"created_at":"2026-07-05T10:20:48.103419+00:00","updated_at":"2026-07-05T10:20:48.103419+00:00"}