{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:4R5N52N6ZOUKUFIRIJ6LRTTPYK","short_pith_number":"pith:4R5N52N6","schema_version":"1.0","canonical_sha256":"e47adee9becba8aa1511427cb8ce6fc29e5f5bc181c2a3bb220e5237ce5720d5","source":{"kind":"arxiv","id":"2607.03275","version":1},"attestation_state":"computed","paper":{"title":"Comparing and learning figures of merit for quantum circuit compilation","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Anton Frisk Kockum, Harshdeep Singh, Marvin Richter, Mats Granath","submitted_at":"2026-07-03T12:42:16Z","abstract_excerpt":"To make quantum algorithms executable on a particular quantum device, they need to be compiled into circuits that respect constraints of the quantum hardware. This compilation usually involves multiple steps, where many hardware-compatible circuits are generated, and the best circuit is selected. To say which circuit is best, the quality of a circuit is generally quantified by a $\\textit{figure of merit}$ (FoM). For FoMs, there is a trade-off between ease of calculation and accuracy in predicted execution quality. Commonly used FoMs, e.g., the number of gates, circuit depth, etc., are easy to "},"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":"2607.03275","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2026-07-03T12:42:16Z","cross_cats_sorted":[],"title_canon_sha256":"a456fd56917b74355d29d98e830fe4fa5f0d70a673abec9e47c474c33f71fd86","abstract_canon_sha256":"68a75f54cf990482f14cccc7dce16b8b64a42d0e1acbd744d0cdb5613b4544f2"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-07T01:16:49.596590Z","signature_b64":"PgpmlLXEDSnRmTnrN7oBZ/1lJHzNDrKRT5FKrGWkauJc9HkIa2mbGjN7zNn04b6a+F8D/rDQ/RIUu2kTbTjLDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e47adee9becba8aa1511427cb8ce6fc29e5f5bc181c2a3bb220e5237ce5720d5","last_reissued_at":"2026-07-07T01:16:49.595965Z","signature_status":"signed_v1","first_computed_at":"2026-07-07T01:16:49.595965Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Comparing and learning figures of merit for quantum circuit compilation","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Anton Frisk Kockum, Harshdeep Singh, Marvin Richter, Mats Granath","submitted_at":"2026-07-03T12:42:16Z","abstract_excerpt":"To make quantum algorithms executable on a particular quantum device, they need to be compiled into circuits that respect constraints of the quantum hardware. This compilation usually involves multiple steps, where many hardware-compatible circuits are generated, and the best circuit is selected. To say which circuit is best, the quality of a circuit is generally quantified by a $\\textit{figure of merit}$ (FoM). For FoMs, there is a trade-off between ease of calculation and accuracy in predicted execution quality. Commonly used FoMs, e.g., the number of gates, circuit depth, etc., are easy to "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.03275","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/2607.03275/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":"2607.03275","created_at":"2026-07-07T01:16:49.596048+00:00"},{"alias_kind":"arxiv_version","alias_value":"2607.03275v1","created_at":"2026-07-07T01:16:49.596048+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.03275","created_at":"2026-07-07T01:16:49.596048+00:00"},{"alias_kind":"pith_short_12","alias_value":"4R5N52N6ZOUK","created_at":"2026-07-07T01:16:49.596048+00:00"},{"alias_kind":"pith_short_16","alias_value":"4R5N52N6ZOUKUFIR","created_at":"2026-07-07T01:16:49.596048+00:00"},{"alias_kind":"pith_short_8","alias_value":"4R5N52N6","created_at":"2026-07-07T01:16:49.596048+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/4R5N52N6ZOUKUFIRIJ6LRTTPYK","json":"https://pith.science/pith/4R5N52N6ZOUKUFIRIJ6LRTTPYK.json","graph_json":"https://pith.science/api/pith-number/4R5N52N6ZOUKUFIRIJ6LRTTPYK/graph.json","events_json":"https://pith.science/api/pith-number/4R5N52N6ZOUKUFIRIJ6LRTTPYK/events.json","paper":"https://pith.science/paper/4R5N52N6"},"agent_actions":{"view_html":"https://pith.science/pith/4R5N52N6ZOUKUFIRIJ6LRTTPYK","download_json":"https://pith.science/pith/4R5N52N6ZOUKUFIRIJ6LRTTPYK.json","view_paper":"https://pith.science/paper/4R5N52N6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2607.03275&json=true","fetch_graph":"https://pith.science/api/pith-number/4R5N52N6ZOUKUFIRIJ6LRTTPYK/graph.json","fetch_events":"https://pith.science/api/pith-number/4R5N52N6ZOUKUFIRIJ6LRTTPYK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4R5N52N6ZOUKUFIRIJ6LRTTPYK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4R5N52N6ZOUKUFIRIJ6LRTTPYK/action/storage_attestation","attest_author":"https://pith.science/pith/4R5N52N6ZOUKUFIRIJ6LRTTPYK/action/author_attestation","sign_citation":"https://pith.science/pith/4R5N52N6ZOUKUFIRIJ6LRTTPYK/action/citation_signature","submit_replication":"https://pith.science/pith/4R5N52N6ZOUKUFIRIJ6LRTTPYK/action/replication_record"}},"created_at":"2026-07-07T01:16:49.596048+00:00","updated_at":"2026-07-07T01:16:49.596048+00:00"}