{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:IXTZGSSBW6IMUGR5RHKS554HEW","short_pith_number":"pith:IXTZGSSB","schema_version":"1.0","canonical_sha256":"45e7934a41b790ca1a3d89d52ef78725b3b3ae4f9cee78abf98c46131894e5d9","source":{"kind":"arxiv","id":"2412.03249","version":1},"attestation_state":"computed","paper":{"title":"MLQM: Machine Learning Approach for Accelerating Optimal Qubit Mapping","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.ET"],"primary_cat":"quant-ph","authors_text":"Geng Chen, Guowu Yang, Lianhui Yu, Wenjie Sun, Xiaoyu Li, Zhigang Wang","submitted_at":"2024-12-04T11:49:09Z","abstract_excerpt":"Quantum circuit mapping is a critical process in quantum computing that involves adapting logical quantum circuits to adhere to hardware constraints, thereby generating physically executable quantum circuits. Current quantum circuit mapping techniques, such as solver-based methods, often encounter challenges related to slow solving speeds due to factors like redundant search iterations. Regarding this issue, we propose a machine learning approach for accelerating optimal qubit mapping (MLQM). First, the method proposes a global search space pruning scheme based on prior knowledge and machine l"},"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":"2412.03249","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2024-12-04T11:49:09Z","cross_cats_sorted":["cs.ET"],"title_canon_sha256":"660b546c4ef2931be5bffef9f5b230eeb1a90b39564bb5c5bebf730b2ca71ed3","abstract_canon_sha256":"b1fe3ce52c5f6f2e3dfc6c4f8ee1bef582c5a531503cf4817f07a1fa2cb10a7c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:32:21.419437Z","signature_b64":"6ivjTMfgb8FDcaSNFlxIWuJVm9eONdPaLQxICf43sTwmztwbi7jZuLMCykIr663+IIevUuh95upcv6oUokREAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"45e7934a41b790ca1a3d89d52ef78725b3b3ae4f9cee78abf98c46131894e5d9","last_reissued_at":"2026-07-05T11:32:21.418771Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:32:21.418771Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"MLQM: Machine Learning Approach for Accelerating Optimal Qubit Mapping","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.ET"],"primary_cat":"quant-ph","authors_text":"Geng Chen, Guowu Yang, Lianhui Yu, Wenjie Sun, Xiaoyu Li, Zhigang Wang","submitted_at":"2024-12-04T11:49:09Z","abstract_excerpt":"Quantum circuit mapping is a critical process in quantum computing that involves adapting logical quantum circuits to adhere to hardware constraints, thereby generating physically executable quantum circuits. Current quantum circuit mapping techniques, such as solver-based methods, often encounter challenges related to slow solving speeds due to factors like redundant search iterations. Regarding this issue, we propose a machine learning approach for accelerating optimal qubit mapping (MLQM). First, the method proposes a global search space pruning scheme based on prior knowledge and machine l"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2412.03249","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/2412.03249/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":"2412.03249","created_at":"2026-07-05T11:32:21.418852+00:00"},{"alias_kind":"arxiv_version","alias_value":"2412.03249v1","created_at":"2026-07-05T11:32:21.418852+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2412.03249","created_at":"2026-07-05T11:32:21.418852+00:00"},{"alias_kind":"pith_short_12","alias_value":"IXTZGSSBW6IM","created_at":"2026-07-05T11:32:21.418852+00:00"},{"alias_kind":"pith_short_16","alias_value":"IXTZGSSBW6IMUGR5","created_at":"2026-07-05T11:32:21.418852+00:00"},{"alias_kind":"pith_short_8","alias_value":"IXTZGSSB","created_at":"2026-07-05T11:32:21.418852+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/IXTZGSSBW6IMUGR5RHKS554HEW","json":"https://pith.science/pith/IXTZGSSBW6IMUGR5RHKS554HEW.json","graph_json":"https://pith.science/api/pith-number/IXTZGSSBW6IMUGR5RHKS554HEW/graph.json","events_json":"https://pith.science/api/pith-number/IXTZGSSBW6IMUGR5RHKS554HEW/events.json","paper":"https://pith.science/paper/IXTZGSSB"},"agent_actions":{"view_html":"https://pith.science/pith/IXTZGSSBW6IMUGR5RHKS554HEW","download_json":"https://pith.science/pith/IXTZGSSBW6IMUGR5RHKS554HEW.json","view_paper":"https://pith.science/paper/IXTZGSSB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2412.03249&json=true","fetch_graph":"https://pith.science/api/pith-number/IXTZGSSBW6IMUGR5RHKS554HEW/graph.json","fetch_events":"https://pith.science/api/pith-number/IXTZGSSBW6IMUGR5RHKS554HEW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/IXTZGSSBW6IMUGR5RHKS554HEW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/IXTZGSSBW6IMUGR5RHKS554HEW/action/storage_attestation","attest_author":"https://pith.science/pith/IXTZGSSBW6IMUGR5RHKS554HEW/action/author_attestation","sign_citation":"https://pith.science/pith/IXTZGSSBW6IMUGR5RHKS554HEW/action/citation_signature","submit_replication":"https://pith.science/pith/IXTZGSSBW6IMUGR5RHKS554HEW/action/replication_record"}},"created_at":"2026-07-05T11:32:21.418852+00:00","updated_at":"2026-07-05T11:32:21.418852+00:00"}