{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:PM6IANDN665HVVHCZED7AR2SM5","short_pith_number":"pith:PM6IANDN","schema_version":"1.0","canonical_sha256":"7b3c80346df7ba7ad4e2c907f047526744862e571f7e39fafdee445af18c3203","source":{"kind":"arxiv","id":"2005.12259","version":1},"attestation_state":"computed","paper":{"title":"Time-Sliced Quantum Circuit Partitioning for Modular Architectures","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.ET"],"primary_cat":"quant-ph","authors_text":"Alexander Hoover, Casey Duckering, Frederic T. Chong, Jonathan M. Baker","submitted_at":"2020-05-25T17:58:44Z","abstract_excerpt":"Current quantum computer designs will not scale. To scale beyond small prototypes, quantum architectures will likely adopt a modular approach with clusters of tightly connected quantum bits and sparser connections between clusters. We exploit this clustering and the statically-known control flow of quantum programs to create tractable partitioning heuristics which map quantum circuits to modular physical machines one time slice at a time. Specifically, we create optimized mappings for each time slice, accounting for the cost to move data from the previous time slice and using a tunable lookahe"},"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":"2005.12259","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2020-05-25T17:58:44Z","cross_cats_sorted":["cs.ET"],"title_canon_sha256":"180bd93cb20510629eafa8de22e01fd0e73e3e73dcb0a50864a90c2371b7e478","abstract_canon_sha256":"34c9065f6061136358dc6ed990686cf460714b2cd424a200599cdb6aa1e58bf3"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:05:32.433454Z","signature_b64":"QLdDabisvJLJ0EGmh+uNgxAOqpwP/k86+BSSx3POM9rHvEvtcroBedWdjxMRzld6Sf4cpnrFM6OZlfVsVlXSCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7b3c80346df7ba7ad4e2c907f047526744862e571f7e39fafdee445af18c3203","last_reissued_at":"2026-07-05T01:05:32.433042Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:05:32.433042Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Time-Sliced Quantum Circuit Partitioning for Modular Architectures","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.ET"],"primary_cat":"quant-ph","authors_text":"Alexander Hoover, Casey Duckering, Frederic T. Chong, Jonathan M. Baker","submitted_at":"2020-05-25T17:58:44Z","abstract_excerpt":"Current quantum computer designs will not scale. To scale beyond small prototypes, quantum architectures will likely adopt a modular approach with clusters of tightly connected quantum bits and sparser connections between clusters. We exploit this clustering and the statically-known control flow of quantum programs to create tractable partitioning heuristics which map quantum circuits to modular physical machines one time slice at a time. Specifically, we create optimized mappings for each time slice, accounting for the cost to move data from the previous time slice and using a tunable lookahe"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2005.12259","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/2005.12259/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":"2005.12259","created_at":"2026-07-05T01:05:32.433103+00:00"},{"alias_kind":"arxiv_version","alias_value":"2005.12259v1","created_at":"2026-07-05T01:05:32.433103+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2005.12259","created_at":"2026-07-05T01:05:32.433103+00:00"},{"alias_kind":"pith_short_12","alias_value":"PM6IANDN665H","created_at":"2026-07-05T01:05:32.433103+00:00"},{"alias_kind":"pith_short_16","alias_value":"PM6IANDN665HVVHC","created_at":"2026-07-05T01:05:32.433103+00:00"},{"alias_kind":"pith_short_8","alias_value":"PM6IANDN","created_at":"2026-07-05T01:05:32.433103+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.02389","citing_title":"Rethinking How to Act: Action-Space Engineering for Reinforcement Learning-Based Circuit Routing in Distributed Quantum Systems","ref_index":2,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/PM6IANDN665HVVHCZED7AR2SM5","json":"https://pith.science/pith/PM6IANDN665HVVHCZED7AR2SM5.json","graph_json":"https://pith.science/api/pith-number/PM6IANDN665HVVHCZED7AR2SM5/graph.json","events_json":"https://pith.science/api/pith-number/PM6IANDN665HVVHCZED7AR2SM5/events.json","paper":"https://pith.science/paper/PM6IANDN"},"agent_actions":{"view_html":"https://pith.science/pith/PM6IANDN665HVVHCZED7AR2SM5","download_json":"https://pith.science/pith/PM6IANDN665HVVHCZED7AR2SM5.json","view_paper":"https://pith.science/paper/PM6IANDN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2005.12259&json=true","fetch_graph":"https://pith.science/api/pith-number/PM6IANDN665HVVHCZED7AR2SM5/graph.json","fetch_events":"https://pith.science/api/pith-number/PM6IANDN665HVVHCZED7AR2SM5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PM6IANDN665HVVHCZED7AR2SM5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PM6IANDN665HVVHCZED7AR2SM5/action/storage_attestation","attest_author":"https://pith.science/pith/PM6IANDN665HVVHCZED7AR2SM5/action/author_attestation","sign_citation":"https://pith.science/pith/PM6IANDN665HVVHCZED7AR2SM5/action/citation_signature","submit_replication":"https://pith.science/pith/PM6IANDN665HVVHCZED7AR2SM5/action/replication_record"}},"created_at":"2026-07-05T01:05:32.433103+00:00","updated_at":"2026-07-05T01:05:32.433103+00:00"}