{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:QK256DKICQMTNALDKA2I7WM6JH","short_pith_number":"pith:QK256DKI","schema_version":"1.0","canonical_sha256":"82b5df0d48141936816350348fd99e49ea4920ff1b2d26506c1b9c7ca7b66bbc","source":{"kind":"arxiv","id":"2207.01964","version":4},"attestation_state":"computed","paper":{"title":"Quantum Circuit Compiler for a Shuttling-Based Trapped-Ion Quantum Computer","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.CL","cs.ET"],"primary_cat":"quant-ph","authors_text":"Andr\\'e Brinkmann, Christian Melzer, Diego Olvera Mill\\'an, Fabian Kreppel, Ferdinand Schmidt-Kaler, Janine Hilder, Janis Wagner, Ulrich Poschinger","submitted_at":"2022-07-05T11:21:09Z","abstract_excerpt":"The increasing capabilities of quantum computing hardware and the challenge of realizing deep quantum circuits require fully automated and efficient tools for compiling quantum circuits. To express arbitrary circuits in a sequence of native gates specific to the quantum computer architecture, it is necessary to make algorithms portable across the landscape of quantum hardware providers. In this work, we present a compiler capable of transforming and optimizing a quantum circuit targeting a shuttling-based trapped-ion quantum processor. It consists of custom algorithms set on top of the quantum"},"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":"2207.01964","kind":"arxiv","version":4},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2022-07-05T11:21:09Z","cross_cats_sorted":["cs.CL","cs.ET"],"title_canon_sha256":"d616bfb86f039fd860d51b1e4ec5d458bba225a945385223d7a1900afbe1b443","abstract_canon_sha256":"bf23e626b396f906839ee2786cfd362cd581d75ffface02a2f6bf1ddac03b674"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:12:32.461151Z","signature_b64":"TsfaQUMVuNDCp7YHBZq1p4d8M3NtKucqk2oFwzri7SfDNf+egnRN9+8jLZ32aAXSZl6gwOwDHzuQemclxuQ9Cw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"82b5df0d48141936816350348fd99e49ea4920ff1b2d26506c1b9c7ca7b66bbc","last_reissued_at":"2026-07-05T07:12:32.460719Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:12:32.460719Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Quantum Circuit Compiler for a Shuttling-Based Trapped-Ion Quantum Computer","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.CL","cs.ET"],"primary_cat":"quant-ph","authors_text":"Andr\\'e Brinkmann, Christian Melzer, Diego Olvera Mill\\'an, Fabian Kreppel, Ferdinand Schmidt-Kaler, Janine Hilder, Janis Wagner, Ulrich Poschinger","submitted_at":"2022-07-05T11:21:09Z","abstract_excerpt":"The increasing capabilities of quantum computing hardware and the challenge of realizing deep quantum circuits require fully automated and efficient tools for compiling quantum circuits. To express arbitrary circuits in a sequence of native gates specific to the quantum computer architecture, it is necessary to make algorithms portable across the landscape of quantum hardware providers. In this work, we present a compiler capable of transforming and optimizing a quantum circuit targeting a shuttling-based trapped-ion quantum processor. It consists of custom algorithms set on top of the quantum"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2207.01964","kind":"arxiv","version":4},"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/2207.01964/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":"2207.01964","created_at":"2026-07-05T07:12:32.460775+00:00"},{"alias_kind":"arxiv_version","alias_value":"2207.01964v4","created_at":"2026-07-05T07:12:32.460775+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2207.01964","created_at":"2026-07-05T07:12:32.460775+00:00"},{"alias_kind":"pith_short_12","alias_value":"QK256DKICQMT","created_at":"2026-07-05T07:12:32.460775+00:00"},{"alias_kind":"pith_short_16","alias_value":"QK256DKICQMTNALD","created_at":"2026-07-05T07:12:32.460775+00:00"},{"alias_kind":"pith_short_8","alias_value":"QK256DKI","created_at":"2026-07-05T07:12:32.460775+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2505.16891","citing_title":"Quantum Compiler Design for Qubit Mapping and Routing: A Cross-Architectural Survey of Superconducting, Trapped-Ion, and Neutral Atom Systems","ref_index":87,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/QK256DKICQMTNALDKA2I7WM6JH","json":"https://pith.science/pith/QK256DKICQMTNALDKA2I7WM6JH.json","graph_json":"https://pith.science/api/pith-number/QK256DKICQMTNALDKA2I7WM6JH/graph.json","events_json":"https://pith.science/api/pith-number/QK256DKICQMTNALDKA2I7WM6JH/events.json","paper":"https://pith.science/paper/QK256DKI"},"agent_actions":{"view_html":"https://pith.science/pith/QK256DKICQMTNALDKA2I7WM6JH","download_json":"https://pith.science/pith/QK256DKICQMTNALDKA2I7WM6JH.json","view_paper":"https://pith.science/paper/QK256DKI","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2207.01964&json=true","fetch_graph":"https://pith.science/api/pith-number/QK256DKICQMTNALDKA2I7WM6JH/graph.json","fetch_events":"https://pith.science/api/pith-number/QK256DKICQMTNALDKA2I7WM6JH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QK256DKICQMTNALDKA2I7WM6JH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QK256DKICQMTNALDKA2I7WM6JH/action/storage_attestation","attest_author":"https://pith.science/pith/QK256DKICQMTNALDKA2I7WM6JH/action/author_attestation","sign_citation":"https://pith.science/pith/QK256DKICQMTNALDKA2I7WM6JH/action/citation_signature","submit_replication":"https://pith.science/pith/QK256DKICQMTNALDKA2I7WM6JH/action/replication_record"}},"created_at":"2026-07-05T07:12:32.460775+00:00","updated_at":"2026-07-05T07:12:32.460775+00:00"}