{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:M6X4NQAZ77CIVXFPTTDDVHN2NG","short_pith_number":"pith:M6X4NQAZ","schema_version":"1.0","canonical_sha256":"67afc6c019ffc48adcaf9cc63a9dba6996f05cb6965325a9a6e6702e113abcdc","source":{"kind":"arxiv","id":"2108.11874","version":1},"attestation_state":"computed","paper":{"title":"Noise-Adaptive Quantum Compilation Strategies Evaluated with Application-Motivated Benchmarks","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.CC","cs.DS"],"primary_cat":"quant-ph","authors_text":"Davide Ferrari, Michele Amoretti","submitted_at":"2021-08-26T16:06:00Z","abstract_excerpt":"Quantum compilation is the problem of translating an input quantum circuit into the most efficient equivalent of itself, taking into account the characteristics of the device that will execute the computation. Compilation strategies are composed of sequential passes that perform placement, routing and optimization tasks. Noise-adaptive compilers do take the noise statistics of the device into account, for some or all passes. The noise statics can be obtained from calibration data, and updated after each device calibration. In this paper, we propose a novel noise-adaptive compilation strategy t"},"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":"2108.11874","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2021-08-26T16:06:00Z","cross_cats_sorted":["cs.CC","cs.DS"],"title_canon_sha256":"88f8e62c904146e150f278b9cf8205e1292ba388e7a40694bce9b368c546a2ca","abstract_canon_sha256":"32955348f034c3dd02368a7cf24524b381dbf9716fce85d92f73d8dea2d12c3f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T04:25:11.745018Z","signature_b64":"LXMI9OPXtEXs1//lWVURLQmiqL89uZIJuADX6SEwKP3fkYPf1ScECwz/ZpqG5bJMXtooSwsOoqjdMczcUHr5BA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"67afc6c019ffc48adcaf9cc63a9dba6996f05cb6965325a9a6e6702e113abcdc","last_reissued_at":"2026-07-05T04:25:11.744540Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T04:25:11.744540Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Noise-Adaptive Quantum Compilation Strategies Evaluated with Application-Motivated Benchmarks","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.CC","cs.DS"],"primary_cat":"quant-ph","authors_text":"Davide Ferrari, Michele Amoretti","submitted_at":"2021-08-26T16:06:00Z","abstract_excerpt":"Quantum compilation is the problem of translating an input quantum circuit into the most efficient equivalent of itself, taking into account the characteristics of the device that will execute the computation. Compilation strategies are composed of sequential passes that perform placement, routing and optimization tasks. Noise-adaptive compilers do take the noise statistics of the device into account, for some or all passes. The noise statics can be obtained from calibration data, and updated after each device calibration. In this paper, we propose a novel noise-adaptive compilation strategy t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2108.11874","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/2108.11874/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":"2108.11874","created_at":"2026-07-05T04:25:11.744602+00:00"},{"alias_kind":"arxiv_version","alias_value":"2108.11874v1","created_at":"2026-07-05T04:25:11.744602+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2108.11874","created_at":"2026-07-05T04:25:11.744602+00:00"},{"alias_kind":"pith_short_12","alias_value":"M6X4NQAZ77CI","created_at":"2026-07-05T04:25:11.744602+00:00"},{"alias_kind":"pith_short_16","alias_value":"M6X4NQAZ77CIVXFP","created_at":"2026-07-05T04:25:11.744602+00:00"},{"alias_kind":"pith_short_8","alias_value":"M6X4NQAZ","created_at":"2026-07-05T04:25:11.744602+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2509.00812","citing_title":"Adaptive t Design Dummy-Gate Obfuscation for Cryogenic Scale Enforcement","ref_index":8,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/M6X4NQAZ77CIVXFPTTDDVHN2NG","json":"https://pith.science/pith/M6X4NQAZ77CIVXFPTTDDVHN2NG.json","graph_json":"https://pith.science/api/pith-number/M6X4NQAZ77CIVXFPTTDDVHN2NG/graph.json","events_json":"https://pith.science/api/pith-number/M6X4NQAZ77CIVXFPTTDDVHN2NG/events.json","paper":"https://pith.science/paper/M6X4NQAZ"},"agent_actions":{"view_html":"https://pith.science/pith/M6X4NQAZ77CIVXFPTTDDVHN2NG","download_json":"https://pith.science/pith/M6X4NQAZ77CIVXFPTTDDVHN2NG.json","view_paper":"https://pith.science/paper/M6X4NQAZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2108.11874&json=true","fetch_graph":"https://pith.science/api/pith-number/M6X4NQAZ77CIVXFPTTDDVHN2NG/graph.json","fetch_events":"https://pith.science/api/pith-number/M6X4NQAZ77CIVXFPTTDDVHN2NG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/M6X4NQAZ77CIVXFPTTDDVHN2NG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/M6X4NQAZ77CIVXFPTTDDVHN2NG/action/storage_attestation","attest_author":"https://pith.science/pith/M6X4NQAZ77CIVXFPTTDDVHN2NG/action/author_attestation","sign_citation":"https://pith.science/pith/M6X4NQAZ77CIVXFPTTDDVHN2NG/action/citation_signature","submit_replication":"https://pith.science/pith/M6X4NQAZ77CIVXFPTTDDVHN2NG/action/replication_record"}},"created_at":"2026-07-05T04:25:11.744602+00:00","updated_at":"2026-07-05T04:25:11.744602+00:00"}