{"release":{"schemaVersion":"maha-epistemic-release/1.0","releaseId":"epirelease_7637e5f3e744412587fc234509918e67","releaseKind":"initial","status":"active","recordId":"urn:maha:record:linear-optical-quantum-computation","domainSlug":"quantum-systems","targetSha256":"sha256:9d4198c21a107aa82c71a0f634c7c05eddced1ca348b77ad7ff2d580d99768a0","canonicalPath":"/knowledge/quantum-systems/concepts/linear-optical-quantum-computation","canonicalVersion":"1.0.0","supersedesReleaseId":null,"approvals":[{"scope":"boundary-adequacy","reviewId":"epireview_8873d0ab3f224efeb5a435915f9dfe70","reviewSha256":"sha256:50aca931980a67556c2cd7815ea6dc03fc7a11a954689ebe410bc0bae8a0cc35","reviewedAt":"2026-08-30T15:03:57.055Z","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_0176bc18e3e04c048d59f6d3151c7b87","reviewSha256":"sha256:0b6aabedb6b38497957021fd0969c68f06db74f999d0b3c5ba1a345bca9688d7","reviewedAt":"2026-08-30T15:03:56.873Z","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_f08b384b32e246b59731bd78189228b0","reviewSha256":"sha256:c0b03f1e49a0e2c2583aa06bc0b05a7aa3aa985c7147b71be2c59a638a28f798","reviewedAt":"2026-08-30T15:03:57.202Z","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_555c3d81a86940f4926ac237e3123ccc","reviewSha256":"sha256:44267ea9c373f706c3196811757366bbbbcebff7729de7a87dd3e050d38c58f4","reviewedAt":"2026-08-30T15:03:56.723Z","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:b1e91c027404ad9d094a8036d060d6de74e0181770a62a800dcab4e4fa1dd2dc","gateDecision":{"reasons":[],"recordId":"urn:maha:record:linear-optical-quantum-computation","publicEligible":true,"evaluatedAgainst":"maha-epistemic/1.0"},"releasedAt":"2026-08-30T16:00:12.474Z","releaseSha256":"sha256:2adfeaa8f5a83093b1b3d1b35fb862579955a65b0ee567ed1aa63338773efc68","withdrawal":null},"provenance":{"schemaVersion":"maha-epistemic/1.0","evidencePolicyVersion":"mps/0.1","recordId":"urn:maha:record:linear-optical-quantum-computation","canonicalPath":"/knowledge/quantum-systems/concepts/linear-optical-quantum-computation","contentHash":"sha256:b1e91c027404ad9d094a8036d060d6de74e0181770a62a800dcab4e4fa1dd2dc","generatedAt":"2026-08-30T16:00:12.474Z","publicationDecision":{"recordId":"urn:maha:record:linear-optical-quantum-computation","publicEligible":true,"evaluatedAgainst":"maha-epistemic/1.0","reasons":[]},"claims":[{"id":"urn:maha:claim:linear-optical-quantum-computation","scope":"The models, apparatus, protocols, datasets, and comparisons reported in A scheme for efficient quantum computation with linear optics.","boundary":"Formal universality does not establish practical source efficiency, detector performance, loss tolerance, or resource cost.","claimKind":"theoretical-model","sourceIds":["source-klm-linear-optics-2001"],"statement":"The cited KLM construction shows that universal quantum computation is formally possible with linear optical components plus measurement-induced operations and resources.","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-klm-linear-optics-2001","url":"https://www.nature.com/articles/35051009","title":"A scheme for efficient quantum computation with linear optics","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":["E. Knill","R. Laflamme","G. J. Milburn"],"boundary":"A formal scheme does not establish deterministic component performance, integrated manufacturability, loss tolerance at scale, or economic utility.","publisher":"Nature","establishes":"The paper constructs a universal quantum-computation scheme using single-photon sources, linear optical elements, photodetectors, feed-forward, and ancilla resources.","identifiers":[{"value":"10.1038/35051009","scheme":"doi"}],"publishedAt":"2001-01-04","exactLocator":"Abstract; main construction; resource and error discussion."}],"reviewEvents":[{"reviewId":"epireview_555c3d81a86940f4926ac237e3123ccc","scope":"source-fidelity","targetSha256":"sha256:9d4198c21a107aa82c71a0f634c7c05eddced1ca348b77ad7ff2d580d99768a0","reviewedAt":"2026-08-30T15:03:56.723Z","verdict":"approve","supersedesReviewId":null},{"reviewId":"epireview_0176bc18e3e04c048d59f6d3151c7b87","scope":"domain-fidelity","targetSha256":"sha256:9d4198c21a107aa82c71a0f634c7c05eddced1ca348b77ad7ff2d580d99768a0","reviewedAt":"2026-08-30T15:03:56.873Z","verdict":"approve","supersedesReviewId":null},{"reviewId":"epireview_8873d0ab3f224efeb5a435915f9dfe70","scope":"boundary-adequacy","targetSha256":"sha256:9d4198c21a107aa82c71a0f634c7c05eddced1ca348b77ad7ff2d580d99768a0","reviewedAt":"2026-08-30T15:03:57.055Z","verdict":"approve","supersedesReviewId":null},{"reviewId":"epireview_f08b384b32e246b59731bd78189228b0","scope":"rights-and-locator","targetSha256":"sha256:9d4198c21a107aa82c71a0f634c7c05eddced1ca348b77ad7ff2d580d99768a0","reviewedAt":"2026-08-30T15:03:57.202Z","verdict":"approve","supersedesReviewId":null}]},"privacyBoundary":"Operational actor fingerprints, bearer credentials, private reviewer profiles, affiliations, conflicts, and non-consented authority identity fields are excluded."}