{"release":{"schemaVersion":"maha-epistemic-release/1.0","releaseId":"epirelease_fdf6a53434834d19a217bb4fc6055f53","releaseKind":"initial","status":"active","recordId":"urn:maha:record:randomized-benchmarking","domainSlug":"quantum-systems","targetSha256":"sha256:935647bbd1d1c80c3a57610985a588f71413b110f9ea45a398967b3732b74829","canonicalPath":"/knowledge/quantum-systems/methods/randomized-benchmarking","canonicalVersion":"1.0.0","supersedesReleaseId":null,"approvals":[{"scope":"boundary-adequacy","reviewId":"epireview_f385c47c23674c92969e685cb84c05f2","reviewSha256":"sha256:7aaa1be64be3f7ca99a3cac5ad706c857057db3453890167ed9edf6b330ada64","reviewedAt":"2026-08-30T16:01:53.027Z","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_3f723d72aa134abebef2c64c39e0a606","reviewSha256":"sha256:272f76a0b9e2e126f69de5e7536d74e8955739545c3e2c6b6a2cf60e0bdf8e57","reviewedAt":"2026-08-30T16:01:52.947Z","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_8ab4ae1b4d884582998e8f44c16cd131","reviewSha256":"sha256:635faaaa032f970b4f56e14684a51e79b81dafe8a86b3288b2e07cb653088cda","reviewedAt":"2026-08-30T16:01:53.130Z","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_ba865d2149b04d298db6fa7c28e44526","reviewSha256":"sha256:38016dd4e0fbc94bd28de52639cbcd31b87d7f1c0b869a5aeea94e8fffb43cbe","reviewedAt":"2026-08-30T16:01:52.813Z","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:b45b37c37ef342a0b4554c917856f864e3adc94983ab89f068d504a6e7713bde","gateDecision":{"reasons":[],"recordId":"urn:maha:record:randomized-benchmarking","publicEligible":true,"evaluatedAgainst":"maha-epistemic/1.0"},"releasedAt":"2026-08-30T16:02:19.868Z","releaseSha256":"sha256:3454b655470d4f01b29c24b1e96dcce499bca36c82850dc8a6e10fb63a8f64ed","withdrawal":null},"provenance":{"schemaVersion":"maha-epistemic/1.0","evidencePolicyVersion":"mps/0.1","recordId":"urn:maha:record:randomized-benchmarking","canonicalPath":"/knowledge/quantum-systems/methods/randomized-benchmarking","contentHash":"sha256:b45b37c37ef342a0b4554c917856f864e3adc94983ab89f068d504a6e7713bde","generatedAt":"2026-08-30T16:02:19.868Z","publicationDecision":{"recordId":"urn:maha:record:randomized-benchmarking","publicEligible":true,"evaluatedAgainst":"maha-epistemic/1.0","reasons":[]},"claims":[{"id":"urn:maha:claim:randomized-benchmarking","scope":"The models, apparatus, protocols, datasets, and comparisons reported in Scalable and Robust Randomized Benchmarking of Quantum Processes.","boundary":"The fitted average is not a complete error model and can hide gate dependence, leakage, crosstalk, and temporal structure.","claimKind":"theoretical-model","sourceIds":["source-magesan-rb-2011"],"statement":"The cited protocol derives scalable fitting models for average error rates under broad but explicit 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-magesan-rb-2011","url":"https://journals.aps.org/prl/abstract/10.1103/PhysRevLett.106.180504","title":"Scalable and Robust Randomized Benchmarking of Quantum Processes","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":["Easwar Magesan","J. M. Gambetta","Joseph Emerson"],"boundary":"Randomized benchmarking does not fully identify coherent structure, leakage, crosstalk, non-Markovian behavior, or application-specific circuit performance.","publisher":"Physical Review Letters, American Physical Society","establishes":"The paper proposes a scalable randomized-benchmarking protocol and derives fitting models for estimating an average error rate under its noise assumptions.","identifiers":[{"value":"10.1103/PhysRevLett.106.180504","scheme":"doi"}],"publishedAt":"2011-05-06","exactLocator":"Abstract; protocol; fitting models; numerical examples."}],"reviewEvents":[{"reviewId":"epireview_ba865d2149b04d298db6fa7c28e44526","scope":"source-fidelity","targetSha256":"sha256:935647bbd1d1c80c3a57610985a588f71413b110f9ea45a398967b3732b74829","reviewedAt":"2026-08-30T16:01:52.813Z","verdict":"approve","supersedesReviewId":null},{"reviewId":"epireview_3f723d72aa134abebef2c64c39e0a606","scope":"domain-fidelity","targetSha256":"sha256:935647bbd1d1c80c3a57610985a588f71413b110f9ea45a398967b3732b74829","reviewedAt":"2026-08-30T16:01:52.947Z","verdict":"approve","supersedesReviewId":null},{"reviewId":"epireview_f385c47c23674c92969e685cb84c05f2","scope":"boundary-adequacy","targetSha256":"sha256:935647bbd1d1c80c3a57610985a588f71413b110f9ea45a398967b3732b74829","reviewedAt":"2026-08-30T16:01:53.027Z","verdict":"approve","supersedesReviewId":null},{"reviewId":"epireview_8ab4ae1b4d884582998e8f44c16cd131","scope":"rights-and-locator","targetSha256":"sha256:935647bbd1d1c80c3a57610985a588f71413b110f9ea45a398967b3732b74829","reviewedAt":"2026-08-30T16:01:53.130Z","verdict":"approve","supersedesReviewId":null}]},"privacyBoundary":"Operational actor fingerprints, bearer credentials, private reviewer profiles, affiliations, conflicts, and non-consented authority identity fields are excluded."}