{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:5YRUDASWXWE26MHN5UWXA44JYJ","short_pith_number":"pith:5YRUDASW","schema_version":"1.0","canonical_sha256":"ee23418256bd89af30eded2d707389c259dab22dffa441696607844b7a506a14","source":{"kind":"arxiv","id":"2506.20624","version":2},"attestation_state":"computed","paper":{"title":"Leveraging Phase Polynomials for Quantum Circuit Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["quant-ph"],"primary_cat":"cs.PL","authors_text":"Eddy Z. Zhang, Enhyeok Jang, Henry Chen, Mingkuan Xu, Vannessa Chan, Won Woo Ro, Yuwei Jin, Zihan Chen","submitted_at":"2025-06-25T17:13:16Z","abstract_excerpt":"Quantum circuits on resource-limited hardware require optimizing regions dominated by $\\{\\mathrm{CNOT}, R_z\\}$, which account for a large fraction of operations and often dominate execution cost. This optimization can be challenging because phase-polynomial blocks are fragmented by basis-changing gates such as $H$, and optimizing phase parities alone may increase the cost of downstream basis transformations. Existing phase-polynomial approaches are limited to single-block or phase-only optimization, while subcircuit rewriting approaches are local and scale poorly beyond small rewrite windows. "},"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":"2506.20624","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2025-06-25T17:13:16Z","cross_cats_sorted":["quant-ph"],"title_canon_sha256":"efc9f82d4be30d0ed506e179aebfcb61c3aac1916db8b83ce0936836d1a8ce1e","abstract_canon_sha256":"0ab00274822d34ca0300c0a653291a6876658c38de200072b4be9ad1d02fd30d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-30T01:17:24.163886Z","signature_b64":"IEh4TJl+qR0/U/VX0yIzpb1oPl30jULGO+9nkU4Z63G9ayS6bK2owiHaH8g77atYohpuJxSAkg1qgfKC7oAVCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ee23418256bd89af30eded2d707389c259dab22dffa441696607844b7a506a14","last_reissued_at":"2026-06-30T01:17:24.163149Z","signature_status":"signed_v1","first_computed_at":"2026-06-30T01:17:24.163149Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Leveraging Phase Polynomials for Quantum Circuit Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["quant-ph"],"primary_cat":"cs.PL","authors_text":"Eddy Z. Zhang, Enhyeok Jang, Henry Chen, Mingkuan Xu, Vannessa Chan, Won Woo Ro, Yuwei Jin, Zihan Chen","submitted_at":"2025-06-25T17:13:16Z","abstract_excerpt":"Quantum circuits on resource-limited hardware require optimizing regions dominated by $\\{\\mathrm{CNOT}, R_z\\}$, which account for a large fraction of operations and often dominate execution cost. This optimization can be challenging because phase-polynomial blocks are fragmented by basis-changing gates such as $H$, and optimizing phase parities alone may increase the cost of downstream basis transformations. Existing phase-polynomial approaches are limited to single-block or phase-only optimization, while subcircuit rewriting approaches are local and scale poorly beyond small rewrite windows. "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2506.20624","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/2506.20624/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":"2506.20624","created_at":"2026-06-30T01:17:24.163256+00:00"},{"alias_kind":"arxiv_version","alias_value":"2506.20624v2","created_at":"2026-06-30T01:17:24.163256+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2506.20624","created_at":"2026-06-30T01:17:24.163256+00:00"},{"alias_kind":"pith_short_12","alias_value":"5YRUDASWXWE2","created_at":"2026-06-30T01:17:24.163256+00:00"},{"alias_kind":"pith_short_16","alias_value":"5YRUDASWXWE26MHN","created_at":"2026-06-30T01:17:24.163256+00:00"},{"alias_kind":"pith_short_8","alias_value":"5YRUDASW","created_at":"2026-06-30T01:17:24.163256+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2607.08396","citing_title":"Efficiently simulable quantum circuits with large entanglement, magic, and non-Gaussianity via code-compiled tensor networks","ref_index":79,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/5YRUDASWXWE26MHN5UWXA44JYJ","json":"https://pith.science/pith/5YRUDASWXWE26MHN5UWXA44JYJ.json","graph_json":"https://pith.science/api/pith-number/5YRUDASWXWE26MHN5UWXA44JYJ/graph.json","events_json":"https://pith.science/api/pith-number/5YRUDASWXWE26MHN5UWXA44JYJ/events.json","paper":"https://pith.science/paper/5YRUDASW"},"agent_actions":{"view_html":"https://pith.science/pith/5YRUDASWXWE26MHN5UWXA44JYJ","download_json":"https://pith.science/pith/5YRUDASWXWE26MHN5UWXA44JYJ.json","view_paper":"https://pith.science/paper/5YRUDASW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2506.20624&json=true","fetch_graph":"https://pith.science/api/pith-number/5YRUDASWXWE26MHN5UWXA44JYJ/graph.json","fetch_events":"https://pith.science/api/pith-number/5YRUDASWXWE26MHN5UWXA44JYJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5YRUDASWXWE26MHN5UWXA44JYJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5YRUDASWXWE26MHN5UWXA44JYJ/action/storage_attestation","attest_author":"https://pith.science/pith/5YRUDASWXWE26MHN5UWXA44JYJ/action/author_attestation","sign_citation":"https://pith.science/pith/5YRUDASWXWE26MHN5UWXA44JYJ/action/citation_signature","submit_replication":"https://pith.science/pith/5YRUDASWXWE26MHN5UWXA44JYJ/action/replication_record"}},"created_at":"2026-06-30T01:17:24.163256+00:00","updated_at":"2026-06-30T01:17:24.163256+00:00"}