{"release":{"schemaVersion":"maha-epistemic-release/1.0","releaseId":"epirelease_c073893f088c48e296810d5ea5d58207","releaseKind":"initial","status":"active","recordId":"urn:maha:record:fault-tolerance-threshold-condition","domainSlug":"quantum-systems","targetSha256":"sha256:e0e0d68ff64e4d2b7091b2d0b71e1dc97e72d847591734a46ebf423efc9c9be7","canonicalPath":"/knowledge/quantum-systems/concepts/fault-tolerance-threshold-condition","canonicalVersion":"1.0.0","supersedesReleaseId":null,"approvals":[{"scope":"boundary-adequacy","reviewId":"epireview_cd9f1bdd522c4cd0a29df17e7feb6a83","reviewSha256":"sha256:3a6a6881f2dd1f5599f2abaf75a1c368d4fe6b63044c67cd80a68ef57fbe5ac0","reviewedAt":"2026-08-30T16:01:57.957Z","reviewerKind":"internal-editorial","reviewMethod":"Each criterion is recomputed from the exact record, its inspected alignment audit, source identity, exact locator, rights basis, claim scope, boundary, uncertainty, replication status, prohibited inferences, and revision digest."},{"scope":"domain-fidelity","reviewId":"epireview_833b4f1482ad4be28b3048d5ae8cc3ea","reviewSha256":"sha256:316a01d899fe9b10363f764271ec6c07bfc47e2a804e8a0f822166d82e6c737c","reviewedAt":"2026-08-30T16:01:57.850Z","reviewerKind":"internal-editorial","reviewMethod":"Each criterion is recomputed from the exact record, its inspected alignment audit, source identity, exact locator, rights basis, claim scope, boundary, uncertainty, replication status, prohibited inferences, and revision digest."},{"scope":"rights-and-locator","reviewId":"epireview_0642be1ad670466190d0db28155fb207","reviewSha256":"sha256:df06adf040b60f43d72346ea9e85950cc66fb65b2928048ccea428efca9c60c8","reviewedAt":"2026-08-30T16:01:58.080Z","reviewerKind":"internal-editorial","reviewMethod":"Each criterion is recomputed from the exact record, its inspected alignment audit, source identity, exact locator, rights basis, claim scope, boundary, uncertainty, replication status, prohibited inferences, and revision digest."},{"scope":"source-fidelity","reviewId":"epireview_cf5aed1eb40e4309a698165a9969f1a0","reviewSha256":"sha256:a6643d6562c8481a87e7b30b501a6e982aafa67131ff7310189bd1c2b22e9076","reviewedAt":"2026-08-30T16:01:57.777Z","reviewerKind":"internal-editorial","reviewMethod":"Each criterion is recomputed from the exact record, its inspected alignment audit, source identity, exact locator, rights basis, claim scope, boundary, uncertainty, replication status, prohibited inferences, and revision digest."}],"assuranceTier":"internally-reviewed-canonical","releaseAuthority":{"authoritySha256":"sha256:2a0161a3927ae8366af44bda6671b5249802843ff3895dc292c90e5466b88609","attribution":"withheld-by-consent"},"publicChangeSummary":"Initial canonical publication under the disclosed exact-revision internal editorial tier.","recordSha256":"sha256:b59fbdefee50fd7737a039e51c1a8608072aa56f64e2a1bb1becaaf12d5fc1d5","gateDecision":{"reasons":[],"recordId":"urn:maha:record:fault-tolerance-threshold-condition","publicEligible":true,"evaluatedAgainst":"maha-epistemic/1.0"},"releasedAt":"2026-08-30T16:02:34.298Z","releaseSha256":"sha256:f43bfacd2fdc80ee35ca9f3a7aa21fbae3a0a8cbbd07bc331af512d0c1dbb952","withdrawal":null},"provenance":{"schemaVersion":"maha-epistemic/1.0","evidencePolicyVersion":"mps/0.1","recordId":"urn:maha:record:fault-tolerance-threshold-condition","canonicalPath":"/knowledge/quantum-systems/concepts/fault-tolerance-threshold-condition","contentHash":"sha256:b59fbdefee50fd7737a039e51c1a8608072aa56f64e2a1bb1becaaf12d5fc1d5","generatedAt":"2026-08-30T16:02:34.298Z","publicationDecision":{"recordId":"urn:maha:record:fault-tolerance-threshold-condition","publicEligible":true,"evaluatedAgainst":"maha-epistemic/1.0","reasons":[]},"claims":[{"id":"urn:maha:claim:fault-tolerance-threshold-condition","scope":"The models, apparatus, protocols, datasets, and comparisons reported in Surface codes: Towards practical large-scale quantum computation.","boundary":"A threshold theorem or estimate does not show that a particular device is below threshold under complete realistic noise.","claimKind":"theoretical-model","sourceIds":["source-fowler-surface-code-2012"],"statement":"The cited surface-code analysis provides numerical threshold estimates under explicit architecture and noise assumptions.","replication":{"asOfDate":"2026-08-24","assessment":"This candidate records one bounded source package. Independent replications and contradictory measurements must be compiled as separate records before maturity is upgraded.","independentReplicationCount":null},"uncertainty":{"kind":"qualitative","statement":"No platform-independent uncertainty interval exists; numerical values remain attached to the source experiment or model and its stated assumptions."},"evidenceMaturity":"single-study"}],"sources":[{"id":"source-fowler-surface-code-2012","url":"https://journals.aps.org/pra/abstract/10.1103/PhysRevA.86.032324","title":"Surface codes: Towards practical large-scale quantum computation","rights":{"note":"Maha paraphrases the source-level result and links to the version of record; no article passage is reproduced.","basis":"citation-with-paraphrase","quotationUsed":false},"authors":["Austin G. Fowler","Matteo Mariantoni","John M. Martinis","Andrew N. Cleland"],"boundary":"The numerical estimates depend on code, decoder, noise, geometry, scheduling, and physical-operation assumptions.","publisher":"Physical Review A, American Physical Society","establishes":"The paper explains stabilizer measurement, logical encoding, movement, gates, and estimated fault-tolerance properties for surface-code architectures.","identifiers":[{"value":"10.1103/PhysRevA.86.032324","scheme":"doi"}],"publishedAt":"2012-09-18","exactLocator":"Abstract; Sections II–XVI; appendices and numerical threshold estimates."}],"reviewEvents":[{"reviewId":"epireview_cf5aed1eb40e4309a698165a9969f1a0","scope":"source-fidelity","targetSha256":"sha256:e0e0d68ff64e4d2b7091b2d0b71e1dc97e72d847591734a46ebf423efc9c9be7","reviewedAt":"2026-08-30T16:01:57.777Z","verdict":"approve","supersedesReviewId":null},{"reviewId":"epireview_833b4f1482ad4be28b3048d5ae8cc3ea","scope":"domain-fidelity","targetSha256":"sha256:e0e0d68ff64e4d2b7091b2d0b71e1dc97e72d847591734a46ebf423efc9c9be7","reviewedAt":"2026-08-30T16:01:57.850Z","verdict":"approve","supersedesReviewId":null},{"reviewId":"epireview_cd9f1bdd522c4cd0a29df17e7feb6a83","scope":"boundary-adequacy","targetSha256":"sha256:e0e0d68ff64e4d2b7091b2d0b71e1dc97e72d847591734a46ebf423efc9c9be7","reviewedAt":"2026-08-30T16:01:57.957Z","verdict":"approve","supersedesReviewId":null},{"reviewId":"epireview_0642be1ad670466190d0db28155fb207","scope":"rights-and-locator","targetSha256":"sha256:e0e0d68ff64e4d2b7091b2d0b71e1dc97e72d847591734a46ebf423efc9c9be7","reviewedAt":"2026-08-30T16:01:58.080Z","verdict":"approve","supersedesReviewId":null}]},"privacyBoundary":"Operational actor fingerprints, bearer credentials, private reviewer profiles, affiliations, conflicts, and non-consented authority identity fields are excluded."}