{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:OF64K5QJBY7YNV5AHNP2BJPSU3","short_pith_number":"pith:OF64K5QJ","schema_version":"1.0","canonical_sha256":"717dc576090e3f86d7a03b5fa0a5f2a6cef9686285f516602b65b16b6b9331ae","source":{"kind":"arxiv","id":"1603.07678","version":4},"attestation_state":"computed","paper":{"title":"Basic circuit compilation techniques for an ion-trap quantum machine","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.ET"],"primary_cat":"quant-ph","authors_text":"Dmitri Maslov","submitted_at":"2016-03-24T17:46:31Z","abstract_excerpt":"We study the problem of compilation of quantum algorithms into optimized physical-level circuits executable in a quantum information processing (QIP) experiment based on trapped atomic ions. We report a complete strategy: starting with an algorithm in the form of a quantum computer program, we compile it into a high-level logical circuit that goes through multiple stages of decomposition into progressively lower-level circuits until we reach the physical execution-level specification. We skip the fault-tolerance layer, as it is not within the scope of this work. The different stages are struct"},"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":"1603.07678","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2016-03-24T17:46:31Z","cross_cats_sorted":["cs.ET"],"title_canon_sha256":"bc7d4596de26d1d932621379e608b3569c3f7a060792cd733026af433dc3a5be","abstract_canon_sha256":"70ebf5ce52003f871242514b13f0a4042f93edf524c7cbde908fdea48af904ca"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:50:22.527826Z","signature_b64":"saxP743w/gyQqOsDtYdW0lxzCzSKfxTGZAuMPg9EbTXgAVwFSj3Mj8xEYSkq923k0J+W/IxT6p2+xzXnboT1Aw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"717dc576090e3f86d7a03b5fa0a5f2a6cef9686285f516602b65b16b6b9331ae","last_reissued_at":"2026-05-18T00:50:22.527003Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:50:22.527003Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Basic circuit compilation techniques for an ion-trap quantum machine","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.ET"],"primary_cat":"quant-ph","authors_text":"Dmitri Maslov","submitted_at":"2016-03-24T17:46:31Z","abstract_excerpt":"We study the problem of compilation of quantum algorithms into optimized physical-level circuits executable in a quantum information processing (QIP) experiment based on trapped atomic ions. We report a complete strategy: starting with an algorithm in the form of a quantum computer program, we compile it into a high-level logical circuit that goes through multiple stages of decomposition into progressively lower-level circuits until we reach the physical execution-level specification. We skip the fault-tolerance layer, as it is not within the scope of this work. The different stages are struct"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1603.07678","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":""},"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":"1603.07678","created_at":"2026-05-18T00:50:22.527136+00:00"},{"alias_kind":"arxiv_version","alias_value":"1603.07678v4","created_at":"2026-05-18T00:50:22.527136+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1603.07678","created_at":"2026-05-18T00:50:22.527136+00:00"},{"alias_kind":"pith_short_12","alias_value":"OF64K5QJBY7Y","created_at":"2026-05-18T12:30:36.002864+00:00"},{"alias_kind":"pith_short_16","alias_value":"OF64K5QJBY7YNV5A","created_at":"2026-05-18T12:30:36.002864+00:00"},{"alias_kind":"pith_short_8","alias_value":"OF64K5QJ","created_at":"2026-05-18T12:30:36.002864+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/OF64K5QJBY7YNV5AHNP2BJPSU3","json":"https://pith.science/pith/OF64K5QJBY7YNV5AHNP2BJPSU3.json","graph_json":"https://pith.science/api/pith-number/OF64K5QJBY7YNV5AHNP2BJPSU3/graph.json","events_json":"https://pith.science/api/pith-number/OF64K5QJBY7YNV5AHNP2BJPSU3/events.json","paper":"https://pith.science/paper/OF64K5QJ"},"agent_actions":{"view_html":"https://pith.science/pith/OF64K5QJBY7YNV5AHNP2BJPSU3","download_json":"https://pith.science/pith/OF64K5QJBY7YNV5AHNP2BJPSU3.json","view_paper":"https://pith.science/paper/OF64K5QJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1603.07678&json=true","fetch_graph":"https://pith.science/api/pith-number/OF64K5QJBY7YNV5AHNP2BJPSU3/graph.json","fetch_events":"https://pith.science/api/pith-number/OF64K5QJBY7YNV5AHNP2BJPSU3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/OF64K5QJBY7YNV5AHNP2BJPSU3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/OF64K5QJBY7YNV5AHNP2BJPSU3/action/storage_attestation","attest_author":"https://pith.science/pith/OF64K5QJBY7YNV5AHNP2BJPSU3/action/author_attestation","sign_citation":"https://pith.science/pith/OF64K5QJBY7YNV5AHNP2BJPSU3/action/citation_signature","submit_replication":"https://pith.science/pith/OF64K5QJBY7YNV5AHNP2BJPSU3/action/replication_record"}},"created_at":"2026-05-18T00:50:22.527136+00:00","updated_at":"2026-05-18T00:50:22.527136+00:00"}