{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2007:EK2C7KSUKO7PFV3YSOEW66GE7D","short_pith_number":"pith:EK2C7KSU","canonical_record":{"source":{"id":"quant-ph/0703230","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2007-03-25T22:43:01Z","cross_cats_sorted":[],"title_canon_sha256":"1d7fb8ac9c959f6a7b4279da04e7ff4a4d4091b4bb414d280793bac4f6387a27","abstract_canon_sha256":"494dbdd6148fec14d20a84a98ff3f2ba5b3f776a059ea1b817f9ef255e15183f"},"schema_version":"1.0"},"canonical_sha256":"22b42faa5453bef2d77893896f78c4f8c9059dc2ffb5acb3750cc2285693ae3f","source":{"kind":"arxiv","id":"quant-ph/0703230","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"quant-ph/0703230","created_at":"2026-05-18T04:18:24Z"},{"alias_kind":"arxiv_version","alias_value":"quant-ph/0703230v2","created_at":"2026-05-18T04:18:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.quant-ph/0703230","created_at":"2026-05-18T04:18:24Z"},{"alias_kind":"pith_short_12","alias_value":"EK2C7KSUKO7P","created_at":"2026-05-18T12:25:55Z"},{"alias_kind":"pith_short_16","alias_value":"EK2C7KSUKO7PFV3Y","created_at":"2026-05-18T12:25:55Z"},{"alias_kind":"pith_short_8","alias_value":"EK2C7KSU","created_at":"2026-05-18T12:25:55Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2007:EK2C7KSUKO7PFV3YSOEW66GE7D","target":"record","payload":{"canonical_record":{"source":{"id":"quant-ph/0703230","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2007-03-25T22:43:01Z","cross_cats_sorted":[],"title_canon_sha256":"1d7fb8ac9c959f6a7b4279da04e7ff4a4d4091b4bb414d280793bac4f6387a27","abstract_canon_sha256":"494dbdd6148fec14d20a84a98ff3f2ba5b3f776a059ea1b817f9ef255e15183f"},"schema_version":"1.0"},"canonical_sha256":"22b42faa5453bef2d77893896f78c4f8c9059dc2ffb5acb3750cc2285693ae3f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:18:24.641176Z","signature_b64":"+wABd/WUBkN0ztqAi9eA3D3x0Iu3SzOqNluTNwvFWprLPZRY39X00WN9rmGxCqRsg1T91mtwuxEQuKXSD3s4DA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"22b42faa5453bef2d77893896f78c4f8c9059dc2ffb5acb3750cc2285693ae3f","last_reissued_at":"2026-05-18T04:18:24.640624Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:18:24.640624Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"quant-ph/0703230","source_version":2,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T04:18:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"u+GxeyJyfwGEKJ7834uS8QqsNvc5UHU1xKT2oGiL43qMQJ2V5HIwBjqLKV2QQ3tab0n0g2qSLbLEMfDa1UwPDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T06:26:34.460415Z"},"content_sha256":"33310edb0e67c57f3d5a22b7df8b844cfe5ef0304933f524f6b64874fb0f1576","schema_version":"1.0","event_id":"sha256:33310edb0e67c57f3d5a22b7df8b844cfe5ef0304933f524f6b64874fb0f1576"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2007:EK2C7KSUKO7PFV3YSOEW66GE7D","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Level Reduction and the Quantum Threshold Theorem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Panos Aliferis","submitted_at":"2007-03-25T22:43:01Z","abstract_excerpt":"The quantum threshold theorem shows that a noisy quantum computer can accurately and efficiently simulate any ideal quantum computation provided that noise is weakly correlated and its strength is below a critical value known as the quantum accuracy threshold. This thesis provides a simpler and more transparent non-inductive proof of this theorem based on the concept of level reduction. This concept is also used in proving the quantum threshold theorem for coherent and leakage noise and for quantum computation by measurements. In addition, the proof provides a methodology which allows us to es"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"quant-ph/0703230","kind":"arxiv","version":2},"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T04:18:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0FXZIiF3uT/WoKPKyeqKXu0d2O6Uposj/be3M8+nIYzdcr+BBJQjKi9Si9ax7+LWCzopElintaoQuXeRNZ8XCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T06:26:34.461041Z"},"content_sha256":"a53eaa141f0db63860fc01a7b577562521a5f17430be90652c1dfcaaf8c77565","schema_version":"1.0","event_id":"sha256:a53eaa141f0db63860fc01a7b577562521a5f17430be90652c1dfcaaf8c77565"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/EK2C7KSUKO7PFV3YSOEW66GE7D/bundle.json","state_url":"https://pith.science/pith/EK2C7KSUKO7PFV3YSOEW66GE7D/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/EK2C7KSUKO7PFV3YSOEW66GE7D/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-26T06:26:34Z","links":{"resolver":"https://pith.science/pith/EK2C7KSUKO7PFV3YSOEW66GE7D","bundle":"https://pith.science/pith/EK2C7KSUKO7PFV3YSOEW66GE7D/bundle.json","state":"https://pith.science/pith/EK2C7KSUKO7PFV3YSOEW66GE7D/state.json","well_known_bundle":"https://pith.science/.well-known/pith/EK2C7KSUKO7PFV3YSOEW66GE7D/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2007:EK2C7KSUKO7PFV3YSOEW66GE7D","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"494dbdd6148fec14d20a84a98ff3f2ba5b3f776a059ea1b817f9ef255e15183f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2007-03-25T22:43:01Z","title_canon_sha256":"1d7fb8ac9c959f6a7b4279da04e7ff4a4d4091b4bb414d280793bac4f6387a27"},"schema_version":"1.0","source":{"id":"quant-ph/0703230","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"quant-ph/0703230","created_at":"2026-05-18T04:18:24Z"},{"alias_kind":"arxiv_version","alias_value":"quant-ph/0703230v2","created_at":"2026-05-18T04:18:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.quant-ph/0703230","created_at":"2026-05-18T04:18:24Z"},{"alias_kind":"pith_short_12","alias_value":"EK2C7KSUKO7P","created_at":"2026-05-18T12:25:55Z"},{"alias_kind":"pith_short_16","alias_value":"EK2C7KSUKO7PFV3Y","created_at":"2026-05-18T12:25:55Z"},{"alias_kind":"pith_short_8","alias_value":"EK2C7KSU","created_at":"2026-05-18T12:25:55Z"}],"graph_snapshots":[{"event_id":"sha256:a53eaa141f0db63860fc01a7b577562521a5f17430be90652c1dfcaaf8c77565","target":"graph","created_at":"2026-05-18T04:18:24Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"abstract_excerpt":"The quantum threshold theorem shows that a noisy quantum computer can accurately and efficiently simulate any ideal quantum computation provided that noise is weakly correlated and its strength is below a critical value known as the quantum accuracy threshold. This thesis provides a simpler and more transparent non-inductive proof of this theorem based on the concept of level reduction. This concept is also used in proving the quantum threshold theorem for coherent and leakage noise and for quantum computation by measurements. In addition, the proof provides a methodology which allows us to es","authors_text":"Panos Aliferis","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2007-03-25T22:43:01Z","title":"Level Reduction and the Quantum Threshold Theorem"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"quant-ph/0703230","kind":"arxiv","version":2},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:33310edb0e67c57f3d5a22b7df8b844cfe5ef0304933f524f6b64874fb0f1576","target":"record","created_at":"2026-05-18T04:18:24Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"494dbdd6148fec14d20a84a98ff3f2ba5b3f776a059ea1b817f9ef255e15183f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2007-03-25T22:43:01Z","title_canon_sha256":"1d7fb8ac9c959f6a7b4279da04e7ff4a4d4091b4bb414d280793bac4f6387a27"},"schema_version":"1.0","source":{"id":"quant-ph/0703230","kind":"arxiv","version":2}},"canonical_sha256":"22b42faa5453bef2d77893896f78c4f8c9059dc2ffb5acb3750cc2285693ae3f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"22b42faa5453bef2d77893896f78c4f8c9059dc2ffb5acb3750cc2285693ae3f","first_computed_at":"2026-05-18T04:18:24.640624Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:18:24.640624Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"+wABd/WUBkN0ztqAi9eA3D3x0Iu3SzOqNluTNwvFWprLPZRY39X00WN9rmGxCqRsg1T91mtwuxEQuKXSD3s4DA==","signature_status":"signed_v1","signed_at":"2026-05-18T04:18:24.641176Z","signed_message":"canonical_sha256_bytes"},"source_id":"quant-ph/0703230","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:33310edb0e67c57f3d5a22b7df8b844cfe5ef0304933f524f6b64874fb0f1576","sha256:a53eaa141f0db63860fc01a7b577562521a5f17430be90652c1dfcaaf8c77565"],"state_sha256":"3eaa1386c2e89c092cc5d80846b6c5b3be9da90b494da0388e9677eb6844fbc9"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FWKsy6ihlbqkR06VRztITox3RlehNl2HoGwzQ77+klQKLA2i1y0Y3/Etz+cn8ChlXiD4gLK+kG4M4UfSToXiCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T06:26:34.464654Z","bundle_sha256":"f01665251db20b1660ca2a676d6dc175794d8bcef72fc8bae82c06983709f8dd"}}