{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:YT34ZZAGERDTA224FNZSA2RSNJ","short_pith_number":"pith:YT34ZZAG","schema_version":"1.0","canonical_sha256":"c4f7cce4062447306b5c2b73206a326a5d864bbebe16ae339181beb43b286e39","source":{"kind":"arxiv","id":"2504.17886","version":2},"attestation_state":"computed","paper":{"title":"TrapSIMD: SIMD-Aware Compiler Optimization for 2D Trapped-Ion Quantum Machines","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Ang Li, David Hayes, Eric Hudson, Hartmut Haeffner, Hezi Zhang, Jens Palsberg, Jixuan Ruan, Travis Humble, Wesley C. Campbell, Xiang Fang, Yufei Ding","submitted_at":"2025-04-24T18:49:51Z","abstract_excerpt":"Modular trapped-ion (TI) architectures offer a scalable quantum computing (QC) platform, with native transport behaviors that closely resemble the Single Instruction Multiple Data (SIMD) paradigm. We present FluxTrap, a SIMD-aware compiler framework that establishes a hardware-software co-design interface for TI systems. FluxTrap introduces a novel abstraction that unifies SIMD-style instructions -- including segmented intra-trap shift SIMD (S3) and global junction transfer SIMD (JT-SIMD) operations -- with a SIMD-enriched architectural graph, capturing key features such as transport synchroni"},"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":"2504.17886","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2025-04-24T18:49:51Z","cross_cats_sorted":[],"title_canon_sha256":"718c35599b314df98e8d587820195f31642ff41af8fafc49cdeca4864c90b90a","abstract_canon_sha256":"e2a81de82de02fe531c1ec6c59013867cbf468daea8c5703202a4470292ea18e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:54:48.379856Z","signature_b64":"+qE8sY2hPIRXY3csUpM1ZWzzY3QXLHZyGmKO6jzfGCskGAg87fAOg/PLlDreeQTbirliHWv/TQo6a5EHKEagCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c4f7cce4062447306b5c2b73206a326a5d864bbebe16ae339181beb43b286e39","last_reissued_at":"2026-07-05T10:54:48.379384Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:54:48.379384Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"TrapSIMD: SIMD-Aware Compiler Optimization for 2D Trapped-Ion Quantum Machines","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Ang Li, David Hayes, Eric Hudson, Hartmut Haeffner, Hezi Zhang, Jens Palsberg, Jixuan Ruan, Travis Humble, Wesley C. Campbell, Xiang Fang, Yufei Ding","submitted_at":"2025-04-24T18:49:51Z","abstract_excerpt":"Modular trapped-ion (TI) architectures offer a scalable quantum computing (QC) platform, with native transport behaviors that closely resemble the Single Instruction Multiple Data (SIMD) paradigm. We present FluxTrap, a SIMD-aware compiler framework that establishes a hardware-software co-design interface for TI systems. FluxTrap introduces a novel abstraction that unifies SIMD-style instructions -- including segmented intra-trap shift SIMD (S3) and global junction transfer SIMD (JT-SIMD) operations -- with a SIMD-enriched architectural graph, capturing key features such as transport synchroni"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2504.17886","kind":"arxiv","version":2},"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/2504.17886/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":"2504.17886","created_at":"2026-07-05T10:54:48.379442+00:00"},{"alias_kind":"arxiv_version","alias_value":"2504.17886v2","created_at":"2026-07-05T10:54:48.379442+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2504.17886","created_at":"2026-07-05T10:54:48.379442+00:00"},{"alias_kind":"pith_short_12","alias_value":"YT34ZZAGERDT","created_at":"2026-07-05T10:54:48.379442+00:00"},{"alias_kind":"pith_short_16","alias_value":"YT34ZZAGERDTA224","created_at":"2026-07-05T10:54:48.379442+00:00"},{"alias_kind":"pith_short_8","alias_value":"YT34ZZAG","created_at":"2026-07-05T10:54:48.379442+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.09237","citing_title":"Scaling Qubit Mapping and Routing With Position Graph Abstraction and Memoization","ref_index":22,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/YT34ZZAGERDTA224FNZSA2RSNJ","json":"https://pith.science/pith/YT34ZZAGERDTA224FNZSA2RSNJ.json","graph_json":"https://pith.science/api/pith-number/YT34ZZAGERDTA224FNZSA2RSNJ/graph.json","events_json":"https://pith.science/api/pith-number/YT34ZZAGERDTA224FNZSA2RSNJ/events.json","paper":"https://pith.science/paper/YT34ZZAG"},"agent_actions":{"view_html":"https://pith.science/pith/YT34ZZAGERDTA224FNZSA2RSNJ","download_json":"https://pith.science/pith/YT34ZZAGERDTA224FNZSA2RSNJ.json","view_paper":"https://pith.science/paper/YT34ZZAG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2504.17886&json=true","fetch_graph":"https://pith.science/api/pith-number/YT34ZZAGERDTA224FNZSA2RSNJ/graph.json","fetch_events":"https://pith.science/api/pith-number/YT34ZZAGERDTA224FNZSA2RSNJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YT34ZZAGERDTA224FNZSA2RSNJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YT34ZZAGERDTA224FNZSA2RSNJ/action/storage_attestation","attest_author":"https://pith.science/pith/YT34ZZAGERDTA224FNZSA2RSNJ/action/author_attestation","sign_citation":"https://pith.science/pith/YT34ZZAGERDTA224FNZSA2RSNJ/action/citation_signature","submit_replication":"https://pith.science/pith/YT34ZZAGERDTA224FNZSA2RSNJ/action/replication_record"}},"created_at":"2026-07-05T10:54:48.379442+00:00","updated_at":"2026-07-05T10:54:48.379442+00:00"}