{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:RPXXEEPD3WOYJU7AHULS2NIFVS","short_pith_number":"pith:RPXXEEPD","schema_version":"1.0","canonical_sha256":"8bef7211e3dd9d84d3e03d172d3505acb4d5192f47783f874f89e36097961c30","source":{"kind":"arxiv","id":"2303.17380","version":1},"attestation_state":"computed","paper":{"title":"Fault Tolerant Non-Clifford State Preparation for Arbitrary Rotations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Dirk Englund, Frederic T. Chong, Hyeongrak Choi, Yongshan Ding","submitted_at":"2023-03-30T13:46:52Z","abstract_excerpt":"Quantum error correction is an essential component for practical quantum computing on noisy quantum hardware. However, logical operations on error-corrected qubits require a significant resource overhead, especially for high-precision and high-fidelity non-Clifford rotation gates. To address this issue, we propose a postselection-based algorithm to efficiently prepare resource states for gate teleportation. Our algorithm achieves fault tolerance, demonstrating the exponential suppression of logical errors with code distance, and it applies to any stabilizer codes. We provide analytical derivat"},"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":"2303.17380","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2023-03-30T13:46:52Z","cross_cats_sorted":[],"title_canon_sha256":"ecd63889fcd9131ec692d86e20595e08f83c050c84fbf397a2d64f8a719fa351","abstract_canon_sha256":"f4e20331dabbd12398e83a82e3260ca73425650c4e0621f109313664e2a79d13"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:56:33.436480Z","signature_b64":"Ct9giNnPykEcB9pTnZmkci8uU7XaswSfZXqEH3TJlz3AMZhugYCBOIGp/qpX+H64sCUEusRTkb0cxug0l5ECCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8bef7211e3dd9d84d3e03d172d3505acb4d5192f47783f874f89e36097961c30","last_reissued_at":"2026-07-05T05:56:33.436056Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:56:33.436056Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Fault Tolerant Non-Clifford State Preparation for Arbitrary Rotations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Dirk Englund, Frederic T. Chong, Hyeongrak Choi, Yongshan Ding","submitted_at":"2023-03-30T13:46:52Z","abstract_excerpt":"Quantum error correction is an essential component for practical quantum computing on noisy quantum hardware. However, logical operations on error-corrected qubits require a significant resource overhead, especially for high-precision and high-fidelity non-Clifford rotation gates. To address this issue, we propose a postselection-based algorithm to efficiently prepare resource states for gate teleportation. Our algorithm achieves fault tolerance, demonstrating the exponential suppression of logical errors with code distance, and it applies to any stabilizer codes. We provide analytical derivat"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2303.17380","kind":"arxiv","version":1},"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/2303.17380/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":"2303.17380","created_at":"2026-07-05T05:56:33.436112+00:00"},{"alias_kind":"arxiv_version","alias_value":"2303.17380v1","created_at":"2026-07-05T05:56:33.436112+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2303.17380","created_at":"2026-07-05T05:56:33.436112+00:00"},{"alias_kind":"pith_short_12","alias_value":"RPXXEEPD3WOY","created_at":"2026-07-05T05:56:33.436112+00:00"},{"alias_kind":"pith_short_16","alias_value":"RPXXEEPD3WOYJU7A","created_at":"2026-07-05T05:56:33.436112+00:00"},{"alias_kind":"pith_short_8","alias_value":"RPXXEEPD","created_at":"2026-07-05T05:56:33.436112+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":7,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2607.08508","citing_title":"Magic Gate Teleportation: Structure, Useful Resource States, and Simpler Feedforward","ref_index":39,"is_internal_anchor":true},{"citing_arxiv_id":"2606.25011","citing_title":"Fast and Parallel High-Rate STAR Architecture for Megaquop Quantum Simulation","ref_index":49,"is_internal_anchor":false},{"citing_arxiv_id":"2605.28936","citing_title":"Hardware-Tailored Resource Estimation for Magic-State Distillation on Silicon Spin Qubits","ref_index":145,"is_internal_anchor":false},{"citing_arxiv_id":"2603.25101","citing_title":"T Count as a Numerically Solvable Minimization Problem","ref_index":5,"is_internal_anchor":false},{"citing_arxiv_id":"2605.15344","citing_title":"Fire and ice: Partially fault-tolerant quantum computing with selective state filtering","ref_index":7,"is_internal_anchor":false},{"citing_arxiv_id":"2509.07279","citing_title":"Recursive algorithm for constructing antisymmetric fermionic states in first quantization mapping","ref_index":36,"is_internal_anchor":false},{"citing_arxiv_id":"2509.07279","citing_title":"Recursive algorithm for constructing antisymmetric fermionic states in first quantization mapping","ref_index":37,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/RPXXEEPD3WOYJU7AHULS2NIFVS","json":"https://pith.science/pith/RPXXEEPD3WOYJU7AHULS2NIFVS.json","graph_json":"https://pith.science/api/pith-number/RPXXEEPD3WOYJU7AHULS2NIFVS/graph.json","events_json":"https://pith.science/api/pith-number/RPXXEEPD3WOYJU7AHULS2NIFVS/events.json","paper":"https://pith.science/paper/RPXXEEPD"},"agent_actions":{"view_html":"https://pith.science/pith/RPXXEEPD3WOYJU7AHULS2NIFVS","download_json":"https://pith.science/pith/RPXXEEPD3WOYJU7AHULS2NIFVS.json","view_paper":"https://pith.science/paper/RPXXEEPD","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2303.17380&json=true","fetch_graph":"https://pith.science/api/pith-number/RPXXEEPD3WOYJU7AHULS2NIFVS/graph.json","fetch_events":"https://pith.science/api/pith-number/RPXXEEPD3WOYJU7AHULS2NIFVS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RPXXEEPD3WOYJU7AHULS2NIFVS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RPXXEEPD3WOYJU7AHULS2NIFVS/action/storage_attestation","attest_author":"https://pith.science/pith/RPXXEEPD3WOYJU7AHULS2NIFVS/action/author_attestation","sign_citation":"https://pith.science/pith/RPXXEEPD3WOYJU7AHULS2NIFVS/action/citation_signature","submit_replication":"https://pith.science/pith/RPXXEEPD3WOYJU7AHULS2NIFVS/action/replication_record"}},"created_at":"2026-07-05T05:56:33.436112+00:00","updated_at":"2026-07-05T05:56:33.436112+00:00"}