{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:DHDEX2IPENQN2HWXVCSTXIMUWG","short_pith_number":"pith:DHDEX2IP","schema_version":"1.0","canonical_sha256":"19c64be90f2360dd1ed7a8a53ba194b19e9b872d8a8b973a3f1e0f322df88bda","source":{"kind":"arxiv","id":"2410.23493","version":1},"attestation_state":"computed","paper":{"title":"Linear and non-linear relational analyses for Quantum Program Optimization","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":["cs.PL"],"primary_cat":"quant-ph","authors_text":"Joseph Lunderville, Matthew Amy","submitted_at":"2024-10-30T22:57:07Z","abstract_excerpt":"The phase folding optimization is a circuit optimization used in many quantum compilers as a fast and effective way of reducing the number of high-cost gates in a quantum circuit. However, existing formulations of the optimization rely on an exact, linear algebraic representation of the circuit, restricting the optimization to being performed on straightline quantum circuits or basic blocks in a larger quantum program.\n  We show that the phase folding optimization can be re-cast as an \\emph{affine relation analysis}, which allows the direct application of classical techniques for affine relati"},"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":"2410.23493","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"quant-ph","submitted_at":"2024-10-30T22:57:07Z","cross_cats_sorted":["cs.PL"],"title_canon_sha256":"14ab1a5da0e3e60a3a2a69eef4272c7dcf4b2544cd7aca36cec649ca55b9b071","abstract_canon_sha256":"49ab9067ae7bb870fccd4d35cad5d12f8cff0c9b894cfa3059a3fc886de44170"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:41:43.875488Z","signature_b64":"y+UGPyfAa8ukI/Mc8eSH+Ywyiu4uqOwmMrAUbFF68A7VKfo9ghLDtxJFCjrdmC/OzDQyIupQUiapq/VgE9+NCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"19c64be90f2360dd1ed7a8a53ba194b19e9b872d8a8b973a3f1e0f322df88bda","last_reissued_at":"2026-07-05T09:41:43.874982Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:41:43.874982Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Linear and non-linear relational analyses for Quantum Program Optimization","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":["cs.PL"],"primary_cat":"quant-ph","authors_text":"Joseph Lunderville, Matthew Amy","submitted_at":"2024-10-30T22:57:07Z","abstract_excerpt":"The phase folding optimization is a circuit optimization used in many quantum compilers as a fast and effective way of reducing the number of high-cost gates in a quantum circuit. However, existing formulations of the optimization rely on an exact, linear algebraic representation of the circuit, restricting the optimization to being performed on straightline quantum circuits or basic blocks in a larger quantum program.\n  We show that the phase folding optimization can be re-cast as an \\emph{affine relation analysis}, which allows the direct application of classical techniques for affine relati"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2410.23493","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/2410.23493/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":"2410.23493","created_at":"2026-07-05T09:41:43.875053+00:00"},{"alias_kind":"arxiv_version","alias_value":"2410.23493v1","created_at":"2026-07-05T09:41:43.875053+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2410.23493","created_at":"2026-07-05T09:41:43.875053+00:00"},{"alias_kind":"pith_short_12","alias_value":"DHDEX2IPENQN","created_at":"2026-07-05T09:41:43.875053+00:00"},{"alias_kind":"pith_short_16","alias_value":"DHDEX2IPENQN2HWX","created_at":"2026-07-05T09:41:43.875053+00:00"},{"alias_kind":"pith_short_8","alias_value":"DHDEX2IP","created_at":"2026-07-05T09:41:43.875053+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/DHDEX2IPENQN2HWXVCSTXIMUWG","json":"https://pith.science/pith/DHDEX2IPENQN2HWXVCSTXIMUWG.json","graph_json":"https://pith.science/api/pith-number/DHDEX2IPENQN2HWXVCSTXIMUWG/graph.json","events_json":"https://pith.science/api/pith-number/DHDEX2IPENQN2HWXVCSTXIMUWG/events.json","paper":"https://pith.science/paper/DHDEX2IP"},"agent_actions":{"view_html":"https://pith.science/pith/DHDEX2IPENQN2HWXVCSTXIMUWG","download_json":"https://pith.science/pith/DHDEX2IPENQN2HWXVCSTXIMUWG.json","view_paper":"https://pith.science/paper/DHDEX2IP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2410.23493&json=true","fetch_graph":"https://pith.science/api/pith-number/DHDEX2IPENQN2HWXVCSTXIMUWG/graph.json","fetch_events":"https://pith.science/api/pith-number/DHDEX2IPENQN2HWXVCSTXIMUWG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DHDEX2IPENQN2HWXVCSTXIMUWG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DHDEX2IPENQN2HWXVCSTXIMUWG/action/storage_attestation","attest_author":"https://pith.science/pith/DHDEX2IPENQN2HWXVCSTXIMUWG/action/author_attestation","sign_citation":"https://pith.science/pith/DHDEX2IPENQN2HWXVCSTXIMUWG/action/citation_signature","submit_replication":"https://pith.science/pith/DHDEX2IPENQN2HWXVCSTXIMUWG/action/replication_record"}},"created_at":"2026-07-05T09:41:43.875053+00:00","updated_at":"2026-07-05T09:41:43.875053+00:00"}