{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:JMY7YES76D3KF3WKXGCNJ5LXVG","short_pith_number":"pith:JMY7YES7","schema_version":"1.0","canonical_sha256":"4b31fc125ff0f6a2eecab984d4f577a99fc55ceb0503983698cce787be4b601d","source":{"kind":"arxiv","id":"2501.12470","version":3},"attestation_state":"computed","paper":{"title":"Efficient Compilation for Shuttling Trapped-Ion Machines via the Position Graph Architectural Abstraction","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.ET"],"primary_cat":"quant-ph","authors_text":"Bao Bach, Ed Younis, Ilya Safro","submitted_at":"2025-01-21T19:39:03Z","abstract_excerpt":"With the growth of quantum platforms for gate-based quantum computation, compilation holds a crucial role in deciding the success of the implementation. While there has been rich research in compilation techniques for the superconducting-qubit regime. The trapped-ion architectures, currently leading in robust quantum computations for their reliable operations, still lack competitive compilation strategies. This work introduces a unifying hardware abstraction, the ``position graph'', representing various hardware architectures. With this abstraction, we model trapped-ion Quantum Charge-Coupled "},"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":"2501.12470","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2025-01-21T19:39:03Z","cross_cats_sorted":["cs.ET"],"title_canon_sha256":"47eab5c95dd7ff440040492d90916116ab3e89be5a1eaec64b769cce3c5439e5","abstract_canon_sha256":"1760690f3b0d995ea25c48cc5d4f67e83d2cd8486018697003dbf77ab888d21b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-20T00:05:26.805211Z","signature_b64":"CqrxCAmbrldk9UJjEKWzyZ9fd9A2pXrxOLtz9LP35w/G8W1O2pugKDftJZjJGv4vMRACLpcw2dvt/hWgfbulDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4b31fc125ff0f6a2eecab984d4f577a99fc55ceb0503983698cce787be4b601d","last_reissued_at":"2026-05-20T00:05:26.804362Z","signature_status":"signed_v1","first_computed_at":"2026-05-20T00:05:26.804362Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Efficient Compilation for Shuttling Trapped-Ion Machines via the Position Graph Architectural Abstraction","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.ET"],"primary_cat":"quant-ph","authors_text":"Bao Bach, Ed Younis, Ilya Safro","submitted_at":"2025-01-21T19:39:03Z","abstract_excerpt":"With the growth of quantum platforms for gate-based quantum computation, compilation holds a crucial role in deciding the success of the implementation. While there has been rich research in compilation techniques for the superconducting-qubit regime. The trapped-ion architectures, currently leading in robust quantum computations for their reliable operations, still lack competitive compilation strategies. This work introduces a unifying hardware abstraction, the ``position graph'', representing various hardware architectures. With this abstraction, we model trapped-ion Quantum Charge-Coupled "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2501.12470","kind":"arxiv","version":3},"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/2501.12470/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":"2501.12470","created_at":"2026-05-20T00:05:26.804495+00:00"},{"alias_kind":"arxiv_version","alias_value":"2501.12470v3","created_at":"2026-05-20T00:05:26.804495+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2501.12470","created_at":"2026-05-20T00:05:26.804495+00:00"},{"alias_kind":"pith_short_12","alias_value":"JMY7YES76D3K","created_at":"2026-05-20T00:05:26.804495+00:00"},{"alias_kind":"pith_short_16","alias_value":"JMY7YES76D3KF3WK","created_at":"2026-05-20T00:05:26.804495+00:00"},{"alias_kind":"pith_short_8","alias_value":"JMY7YES7","created_at":"2026-05-20T00:05:26.804495+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":2,"sample":[{"citing_arxiv_id":"2605.12365","citing_title":"QAP-Router: Tackling Qubit Routing as Dynamic Quadratic Assignment with Reinforcement Learning","ref_index":4,"is_internal_anchor":true},{"citing_arxiv_id":"2605.09237","citing_title":"Scaling Qubit Mapping and Routing With Position Graph Abstraction and Memoization","ref_index":8,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/JMY7YES76D3KF3WKXGCNJ5LXVG","json":"https://pith.science/pith/JMY7YES76D3KF3WKXGCNJ5LXVG.json","graph_json":"https://pith.science/api/pith-number/JMY7YES76D3KF3WKXGCNJ5LXVG/graph.json","events_json":"https://pith.science/api/pith-number/JMY7YES76D3KF3WKXGCNJ5LXVG/events.json","paper":"https://pith.science/paper/JMY7YES7"},"agent_actions":{"view_html":"https://pith.science/pith/JMY7YES76D3KF3WKXGCNJ5LXVG","download_json":"https://pith.science/pith/JMY7YES76D3KF3WKXGCNJ5LXVG.json","view_paper":"https://pith.science/paper/JMY7YES7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2501.12470&json=true","fetch_graph":"https://pith.science/api/pith-number/JMY7YES76D3KF3WKXGCNJ5LXVG/graph.json","fetch_events":"https://pith.science/api/pith-number/JMY7YES76D3KF3WKXGCNJ5LXVG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JMY7YES76D3KF3WKXGCNJ5LXVG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JMY7YES76D3KF3WKXGCNJ5LXVG/action/storage_attestation","attest_author":"https://pith.science/pith/JMY7YES76D3KF3WKXGCNJ5LXVG/action/author_attestation","sign_citation":"https://pith.science/pith/JMY7YES76D3KF3WKXGCNJ5LXVG/action/citation_signature","submit_replication":"https://pith.science/pith/JMY7YES76D3KF3WKXGCNJ5LXVG/action/replication_record"}},"created_at":"2026-05-20T00:05:26.804495+00:00","updated_at":"2026-05-20T00:05:26.804495+00:00"}