{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:C7AKTMUTRMHZMEZAXNNCEWT2XA","short_pith_number":"pith:C7AKTMUT","schema_version":"1.0","canonical_sha256":"17c0a9b2938b0f961320bb5a225a7ab83119f99f90d7bc0f3ae0f80470c86d54","source":{"kind":"arxiv","id":"2501.13155","version":1},"attestation_state":"computed","paper":{"title":"Improving Figures of Merit for Quantum Circuit Compilation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Laura Schulz, Nils Quetschlich, Patrick Hopf, Robert Wille","submitted_at":"2025-01-22T19:00:01Z","abstract_excerpt":"Quantum computing is an emerging technology that has seen significant software and hardware improvements in recent years. Executing a quantum program requires the compilation of its quantum circuit for a target Quantum Processing Unit (QPU). Various methods for qubit mapping, gate synthesis, and optimization of quantum circuits have been proposed and implemented in compilers. These compilers try to generate a quantum circuit that leads to the best execution quality - a criterion that is usually approximated by figures of merit such as the number of (two-qubit) gates, the circuit depth, expecte"},"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":"2501.13155","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2025-01-22T19:00:01Z","cross_cats_sorted":[],"title_canon_sha256":"a3d49b8f88a48ba9499550279e76bb70feff490aa5e422fcca87e5a327211446","abstract_canon_sha256":"9d033fc3097316ed57f23e1bedf5459b503aa307da99dd09eadd4e8f6837d9e5"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-07T02:17:05.278457Z","signature_b64":"tAHHSFHYn3xJ4AAvfdAu0wdnJfSEp/aIuybvzQyjgfTrrP/dN5R+cedBchoaZ6R7h8Geiz2CX+YtBp/xOWlyDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"17c0a9b2938b0f961320bb5a225a7ab83119f99f90d7bc0f3ae0f80470c86d54","last_reissued_at":"2026-07-07T02:17:05.277580Z","signature_status":"signed_v1","first_computed_at":"2026-07-07T02:17:05.277580Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Improving Figures of Merit for Quantum Circuit Compilation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Laura Schulz, Nils Quetschlich, Patrick Hopf, Robert Wille","submitted_at":"2025-01-22T19:00:01Z","abstract_excerpt":"Quantum computing is an emerging technology that has seen significant software and hardware improvements in recent years. Executing a quantum program requires the compilation of its quantum circuit for a target Quantum Processing Unit (QPU). Various methods for qubit mapping, gate synthesis, and optimization of quantum circuits have been proposed and implemented in compilers. These compilers try to generate a quantum circuit that leads to the best execution quality - a criterion that is usually approximated by figures of merit such as the number of (two-qubit) gates, the circuit depth, expecte"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2501.13155","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/2501.13155/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":"2501.13155","created_at":"2026-07-07T02:17:05.277701+00:00"},{"alias_kind":"arxiv_version","alias_value":"2501.13155v1","created_at":"2026-07-07T02:17:05.277701+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2501.13155","created_at":"2026-07-07T02:17:05.277701+00:00"},{"alias_kind":"pith_short_12","alias_value":"C7AKTMUTRMHZ","created_at":"2026-07-07T02:17:05.277701+00:00"},{"alias_kind":"pith_short_16","alias_value":"C7AKTMUTRMHZMEZA","created_at":"2026-07-07T02:17:05.277701+00:00"},{"alias_kind":"pith_short_8","alias_value":"C7AKTMUT","created_at":"2026-07-07T02:17:05.277701+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":2,"sample":[{"citing_arxiv_id":"2505.08928","citing_title":"TeleSABRE: Layout Synthesis in Multi-Core Quantum Systems with Teleport Interconnect","ref_index":44,"is_internal_anchor":true},{"citing_arxiv_id":"2605.21662","citing_title":"Fidelity-Aware Frequency Allocation and Transpilation Co-Design for Tunable Coupler Quantum Systems","ref_index":25,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/C7AKTMUTRMHZMEZAXNNCEWT2XA","json":"https://pith.science/pith/C7AKTMUTRMHZMEZAXNNCEWT2XA.json","graph_json":"https://pith.science/api/pith-number/C7AKTMUTRMHZMEZAXNNCEWT2XA/graph.json","events_json":"https://pith.science/api/pith-number/C7AKTMUTRMHZMEZAXNNCEWT2XA/events.json","paper":"https://pith.science/paper/C7AKTMUT"},"agent_actions":{"view_html":"https://pith.science/pith/C7AKTMUTRMHZMEZAXNNCEWT2XA","download_json":"https://pith.science/pith/C7AKTMUTRMHZMEZAXNNCEWT2XA.json","view_paper":"https://pith.science/paper/C7AKTMUT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2501.13155&json=true","fetch_graph":"https://pith.science/api/pith-number/C7AKTMUTRMHZMEZAXNNCEWT2XA/graph.json","fetch_events":"https://pith.science/api/pith-number/C7AKTMUTRMHZMEZAXNNCEWT2XA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/C7AKTMUTRMHZMEZAXNNCEWT2XA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/C7AKTMUTRMHZMEZAXNNCEWT2XA/action/storage_attestation","attest_author":"https://pith.science/pith/C7AKTMUTRMHZMEZAXNNCEWT2XA/action/author_attestation","sign_citation":"https://pith.science/pith/C7AKTMUTRMHZMEZAXNNCEWT2XA/action/citation_signature","submit_replication":"https://pith.science/pith/C7AKTMUTRMHZMEZAXNNCEWT2XA/action/replication_record"}},"created_at":"2026-07-07T02:17:05.277701+00:00","updated_at":"2026-07-07T02:17:05.277701+00:00"}