{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:OYG35NRLJX2V6GF6GIVJNIMJ5C","short_pith_number":"pith:OYG35NRL","schema_version":"1.0","canonical_sha256":"760dbeb62b4df55f18be322a96a189e89923379c62dd3e5cc0fa06256d93ed12","source":{"kind":"arxiv","id":"2304.08814","version":2},"attestation_state":"computed","paper":{"title":"A Comparison of Quantum Compilers using a DAG-based or phase polynomial-based Intermediate Representation","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":["cs.PL"],"primary_cat":"quant-ph","authors_text":"Arianne Meijer - van de Griend","submitted_at":"2023-04-18T08:25:47Z","abstract_excerpt":"In the NISQ era, where quantum computing is dominated by hybrid quantum algorithms, it is important for quantum circuits to be well-optimized to reduce noise from unnecessary gates.\n  We investigate different phase polynomial-based compilation strategies to determine the current best practices and compare them against the DAG-based Qiskit and TKET compilers. We find that phase polynomial-based compiling is very fast compared to DAG-based compiling. For long circuits, these compilers generate fewer CNOT gates than Qiskit or TKET, but for short circuits, they are quite inefficient. We also show "},"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":"2304.08814","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"quant-ph","submitted_at":"2023-04-18T08:25:47Z","cross_cats_sorted":["cs.PL"],"title_canon_sha256":"7d1868817e01c1e825861862a8dc6325d6d5cedb167272f5912aff7e6a6743f1","abstract_canon_sha256":"4c5f4426a332610a6f9640d2cf458a5705c28225aaf762971084c5eb78c0bced"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:09:16.846905Z","signature_b64":"8R66iwPkKSbxVqS03DFzJqOY7i3uKMfAI/VgSU/d8CKidoxFq//r8LZqXOu2J2fdKiOLpj1dVG9gdpGAimozCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"760dbeb62b4df55f18be322a96a189e89923379c62dd3e5cc0fa06256d93ed12","last_reissued_at":"2026-07-05T09:09:16.846409Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:09:16.846409Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Comparison of Quantum Compilers using a DAG-based or phase polynomial-based Intermediate Representation","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":["cs.PL"],"primary_cat":"quant-ph","authors_text":"Arianne Meijer - van de Griend","submitted_at":"2023-04-18T08:25:47Z","abstract_excerpt":"In the NISQ era, where quantum computing is dominated by hybrid quantum algorithms, it is important for quantum circuits to be well-optimized to reduce noise from unnecessary gates.\n  We investigate different phase polynomial-based compilation strategies to determine the current best practices and compare them against the DAG-based Qiskit and TKET compilers. We find that phase polynomial-based compiling is very fast compared to DAG-based compiling. For long circuits, these compilers generate fewer CNOT gates than Qiskit or TKET, but for short circuits, they are quite inefficient. We also show "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2304.08814","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/2304.08814/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":"2304.08814","created_at":"2026-07-05T09:09:16.846464+00:00"},{"alias_kind":"arxiv_version","alias_value":"2304.08814v2","created_at":"2026-07-05T09:09:16.846464+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2304.08814","created_at":"2026-07-05T09:09:16.846464+00:00"},{"alias_kind":"pith_short_12","alias_value":"OYG35NRLJX2V","created_at":"2026-07-05T09:09:16.846464+00:00"},{"alias_kind":"pith_short_16","alias_value":"OYG35NRLJX2V6GF6","created_at":"2026-07-05T09:09:16.846464+00:00"},{"alias_kind":"pith_short_8","alias_value":"OYG35NRL","created_at":"2026-07-05T09:09:16.846464+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2607.00516","citing_title":"Auditing Empirical Comparisons in Quantum Software","ref_index":27,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/OYG35NRLJX2V6GF6GIVJNIMJ5C","json":"https://pith.science/pith/OYG35NRLJX2V6GF6GIVJNIMJ5C.json","graph_json":"https://pith.science/api/pith-number/OYG35NRLJX2V6GF6GIVJNIMJ5C/graph.json","events_json":"https://pith.science/api/pith-number/OYG35NRLJX2V6GF6GIVJNIMJ5C/events.json","paper":"https://pith.science/paper/OYG35NRL"},"agent_actions":{"view_html":"https://pith.science/pith/OYG35NRLJX2V6GF6GIVJNIMJ5C","download_json":"https://pith.science/pith/OYG35NRLJX2V6GF6GIVJNIMJ5C.json","view_paper":"https://pith.science/paper/OYG35NRL","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2304.08814&json=true","fetch_graph":"https://pith.science/api/pith-number/OYG35NRLJX2V6GF6GIVJNIMJ5C/graph.json","fetch_events":"https://pith.science/api/pith-number/OYG35NRLJX2V6GF6GIVJNIMJ5C/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/OYG35NRLJX2V6GF6GIVJNIMJ5C/action/timestamp_anchor","attest_storage":"https://pith.science/pith/OYG35NRLJX2V6GF6GIVJNIMJ5C/action/storage_attestation","attest_author":"https://pith.science/pith/OYG35NRLJX2V6GF6GIVJNIMJ5C/action/author_attestation","sign_citation":"https://pith.science/pith/OYG35NRLJX2V6GF6GIVJNIMJ5C/action/citation_signature","submit_replication":"https://pith.science/pith/OYG35NRLJX2V6GF6GIVJNIMJ5C/action/replication_record"}},"created_at":"2026-07-05T09:09:16.846464+00:00","updated_at":"2026-07-05T09:09:16.846464+00:00"}