{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:FTP76IDI7B6ZY2AYWVJQZXQCUQ","short_pith_number":"pith:FTP76IDI","schema_version":"1.0","canonical_sha256":"2cdfff2068f87d9c6818b5530cde02a437662a767b6e95783d70621310697cc6","source":{"kind":"arxiv","id":"1910.00038","version":3},"attestation_state":"computed","paper":{"title":"Quasi-exact quantum computation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cond-mat.str-el"],"primary_cat":"quant-ph","authors_text":"Cihan Okay, Dong-Sheng Wang, Guanyu Zhu, Raymond Laflamme","submitted_at":"2019-09-30T18:09:44Z","abstract_excerpt":"We study quasi-exact quantum error correcting codes and quantum computation with them. A quasi-exact code is an approximate code such that it contains a finite number of scaling parameters, the tuning of which can flow it to corresponding exact codes, serving as its fixed points. The computation with a quasi-exact code cannot realize any logical gate to arbitrary accuracy. To overcome this, the notion of quasi-exact universality is proposed, which makes quasi-exact quantum computation a feasible model especially for executing moderate-size algorithms. We find that the incompatibility between u"},"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":"1910.00038","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2019-09-30T18:09:44Z","cross_cats_sorted":["cond-mat.str-el"],"title_canon_sha256":"cf1ab4728ff31c6183abf244e728dc24d8013c9ed1020b7a46ad0fabf2b8a9cb","abstract_canon_sha256":"a9c5d35c57245189902427f0681ebc3bfbff028d9ab601052a37fd0d37ea1f66"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:22:37.781643Z","signature_b64":"N5LcY+ZrU0vYolskkxpeoKGJWusdB7dLJaLihhyjJOtmfQwgeMo6pUmjNJHSnOhT791+03mFHXLniZNYyn3iBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2cdfff2068f87d9c6818b5530cde02a437662a767b6e95783d70621310697cc6","last_reissued_at":"2026-07-05T01:22:37.781112Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:22:37.781112Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Quasi-exact quantum computation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cond-mat.str-el"],"primary_cat":"quant-ph","authors_text":"Cihan Okay, Dong-Sheng Wang, Guanyu Zhu, Raymond Laflamme","submitted_at":"2019-09-30T18:09:44Z","abstract_excerpt":"We study quasi-exact quantum error correcting codes and quantum computation with them. A quasi-exact code is an approximate code such that it contains a finite number of scaling parameters, the tuning of which can flow it to corresponding exact codes, serving as its fixed points. The computation with a quasi-exact code cannot realize any logical gate to arbitrary accuracy. To overcome this, the notion of quasi-exact universality is proposed, which makes quasi-exact quantum computation a feasible model especially for executing moderate-size algorithms. We find that the incompatibility between u"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1910.00038","kind":"arxiv","version":3},"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/1910.00038/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":"1910.00038","created_at":"2026-07-05T01:22:37.781170+00:00"},{"alias_kind":"arxiv_version","alias_value":"1910.00038v3","created_at":"2026-07-05T01:22:37.781170+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1910.00038","created_at":"2026-07-05T01:22:37.781170+00:00"},{"alias_kind":"pith_short_12","alias_value":"FTP76IDI7B6Z","created_at":"2026-07-05T01:22:37.781170+00:00"},{"alias_kind":"pith_short_16","alias_value":"FTP76IDI7B6ZY2AY","created_at":"2026-07-05T01:22:37.781170+00:00"},{"alias_kind":"pith_short_8","alias_value":"FTP76IDI","created_at":"2026-07-05T01:22:37.781170+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/FTP76IDI7B6ZY2AYWVJQZXQCUQ","json":"https://pith.science/pith/FTP76IDI7B6ZY2AYWVJQZXQCUQ.json","graph_json":"https://pith.science/api/pith-number/FTP76IDI7B6ZY2AYWVJQZXQCUQ/graph.json","events_json":"https://pith.science/api/pith-number/FTP76IDI7B6ZY2AYWVJQZXQCUQ/events.json","paper":"https://pith.science/paper/FTP76IDI"},"agent_actions":{"view_html":"https://pith.science/pith/FTP76IDI7B6ZY2AYWVJQZXQCUQ","download_json":"https://pith.science/pith/FTP76IDI7B6ZY2AYWVJQZXQCUQ.json","view_paper":"https://pith.science/paper/FTP76IDI","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1910.00038&json=true","fetch_graph":"https://pith.science/api/pith-number/FTP76IDI7B6ZY2AYWVJQZXQCUQ/graph.json","fetch_events":"https://pith.science/api/pith-number/FTP76IDI7B6ZY2AYWVJQZXQCUQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FTP76IDI7B6ZY2AYWVJQZXQCUQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FTP76IDI7B6ZY2AYWVJQZXQCUQ/action/storage_attestation","attest_author":"https://pith.science/pith/FTP76IDI7B6ZY2AYWVJQZXQCUQ/action/author_attestation","sign_citation":"https://pith.science/pith/FTP76IDI7B6ZY2AYWVJQZXQCUQ/action/citation_signature","submit_replication":"https://pith.science/pith/FTP76IDI7B6ZY2AYWVJQZXQCUQ/action/replication_record"}},"created_at":"2026-07-05T01:22:37.781170+00:00","updated_at":"2026-07-05T01:22:37.781170+00:00"}