{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:Q3LMOJYVZU4KSXO6N7P3I2KEMC","short_pith_number":"pith:Q3LMOJYV","schema_version":"1.0","canonical_sha256":"86d6c72715cd38a95dde6fdfb4694460a0a76bd87aceadae52f7b9714af6a100","source":{"kind":"arxiv","id":"2210.15844","version":1},"attestation_state":"computed","paper":{"title":"Opportunities and Challenges in Fault-Tolerant Quantum Computation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Daniel Gottesman","submitted_at":"2022-10-28T02:32:09Z","abstract_excerpt":"I will give an overview of what I see as some of the most important future directions in the theory of fault-tolerant quantum computation. In particular, I will give a brief summary of the major problems that need to be solved in fault tolerance based on low-density parity check codes and in hardware-specific fault tolerance. I will then conclude with a discussion of a possible new paradigm for designing fault-tolerant protocols based on a space-time picture of quantum circuits."},"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":"2210.15844","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2022-10-28T02:32:09Z","cross_cats_sorted":[],"title_canon_sha256":"f283f805b8ab38df700e0aa0c47ae95ecc2189ac3363eb1ac6c6e9b93204f6f7","abstract_canon_sha256":"8082be959cbdee00decff99796f807ba656f6253ec392d4a9a89895cd297a154"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:11:26.300462Z","signature_b64":"jbfUjLlaNZmSiwdnuLzV8O0lsqWjmOj8/g1EoFUnBBJHVIvLsBSc5MT0qUZ+BZ95om8KeJvpndRaVD5q1p18BQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"86d6c72715cd38a95dde6fdfb4694460a0a76bd87aceadae52f7b9714af6a100","last_reissued_at":"2026-07-05T05:11:26.300014Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:11:26.300014Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Opportunities and Challenges in Fault-Tolerant Quantum Computation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Daniel Gottesman","submitted_at":"2022-10-28T02:32:09Z","abstract_excerpt":"I will give an overview of what I see as some of the most important future directions in the theory of fault-tolerant quantum computation. In particular, I will give a brief summary of the major problems that need to be solved in fault tolerance based on low-density parity check codes and in hardware-specific fault tolerance. I will then conclude with a discussion of a possible new paradigm for designing fault-tolerant protocols based on a space-time picture of quantum circuits."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2210.15844","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/2210.15844/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":"2210.15844","created_at":"2026-07-05T05:11:26.300070+00:00"},{"alias_kind":"arxiv_version","alias_value":"2210.15844v1","created_at":"2026-07-05T05:11:26.300070+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2210.15844","created_at":"2026-07-05T05:11:26.300070+00:00"},{"alias_kind":"pith_short_12","alias_value":"Q3LMOJYVZU4K","created_at":"2026-07-05T05:11:26.300070+00:00"},{"alias_kind":"pith_short_16","alias_value":"Q3LMOJYVZU4KSXO6","created_at":"2026-07-05T05:11:26.300070+00:00"},{"alias_kind":"pith_short_8","alias_value":"Q3LMOJYV","created_at":"2026-07-05T05:11:26.300070+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":8,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2604.21468","citing_title":"Novelty-Based Generation of Continuous Landscapes with Diverse Local Optima Networks","ref_index":43,"is_internal_anchor":false},{"citing_arxiv_id":"2606.06365","citing_title":"A framework for low-overhead quantum fault tolerance via spacetime lifting","ref_index":27,"is_internal_anchor":false},{"citing_arxiv_id":"2606.05664","citing_title":"Gauging the Spacetime Code","ref_index":30,"is_internal_anchor":false},{"citing_arxiv_id":"2509.25326","citing_title":"Error detection without post-selection in adaptive quantum circuits","ref_index":43,"is_internal_anchor":false},{"citing_arxiv_id":"2404.02280","citing_title":"Demonstration of logical qubits and repeated error correction with better-than-physical error rates","ref_index":45,"is_internal_anchor":false},{"citing_arxiv_id":"2604.26692","citing_title":"Towards Quantum Optimised Malware Containment","ref_index":5,"is_internal_anchor":false},{"citing_arxiv_id":"2604.21472","citing_title":"LightStim: A Framework for QEC Protocol Evaluation and Prototyping with Automated DEM Construction","ref_index":43,"is_internal_anchor":false},{"citing_arxiv_id":"2602.11457","citing_title":"The Pinnacle Architecture: Reducing the cost of breaking RSA-2048 to 100 000 physical qubits using quantum LDPC codes","ref_index":18,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/Q3LMOJYVZU4KSXO6N7P3I2KEMC","json":"https://pith.science/pith/Q3LMOJYVZU4KSXO6N7P3I2KEMC.json","graph_json":"https://pith.science/api/pith-number/Q3LMOJYVZU4KSXO6N7P3I2KEMC/graph.json","events_json":"https://pith.science/api/pith-number/Q3LMOJYVZU4KSXO6N7P3I2KEMC/events.json","paper":"https://pith.science/paper/Q3LMOJYV"},"agent_actions":{"view_html":"https://pith.science/pith/Q3LMOJYVZU4KSXO6N7P3I2KEMC","download_json":"https://pith.science/pith/Q3LMOJYVZU4KSXO6N7P3I2KEMC.json","view_paper":"https://pith.science/paper/Q3LMOJYV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2210.15844&json=true","fetch_graph":"https://pith.science/api/pith-number/Q3LMOJYVZU4KSXO6N7P3I2KEMC/graph.json","fetch_events":"https://pith.science/api/pith-number/Q3LMOJYVZU4KSXO6N7P3I2KEMC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/Q3LMOJYVZU4KSXO6N7P3I2KEMC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/Q3LMOJYVZU4KSXO6N7P3I2KEMC/action/storage_attestation","attest_author":"https://pith.science/pith/Q3LMOJYVZU4KSXO6N7P3I2KEMC/action/author_attestation","sign_citation":"https://pith.science/pith/Q3LMOJYVZU4KSXO6N7P3I2KEMC/action/citation_signature","submit_replication":"https://pith.science/pith/Q3LMOJYVZU4KSXO6N7P3I2KEMC/action/replication_record"}},"created_at":"2026-07-05T05:11:26.300070+00:00","updated_at":"2026-07-05T05:11:26.300070+00:00"}