{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:6NXPQQTUMDMGA7HGHHUCI63DTB","short_pith_number":"pith:6NXPQQTU","schema_version":"1.0","canonical_sha256":"f36ef8427460d8607ce639e8247b63986ea77dc49baa3cad8a1b8af85756a703","source":{"kind":"arxiv","id":"2312.15254","version":1},"attestation_state":"computed","paper":{"title":"Ecmas: Efficient Circuit Mapping and Scheduling for Surface Code","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Chi Zhang, Hao Fu, Jun Wu, Mingzheng Zhu, Wei Xie, Xiang-Yang Li","submitted_at":"2023-12-23T13:27:59Z","abstract_excerpt":"As the leading candidate of quantum error correction codes, surface code suffers from significant overhead, such as execution time. Reducing the circuit's execution time not only enhances its execution efficiency but also improves fidelity. However, finding the shortest execution time is NP-hard.\n  In this work, we study the surface code mapping and scheduling problem. To reduce the execution time of a quantum circuit, we first introduce two novel metrics: Circuit Parallelism Degree and Chip Communication Capacity to quantitatively characterize quantum circuits and chips. Then, we propose a re"},"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":"2312.15254","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2023-12-23T13:27:59Z","cross_cats_sorted":[],"title_canon_sha256":"fb5490978fa65efe68c90f7158b61ebeebee13c2274933d336da68c78f13c572","abstract_canon_sha256":"e89066826c08fe9c7034d1650fa4b6926ce381cf821f36706b0985933efa63b2"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:27:32.888300Z","signature_b64":"/er9E1LUHG+L1OROtSF3Xx9SarB+0YVv78tXtNIkxT6/5a7uZ2VWtLTU/pXwJ4U3+GG3aNh6MPqaC0j/2copBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f36ef8427460d8607ce639e8247b63986ea77dc49baa3cad8a1b8af85756a703","last_reissued_at":"2026-07-05T07:27:32.887894Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:27:32.887894Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Ecmas: Efficient Circuit Mapping and Scheduling for Surface Code","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Chi Zhang, Hao Fu, Jun Wu, Mingzheng Zhu, Wei Xie, Xiang-Yang Li","submitted_at":"2023-12-23T13:27:59Z","abstract_excerpt":"As the leading candidate of quantum error correction codes, surface code suffers from significant overhead, such as execution time. Reducing the circuit's execution time not only enhances its execution efficiency but also improves fidelity. However, finding the shortest execution time is NP-hard.\n  In this work, we study the surface code mapping and scheduling problem. To reduce the execution time of a quantum circuit, we first introduce two novel metrics: Circuit Parallelism Degree and Chip Communication Capacity to quantitatively characterize quantum circuits and chips. Then, we propose a re"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2312.15254","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/2312.15254/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":"2312.15254","created_at":"2026-07-05T07:27:32.887952+00:00"},{"alias_kind":"arxiv_version","alias_value":"2312.15254v1","created_at":"2026-07-05T07:27:32.887952+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2312.15254","created_at":"2026-07-05T07:27:32.887952+00:00"},{"alias_kind":"pith_short_12","alias_value":"6NXPQQTUMDMG","created_at":"2026-07-05T07:27:32.887952+00:00"},{"alias_kind":"pith_short_16","alias_value":"6NXPQQTUMDMGA7HG","created_at":"2026-07-05T07:27:32.887952+00:00"},{"alias_kind":"pith_short_8","alias_value":"6NXPQQTU","created_at":"2026-07-05T07:27:32.887952+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2608.03315","citing_title":"Harvest: Resource-Aware Quantum Compilation for Magic State Protocols","ref_index":43,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/6NXPQQTUMDMGA7HGHHUCI63DTB","json":"https://pith.science/pith/6NXPQQTUMDMGA7HGHHUCI63DTB.json","graph_json":"https://pith.science/api/pith-number/6NXPQQTUMDMGA7HGHHUCI63DTB/graph.json","events_json":"https://pith.science/api/pith-number/6NXPQQTUMDMGA7HGHHUCI63DTB/events.json","paper":"https://pith.science/paper/6NXPQQTU"},"agent_actions":{"view_html":"https://pith.science/pith/6NXPQQTUMDMGA7HGHHUCI63DTB","download_json":"https://pith.science/pith/6NXPQQTUMDMGA7HGHHUCI63DTB.json","view_paper":"https://pith.science/paper/6NXPQQTU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2312.15254&json=true","fetch_graph":"https://pith.science/api/pith-number/6NXPQQTUMDMGA7HGHHUCI63DTB/graph.json","fetch_events":"https://pith.science/api/pith-number/6NXPQQTUMDMGA7HGHHUCI63DTB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/6NXPQQTUMDMGA7HGHHUCI63DTB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/6NXPQQTUMDMGA7HGHHUCI63DTB/action/storage_attestation","attest_author":"https://pith.science/pith/6NXPQQTUMDMGA7HGHHUCI63DTB/action/author_attestation","sign_citation":"https://pith.science/pith/6NXPQQTUMDMGA7HGHHUCI63DTB/action/citation_signature","submit_replication":"https://pith.science/pith/6NXPQQTUMDMGA7HGHHUCI63DTB/action/replication_record"}},"created_at":"2026-07-05T07:27:32.887952+00:00","updated_at":"2026-07-05T07:27:32.887952+00:00"}