{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:ZC765X6TTY22NDC3BLRRYUYY57","short_pith_number":"pith:ZC765X6T","schema_version":"1.0","canonical_sha256":"c8bfeedfd39e35a68c5b0ae31c5318efcd1cae8976cd9eaad03f0bedf0c623c7","source":{"kind":"arxiv","id":"1812.00954","version":2},"attestation_state":"computed","paper":{"title":"Trading T gates for dirty qubits in state preparation and unitary synthesis","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Guang Hao Low, Luke Schaeffer, Vadym Kliuchnikov","submitted_at":"2018-12-03T18:24:32Z","abstract_excerpt":"Efficient synthesis of arbitrary quantum states and unitaries from a universal fault-tolerant gate-set e.g. Clifford+T is a key subroutine in quantum computation. As large quantum algorithms feature many qubits that encode coherent quantum information but remain idle for parts of the computation, these should be used if it minimizes overall gate counts, especially that of the expensive T-gates. We present a quantum algorithm for preparing any dimension-$N$ pure quantum state specified by a list of $N$ classical numbers, that realizes a trade-off between space and T-gates. Our scheme uses $\\mat"},"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":"1812.00954","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2018-12-03T18:24:32Z","cross_cats_sorted":[],"title_canon_sha256":"7e38ae35c4dccd677e773cd86d42d1ca05523188b6196ba20de316a3fb9216c6","abstract_canon_sha256":"e7d3cd0ed95b6d14fe8a68bd919c919bdc105b45ebd9f6fbfafe70079a23f4a2"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:33:12.805057Z","signature_b64":"XHZw7dQqm99iJYO78Hmq0CdQ/nJR+iwaDQEDl8co9MHT483dCalKtXl6BGXm8J0AiKonwlB8F3TjVguj3F8mAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c8bfeedfd39e35a68c5b0ae31c5318efcd1cae8976cd9eaad03f0bedf0c623c7","last_reissued_at":"2026-07-05T08:33:12.804622Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:33:12.804622Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Trading T gates for dirty qubits in state preparation and unitary synthesis","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Guang Hao Low, Luke Schaeffer, Vadym Kliuchnikov","submitted_at":"2018-12-03T18:24:32Z","abstract_excerpt":"Efficient synthesis of arbitrary quantum states and unitaries from a universal fault-tolerant gate-set e.g. Clifford+T is a key subroutine in quantum computation. As large quantum algorithms feature many qubits that encode coherent quantum information but remain idle for parts of the computation, these should be used if it minimizes overall gate counts, especially that of the expensive T-gates. We present a quantum algorithm for preparing any dimension-$N$ pure quantum state specified by a list of $N$ classical numbers, that realizes a trade-off between space and T-gates. Our scheme uses $\\mat"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1812.00954","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/1812.00954/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":"1812.00954","created_at":"2026-07-05T08:33:12.804687+00:00"},{"alias_kind":"arxiv_version","alias_value":"1812.00954v2","created_at":"2026-07-05T08:33:12.804687+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1812.00954","created_at":"2026-07-05T08:33:12.804687+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZC765X6TTY22","created_at":"2026-07-05T08:33:12.804687+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZC765X6TTY22NDC3","created_at":"2026-07-05T08:33:12.804687+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZC765X6T","created_at":"2026-07-05T08:33:12.804687+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2409.17595","citing_title":"Magic state cultivation: growing T states as cheap as CNOT gates","ref_index":38,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/ZC765X6TTY22NDC3BLRRYUYY57","json":"https://pith.science/pith/ZC765X6TTY22NDC3BLRRYUYY57.json","graph_json":"https://pith.science/api/pith-number/ZC765X6TTY22NDC3BLRRYUYY57/graph.json","events_json":"https://pith.science/api/pith-number/ZC765X6TTY22NDC3BLRRYUYY57/events.json","paper":"https://pith.science/paper/ZC765X6T"},"agent_actions":{"view_html":"https://pith.science/pith/ZC765X6TTY22NDC3BLRRYUYY57","download_json":"https://pith.science/pith/ZC765X6TTY22NDC3BLRRYUYY57.json","view_paper":"https://pith.science/paper/ZC765X6T","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1812.00954&json=true","fetch_graph":"https://pith.science/api/pith-number/ZC765X6TTY22NDC3BLRRYUYY57/graph.json","fetch_events":"https://pith.science/api/pith-number/ZC765X6TTY22NDC3BLRRYUYY57/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZC765X6TTY22NDC3BLRRYUYY57/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZC765X6TTY22NDC3BLRRYUYY57/action/storage_attestation","attest_author":"https://pith.science/pith/ZC765X6TTY22NDC3BLRRYUYY57/action/author_attestation","sign_citation":"https://pith.science/pith/ZC765X6TTY22NDC3BLRRYUYY57/action/citation_signature","submit_replication":"https://pith.science/pith/ZC765X6TTY22NDC3BLRRYUYY57/action/replication_record"}},"created_at":"2026-07-05T08:33:12.804687+00:00","updated_at":"2026-07-05T08:33:12.804687+00:00"}