{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2004:VXCALYXQLTK7UVH5NOZCXF3LTC","short_pith_number":"pith:VXCALYXQ","schema_version":"1.0","canonical_sha256":"adc405e2f05cd5fa54fd6bb22b976b98ad975d4f48bc4fc6b2ee288685ea4aaf","source":{"kind":"arxiv","id":"quant-ph/0402171","version":1},"attestation_state":"computed","paper":{"title":"Fault-Tolerant Postselected Quantum Computation: Schemes","license":"","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"E. Knill","submitted_at":"2004-02-23T22:15:11Z","abstract_excerpt":"Postselected quantum computation is distinguished from regular quantum computation by accepting the output only if measurement outcomes satisfy predetermined conditions. The output must be accepted with nonzero probability. Methods for implementing postselected quantum computation with noisy gates are proposed. These methods are based on error-detecting codes. Conditionally on detecting no errors, it is expected that the encoded computation can be made to be arbitrarily accurate. Although the probability of success of the encoded computation decreases dramatically with accuracy, it is possible"},"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":"quant-ph/0402171","kind":"arxiv","version":1},"metadata":{"license":"","primary_cat":"quant-ph","submitted_at":"2004-02-23T22:15:11Z","cross_cats_sorted":[],"title_canon_sha256":"854e4ea73ba2b8406a33efd34acef26e6f0a49da33d831a9c2986f0a61055019","abstract_canon_sha256":"e6c576b0f1a755f7eceb9e667b729197ba20b27351003f904dcd2a9a340d3e0b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-04T14:46:32.024340Z","signature_b64":"cKfPotDnTeWOHitsQQPJyX9Px/qC7zUAIGJAfkOFaqDzGRJ/e1paq7ZRl/jdMEWrG6xmoQYwDfmrxYnlKZfOBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"adc405e2f05cd5fa54fd6bb22b976b98ad975d4f48bc4fc6b2ee288685ea4aaf","last_reissued_at":"2026-07-04T14:46:32.023983Z","signature_status":"signed_v1","first_computed_at":"2026-07-04T14:46:32.023983Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Fault-Tolerant Postselected Quantum Computation: Schemes","license":"","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"E. Knill","submitted_at":"2004-02-23T22:15:11Z","abstract_excerpt":"Postselected quantum computation is distinguished from regular quantum computation by accepting the output only if measurement outcomes satisfy predetermined conditions. The output must be accepted with nonzero probability. Methods for implementing postselected quantum computation with noisy gates are proposed. These methods are based on error-detecting codes. Conditionally on detecting no errors, it is expected that the encoded computation can be made to be arbitrarily accurate. Although the probability of success of the encoded computation decreases dramatically with accuracy, it is possible"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"quant-ph/0402171","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/quant-ph/0402171/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":"quant-ph/0402171","created_at":"2026-07-04T14:46:32.024038+00:00"},{"alias_kind":"arxiv_version","alias_value":"quant-ph/0402171v1","created_at":"2026-07-04T14:46:32.024038+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.quant-ph/0402171","created_at":"2026-07-04T14:46:32.024038+00:00"},{"alias_kind":"pith_short_12","alias_value":"VXCALYXQLTK7","created_at":"2026-07-04T14:46:32.024038+00:00"},{"alias_kind":"pith_short_16","alias_value":"VXCALYXQLTK7UVH5","created_at":"2026-07-04T14:46:32.024038+00:00"},{"alias_kind":"pith_short_8","alias_value":"VXCALYXQ","created_at":"2026-07-04T14:46:32.024038+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":16,"internal_anchor_count":12,"sample":[{"citing_arxiv_id":"2606.20153","citing_title":"Optimizing resource allocation for accuracy in noisy variational quantum algorithms","ref_index":64,"is_internal_anchor":true},{"citing_arxiv_id":"2605.28152","citing_title":"Non-Hermitian Computers Need No Complex Numbers","ref_index":7,"is_internal_anchor":true},{"citing_arxiv_id":"2405.08319","citing_title":"Measurement-based quantum machine learning","ref_index":66,"is_internal_anchor":true},{"citing_arxiv_id":"2409.00433","citing_title":"High-Precision Multi-Qubit Clifford+T Synthesis by Unitary Diagonalization","ref_index":25,"is_internal_anchor":true},{"citing_arxiv_id":"2410.16250","citing_title":"Cups and Gates I: Cohomology invariants and logical quantum operations","ref_index":13,"is_internal_anchor":true},{"citing_arxiv_id":"2412.15134","citing_title":"Use of Faulty States in Cat-Code Error Correction","ref_index":41,"is_internal_anchor":true},{"citing_arxiv_id":"2601.20818","citing_title":"Quantum Memory and Autonomous Computation in Two Dimensions","ref_index":42,"is_internal_anchor":true},{"citing_arxiv_id":"2506.01204","citing_title":"Quantum-Classical Embedding via Ghost Gutzwiller Approximation for Enhanced Simulations of Correlated Electron Systems","ref_index":54,"is_internal_anchor":true},{"citing_arxiv_id":"2510.05222","citing_title":"Scalable accuracy gains from postselection in quantum error correcting codes","ref_index":9,"is_internal_anchor":true},{"citing_arxiv_id":"2509.03586","citing_title":"Quantum simulation of out-of-equilibrium dynamics in gauge theories","ref_index":61,"is_internal_anchor":true},{"citing_arxiv_id":"2512.20787","citing_title":"Quantum Universality in Composite Systems: A Trichotomy of Clifford Resources","ref_index":33,"is_internal_anchor":true},{"citing_arxiv_id":"2601.10964","citing_title":"Stabilizer Code-Generic Universal Fault-Tolerant Quantum Computation","ref_index":27,"is_internal_anchor":true},{"citing_arxiv_id":"2604.26392","citing_title":"Imaginarity-generating power of unitaries: A resource-theoretic approach","ref_index":29,"is_internal_anchor":false},{"citing_arxiv_id":"2605.06284","citing_title":"Local distillation from Reed Muller codes unfolding","ref_index":15,"is_internal_anchor":false},{"citing_arxiv_id":"2604.19481","citing_title":"Fault-Tolerant Quantum Computing with Trapped Ions: The Walking Cat Architecture","ref_index":113,"is_internal_anchor":false},{"citing_arxiv_id":"2604.24578","citing_title":"Hybrid Path-Sums for Hybrid Quantum Programs","ref_index":60,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/VXCALYXQLTK7UVH5NOZCXF3LTC","json":"https://pith.science/pith/VXCALYXQLTK7UVH5NOZCXF3LTC.json","graph_json":"https://pith.science/api/pith-number/VXCALYXQLTK7UVH5NOZCXF3LTC/graph.json","events_json":"https://pith.science/api/pith-number/VXCALYXQLTK7UVH5NOZCXF3LTC/events.json","paper":"https://pith.science/paper/VXCALYXQ"},"agent_actions":{"view_html":"https://pith.science/pith/VXCALYXQLTK7UVH5NOZCXF3LTC","download_json":"https://pith.science/pith/VXCALYXQLTK7UVH5NOZCXF3LTC.json","view_paper":"https://pith.science/paper/VXCALYXQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=quant-ph/0402171&json=true","fetch_graph":"https://pith.science/api/pith-number/VXCALYXQLTK7UVH5NOZCXF3LTC/graph.json","fetch_events":"https://pith.science/api/pith-number/VXCALYXQLTK7UVH5NOZCXF3LTC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VXCALYXQLTK7UVH5NOZCXF3LTC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VXCALYXQLTK7UVH5NOZCXF3LTC/action/storage_attestation","attest_author":"https://pith.science/pith/VXCALYXQLTK7UVH5NOZCXF3LTC/action/author_attestation","sign_citation":"https://pith.science/pith/VXCALYXQLTK7UVH5NOZCXF3LTC/action/citation_signature","submit_replication":"https://pith.science/pith/VXCALYXQLTK7UVH5NOZCXF3LTC/action/replication_record"}},"created_at":"2026-07-04T14:46:32.024038+00:00","updated_at":"2026-07-04T14:46:32.024038+00:00"}