{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:LHPRKAUEV3UKGCFWXRBSW4TK67","short_pith_number":"pith:LHPRKAUE","schema_version":"1.0","canonical_sha256":"59df150284aee8a308b6bc432b726af7d261ee4d21d8fe9b159933e34821ea71","source":{"kind":"arxiv","id":"1302.3240","version":2},"attestation_state":"computed","paper":{"title":"Complex instruction set computing architecture for performing accurate quantum $Z$ rotations with less magic","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Andrew J. Landahl, Chris Cesare","submitted_at":"2013-02-13T21:11:48Z","abstract_excerpt":"We present quantum protocols for executing arbitrarily accurate $\\pi/2^k$ rotations of a qubit about its $Z$ axis. Reduced instruction set computing (\\textsc{risc}) architectures typically restrict the instruction set to stabilizer operations and a single non-stabilizer operation, such as preparation of a \"magic\" state from which $T = Z(\\pi/4)$ gates can be teleported. Although the overhead required to distill high-fidelity copies of this magic state is high, the subsequent quantum compiling overhead to realize $Z$ rotations in a \\textsc{risc} architecture can be much greater. We develop a com"},"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":"1302.3240","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2013-02-13T21:11:48Z","cross_cats_sorted":[],"title_canon_sha256":"8d8cabb2ddeffece32ac93f6e20e94e1408de0d134d5c660da58cf0f6f3b4d96","abstract_canon_sha256":"ccbb2fac14d461a54c12de0770f420c2131ac9615b65262368c1ab6b0610c3f4"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:10:26.749853Z","signature_b64":"IoKP/EJp7URKdFJu0EvwIH6VXOwFAuRkHjBm6Bn+dol0nHWgdv6StBF8yM39yiFArIw6p4KIRFiAxgeyUIrjCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"59df150284aee8a308b6bc432b726af7d261ee4d21d8fe9b159933e34821ea71","last_reissued_at":"2026-05-18T03:10:26.749159Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:10:26.749159Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Complex instruction set computing architecture for performing accurate quantum $Z$ rotations with less magic","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Andrew J. Landahl, Chris Cesare","submitted_at":"2013-02-13T21:11:48Z","abstract_excerpt":"We present quantum protocols for executing arbitrarily accurate $\\pi/2^k$ rotations of a qubit about its $Z$ axis. Reduced instruction set computing (\\textsc{risc}) architectures typically restrict the instruction set to stabilizer operations and a single non-stabilizer operation, such as preparation of a \"magic\" state from which $T = Z(\\pi/4)$ gates can be teleported. Although the overhead required to distill high-fidelity copies of this magic state is high, the subsequent quantum compiling overhead to realize $Z$ rotations in a \\textsc{risc} architecture can be much greater. We develop a com"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1302.3240","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":""},"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":"1302.3240","created_at":"2026-05-18T03:10:26.749256+00:00"},{"alias_kind":"arxiv_version","alias_value":"1302.3240v2","created_at":"2026-05-18T03:10:26.749256+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1302.3240","created_at":"2026-05-18T03:10:26.749256+00:00"},{"alias_kind":"pith_short_12","alias_value":"LHPRKAUEV3UK","created_at":"2026-05-18T12:27:51.066281+00:00"},{"alias_kind":"pith_short_16","alias_value":"LHPRKAUEV3UKGCFW","created_at":"2026-05-18T12:27:51.066281+00:00"},{"alias_kind":"pith_short_8","alias_value":"LHPRKAUE","created_at":"2026-05-18T12:27:51.066281+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":3,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2409.00433","citing_title":"High-Precision Multi-Qubit Clifford+T Synthesis by Unitary Diagonalization","ref_index":26,"is_internal_anchor":true},{"citing_arxiv_id":"2409.17595","citing_title":"Magic state cultivation: growing T states as cheap as CNOT gates","ref_index":35,"is_internal_anchor":false},{"citing_arxiv_id":"2604.15436","citing_title":"Parity-unfolded distillation architecture for noise-biased platforms","ref_index":26,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/LHPRKAUEV3UKGCFWXRBSW4TK67","json":"https://pith.science/pith/LHPRKAUEV3UKGCFWXRBSW4TK67.json","graph_json":"https://pith.science/api/pith-number/LHPRKAUEV3UKGCFWXRBSW4TK67/graph.json","events_json":"https://pith.science/api/pith-number/LHPRKAUEV3UKGCFWXRBSW4TK67/events.json","paper":"https://pith.science/paper/LHPRKAUE"},"agent_actions":{"view_html":"https://pith.science/pith/LHPRKAUEV3UKGCFWXRBSW4TK67","download_json":"https://pith.science/pith/LHPRKAUEV3UKGCFWXRBSW4TK67.json","view_paper":"https://pith.science/paper/LHPRKAUE","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1302.3240&json=true","fetch_graph":"https://pith.science/api/pith-number/LHPRKAUEV3UKGCFWXRBSW4TK67/graph.json","fetch_events":"https://pith.science/api/pith-number/LHPRKAUEV3UKGCFWXRBSW4TK67/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LHPRKAUEV3UKGCFWXRBSW4TK67/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LHPRKAUEV3UKGCFWXRBSW4TK67/action/storage_attestation","attest_author":"https://pith.science/pith/LHPRKAUEV3UKGCFWXRBSW4TK67/action/author_attestation","sign_citation":"https://pith.science/pith/LHPRKAUEV3UKGCFWXRBSW4TK67/action/citation_signature","submit_replication":"https://pith.science/pith/LHPRKAUEV3UKGCFWXRBSW4TK67/action/replication_record"}},"created_at":"2026-05-18T03:10:26.749256+00:00","updated_at":"2026-05-18T03:10:26.749256+00:00"}