{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:3SDIUW3D6IFAM2NVMDNVVJBYA7","short_pith_number":"pith:3SDIUW3D","schema_version":"1.0","canonical_sha256":"dc868a5b63f20a0669b560db5aa43807e0965cc963e948bacd48ad77a3d746b7","source":{"kind":"arxiv","id":"2608.06892","version":1},"attestation_state":"computed","paper":{"title":"Architecture-Aware Reinforcement Learning for Communication-Efficient Distributed Quantum Circuit Compilation","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Chien-Tung Kuo, Felix Burt, Kin K. Leung, Kuan-Cheng Chen, Samuel Yen-Chi Chen","submitted_at":"2026-08-07T07:25:18Z","abstract_excerpt":"Distributed quantum computing provides a scalable route for executing quantum circuits beyond the capacity limits of a single quantum processing unit (QPU), but it introduces a communication-aware compilation problem involving strict hardware constraints and circuit dependencies. This paper presents an architecture-aware reinforcement-learning framework that formulates distributed quantum compilation as a constrained Markov Decision Process (MDP). The compiler-level communication actions dynamically update logical-qubit placement and enable subsequent gate execution. A heterogeneous graph mode"},"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":"2608.06892","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2026-08-07T07:25:18Z","cross_cats_sorted":[],"title_canon_sha256":"9db578a424db88cf4113fcaed752553348ad757001c3815528cd1b741f91b0e9","abstract_canon_sha256":"a4603dcf8f6637dcd665171762a75207f2659f63a7bab61c0d3aeabc5fe0a6fb"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-08-10T01:12:26.090562Z","signature_b64":"lmCQIi3YgB6ei3/oRjBv23bjahCQdlU7dBZD3+auMU8kgxLGabPO20ZcLDOKXkxNFBBHcBk4wEJ37QyoNoz8CA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"dc868a5b63f20a0669b560db5aa43807e0965cc963e948bacd48ad77a3d746b7","last_reissued_at":"2026-08-10T01:12:26.087947Z","signature_status":"signed_v1","first_computed_at":"2026-08-10T01:12:26.087947Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Architecture-Aware Reinforcement Learning for Communication-Efficient Distributed Quantum Circuit Compilation","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Chien-Tung Kuo, Felix Burt, Kin K. Leung, Kuan-Cheng Chen, Samuel Yen-Chi Chen","submitted_at":"2026-08-07T07:25:18Z","abstract_excerpt":"Distributed quantum computing provides a scalable route for executing quantum circuits beyond the capacity limits of a single quantum processing unit (QPU), but it introduces a communication-aware compilation problem involving strict hardware constraints and circuit dependencies. This paper presents an architecture-aware reinforcement-learning framework that formulates distributed quantum compilation as a constrained Markov Decision Process (MDP). The compiler-level communication actions dynamically update logical-qubit placement and enable subsequent gate execution. A heterogeneous graph mode"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2608.06892","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/2608.06892/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":"2608.06892","created_at":"2026-08-10T01:12:26.089045+00:00"},{"alias_kind":"arxiv_version","alias_value":"2608.06892v1","created_at":"2026-08-10T01:12:26.089045+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2608.06892","created_at":"2026-08-10T01:12:26.089045+00:00"},{"alias_kind":"pith_short_12","alias_value":"3SDIUW3D6IFA","created_at":"2026-08-10T01:12:26.089045+00:00"},{"alias_kind":"pith_short_16","alias_value":"3SDIUW3D6IFAM2NV","created_at":"2026-08-10T01:12:26.089045+00:00"},{"alias_kind":"pith_short_8","alias_value":"3SDIUW3D","created_at":"2026-08-10T01:12:26.089045+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/3SDIUW3D6IFAM2NVMDNVVJBYA7","json":"https://pith.science/pith/3SDIUW3D6IFAM2NVMDNVVJBYA7.json","graph_json":"https://pith.science/api/pith-number/3SDIUW3D6IFAM2NVMDNVVJBYA7/graph.json","events_json":"https://pith.science/api/pith-number/3SDIUW3D6IFAM2NVMDNVVJBYA7/events.json","paper":"https://pith.science/paper/3SDIUW3D"},"agent_actions":{"view_html":"https://pith.science/pith/3SDIUW3D6IFAM2NVMDNVVJBYA7","download_json":"https://pith.science/pith/3SDIUW3D6IFAM2NVMDNVVJBYA7.json","view_paper":"https://pith.science/paper/3SDIUW3D","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2608.06892&json=true","fetch_graph":"https://pith.science/api/pith-number/3SDIUW3D6IFAM2NVMDNVVJBYA7/graph.json","fetch_events":"https://pith.science/api/pith-number/3SDIUW3D6IFAM2NVMDNVVJBYA7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3SDIUW3D6IFAM2NVMDNVVJBYA7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3SDIUW3D6IFAM2NVMDNVVJBYA7/action/storage_attestation","attest_author":"https://pith.science/pith/3SDIUW3D6IFAM2NVMDNVVJBYA7/action/author_attestation","sign_citation":"https://pith.science/pith/3SDIUW3D6IFAM2NVMDNVVJBYA7/action/citation_signature","submit_replication":"https://pith.science/pith/3SDIUW3D6IFAM2NVMDNVVJBYA7/action/replication_record"}},"created_at":"2026-08-10T01:12:26.089045+00:00","updated_at":"2026-08-10T01:12:26.089045+00:00"}