{"release":{"schemaVersion":"maha-epistemic-release/1.0","releaseId":"epirelease_e5769d39e2fd44118c7b22e9db211272","releaseKind":"initial","status":"active","recordId":"urn:maha:record:random-circuit-sampling","domainSlug":"quantum-systems","targetSha256":"sha256:9a55b13c6103a3d54fdd798bf4ceeb49208fef4c65ad1ed5da2cd7f6fe4c8b6c","canonicalPath":"/knowledge/quantum-systems/methods/random-circuit-sampling","canonicalVersion":"1.0.0","supersedesReleaseId":null,"approvals":[{"scope":"boundary-adequacy","reviewId":"epireview_b9229a81750e40d4a2a3668450885f98","reviewSha256":"sha256:af51f1bacac637ef39d8a1f68578b8af9781787163d3a34afb46d72119638c46","reviewedAt":"2026-08-30T16:01:55.818Z","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_d6e233d576aa428b979b853006239c92","reviewSha256":"sha256:146c052ef9a356a3e21d3ff3706ad34c2eef5a6f8d42ab6fdbbb54c35cfc12b5","reviewedAt":"2026-08-30T16:01:55.583Z","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_c8198290b0f34ca68258e69768d7f936","reviewSha256":"sha256:46456e81743f55470ea88ff82d70d4be625a06d66cb05fdb089b0d6ba4cdfd4d","reviewedAt":"2026-08-30T16:01:55.921Z","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_a141c92a9a4744008db794d02e645e9e","reviewSha256":"sha256:58c7478517ac253f18dd6e3a7d6d82e2fc77c4470100ab765d2de135ff394509","reviewedAt":"2026-08-30T16:01:54.786Z","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:fc951a2796f2a798a362b565182bdcec86666aec82e3e0a489d272c24639841a","gateDecision":{"reasons":[],"recordId":"urn:maha:record:random-circuit-sampling","publicEligible":true,"evaluatedAgainst":"maha-epistemic/1.0"},"releasedAt":"2026-08-30T16:02:28.459Z","releaseSha256":"sha256:f431ca758bf13f18253243d486554d31d0b33db47ccb27f479afa72af1987284","withdrawal":null},"provenance":{"schemaVersion":"maha-epistemic/1.0","evidencePolicyVersion":"mps/0.1","recordId":"urn:maha:record:random-circuit-sampling","canonicalPath":"/knowledge/quantum-systems/methods/random-circuit-sampling","contentHash":"sha256:fc951a2796f2a798a362b565182bdcec86666aec82e3e0a489d272c24639841a","generatedAt":"2026-08-30T16:02:28.459Z","publicationDecision":{"recordId":"urn:maha:record:random-circuit-sampling","publicEligible":true,"evaluatedAgainst":"maha-epistemic/1.0","reasons":[]},"claims":[{"id":"urn:maha:claim:random-circuit-sampling","scope":"The models, apparatus, protocols, datasets, and comparisons reported in Quantum supremacy using a programmable superconducting processor.","boundary":"A speed comparison for random-circuit sampling is not evidence of faster performance on unrelated industrial workloads.","claimKind":"empirical-claim","sourceIds":["source-arute-random-circuits-2019"],"statement":"The cited study reports random-circuit samples from a 53-qubit superconducting processor and cross-entropy-based verification for the reported circuit family.","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-arute-random-circuits-2019","url":"https://www.nature.com/articles/s41586-019-1666-5","title":"Quantum supremacy using a programmable superconducting processor","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":["Frank Arute","Kunal Arya","Ryan Babbush","Dave Bacon","et al."],"boundary":"The reported advantage is task-, circuit-, fidelity-, classical-algorithm-, and comparison-hardware-specific and does not imply general commercial advantage.","publisher":"Nature","establishes":"The study reports random-circuit sampling on a 53-qubit superconducting processor and compares that bounded task with the classical methods and hardware considered in the paper.","identifiers":[{"value":"10.1038/s41586-019-1666-5","scheme":"doi"}],"publishedAt":"2019-10-23","exactLocator":"Abstract; Figures 1–4; Methods; Supplementary Information; data availability.","conflictsOfInterest":"Most authors were affiliated with Google and the work evaluates Google hardware."}],"reviewEvents":[{"reviewId":"epireview_a141c92a9a4744008db794d02e645e9e","scope":"source-fidelity","targetSha256":"sha256:9a55b13c6103a3d54fdd798bf4ceeb49208fef4c65ad1ed5da2cd7f6fe4c8b6c","reviewedAt":"2026-08-30T16:01:54.786Z","verdict":"approve","supersedesReviewId":null},{"reviewId":"epireview_d6e233d576aa428b979b853006239c92","scope":"domain-fidelity","targetSha256":"sha256:9a55b13c6103a3d54fdd798bf4ceeb49208fef4c65ad1ed5da2cd7f6fe4c8b6c","reviewedAt":"2026-08-30T16:01:55.583Z","verdict":"approve","supersedesReviewId":null},{"reviewId":"epireview_b9229a81750e40d4a2a3668450885f98","scope":"boundary-adequacy","targetSha256":"sha256:9a55b13c6103a3d54fdd798bf4ceeb49208fef4c65ad1ed5da2cd7f6fe4c8b6c","reviewedAt":"2026-08-30T16:01:55.818Z","verdict":"approve","supersedesReviewId":null},{"reviewId":"epireview_c8198290b0f34ca68258e69768d7f936","scope":"rights-and-locator","targetSha256":"sha256:9a55b13c6103a3d54fdd798bf4ceeb49208fef4c65ad1ed5da2cd7f6fe4c8b6c","reviewedAt":"2026-08-30T16:01:55.921Z","verdict":"approve","supersedesReviewId":null}]},"privacyBoundary":"Operational actor fingerprints, bearer credentials, private reviewer profiles, affiliations, conflicts, and non-consented authority identity fields are excluded."}