{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:ERP3IL7HFXP2M6CVDMGCWX6R4C","short_pith_number":"pith:ERP3IL7H","schema_version":"1.0","canonical_sha256":"245fb42fe72ddfa678551b0c2b5fd1e0abba9c5fb9b336c7719d30498763be11","source":{"kind":"arxiv","id":"1612.01011","version":1},"attestation_state":"computed","paper":{"title":"Turning Gate Synthesis Errors into Incoherent Errors","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"M. B. Hastings","submitted_at":"2016-12-03T19:49:41Z","abstract_excerpt":"Using error correcting codes and fault tolerant techniques, it is possible, at least in theory, to produce logical qubits with significantly lower error rates than the underlying physical qubits. Suppose, however, that the gates that act on these logical qubits are only approximation of the desired gate. This can arise, for example, in synthesizing a single qubit unitary from a set of Clifford and $T$ gates; for a generic such unitary, any finite sequence of gates only approximates the desired target. In this case, errors in the gate can add coherently so that, roughly, the error $\\epsilon$ in"},"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":"1612.01011","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2016-12-03T19:49:41Z","cross_cats_sorted":[],"title_canon_sha256":"773e6b1d15c5cf620f4069381178adf3996004944416c899a50d7f08f1b4e2f0","abstract_canon_sha256":"8cd64f43630be2e79f2f6fd924e3aa3b0d6e6b591ce740e31baccedd8e50648c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:55:53.597898Z","signature_b64":"IQ23Mx+uadTToqhsTlbklxsxHpydvNvmmfILx7TBHteGkyYVQ+Y5xOmGIsdwnnu2pJgBQE0FB6AkAXrkotaGCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"245fb42fe72ddfa678551b0c2b5fd1e0abba9c5fb9b336c7719d30498763be11","last_reissued_at":"2026-05-18T00:55:53.597378Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:55:53.597378Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Turning Gate Synthesis Errors into Incoherent Errors","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"M. B. Hastings","submitted_at":"2016-12-03T19:49:41Z","abstract_excerpt":"Using error correcting codes and fault tolerant techniques, it is possible, at least in theory, to produce logical qubits with significantly lower error rates than the underlying physical qubits. Suppose, however, that the gates that act on these logical qubits are only approximation of the desired gate. This can arise, for example, in synthesizing a single qubit unitary from a set of Clifford and $T$ gates; for a generic such unitary, any finite sequence of gates only approximates the desired target. In this case, errors in the gate can add coherently so that, roughly, the error $\\epsilon$ in"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1612.01011","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":""},"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":"1612.01011","created_at":"2026-05-18T00:55:53.597489+00:00"},{"alias_kind":"arxiv_version","alias_value":"1612.01011v1","created_at":"2026-05-18T00:55:53.597489+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1612.01011","created_at":"2026-05-18T00:55:53.597489+00:00"},{"alias_kind":"pith_short_12","alias_value":"ERP3IL7HFXP2","created_at":"2026-05-18T12:30:12.583610+00:00"},{"alias_kind":"pith_short_16","alias_value":"ERP3IL7HFXP2M6CV","created_at":"2026-05-18T12:30:12.583610+00:00"},{"alias_kind":"pith_short_8","alias_value":"ERP3IL7H","created_at":"2026-05-18T12:30:12.583610+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/ERP3IL7HFXP2M6CVDMGCWX6R4C","json":"https://pith.science/pith/ERP3IL7HFXP2M6CVDMGCWX6R4C.json","graph_json":"https://pith.science/api/pith-number/ERP3IL7HFXP2M6CVDMGCWX6R4C/graph.json","events_json":"https://pith.science/api/pith-number/ERP3IL7HFXP2M6CVDMGCWX6R4C/events.json","paper":"https://pith.science/paper/ERP3IL7H"},"agent_actions":{"view_html":"https://pith.science/pith/ERP3IL7HFXP2M6CVDMGCWX6R4C","download_json":"https://pith.science/pith/ERP3IL7HFXP2M6CVDMGCWX6R4C.json","view_paper":"https://pith.science/paper/ERP3IL7H","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1612.01011&json=true","fetch_graph":"https://pith.science/api/pith-number/ERP3IL7HFXP2M6CVDMGCWX6R4C/graph.json","fetch_events":"https://pith.science/api/pith-number/ERP3IL7HFXP2M6CVDMGCWX6R4C/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ERP3IL7HFXP2M6CVDMGCWX6R4C/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ERP3IL7HFXP2M6CVDMGCWX6R4C/action/storage_attestation","attest_author":"https://pith.science/pith/ERP3IL7HFXP2M6CVDMGCWX6R4C/action/author_attestation","sign_citation":"https://pith.science/pith/ERP3IL7HFXP2M6CVDMGCWX6R4C/action/citation_signature","submit_replication":"https://pith.science/pith/ERP3IL7HFXP2M6CVDMGCWX6R4C/action/replication_record"}},"created_at":"2026-05-18T00:55:53.597489+00:00","updated_at":"2026-05-18T00:55:53.597489+00:00"}