published-canonicalmethodmaha-epistemic/1.0

Random-circuit sampling

A benchmark task that samples outputs from pseudo-random quantum circuits and compares them with a defined classical simulation and verification procedure. This candidate isolates the cited result from broader claims about scaling, fault tolerance, manufacturability, economics, and useful computational advantage.

Bounded definition

A benchmark task that samples outputs from pseudo-random quantum circuits and compares them with a defined classical simulation and verification procedure.

What the cited work 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.

The models, apparatus, protocols, datasets, and comparisons reported in Quantum supremacy using a programmable superconducting processor.

Claims: urn:maha:claim:random-circuit-sampling

What remains a separate question

A speed comparison for random-circuit sampling is not evidence of faster performance on unrelated industrial workloads.

The reported advantage is task-, circuit-, fidelity-, classical-algorithm-, and comparison-hardware-specific and does not imply general commercial advantage.

Connected domain graph

Typed dependencies preserve publication state.

Only independently canonical records receive public links and relation statements. Draft graph topology remains private.

mechanistic dependencycanonical

Quantum hardware benchmark scope

outbound connection · comparison

The claim depends on the exact task, fidelity metric, classical baseline, and hardware snapshot.

strategic dependencycanonical

Quantum volume benchmark

outbound connection · measurement

Both use random circuits but define different acceptance metrics and scaling summaries.

strategic dependencycanonical

Quantum hardware benchmark scope

inbound connection · comparison

Random-circuit sampling uses a different task and baseline contract.

Claim ledger

Every proposition keeps its own evidence state.

empirical-claimsingle-study

The cited study reports random-circuit samples from a 53-qubit superconducting processor and cross-entropy-based verification for the reported circuit family.

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.
Uncertainty
No platform-independent uncertainty interval exists; numerical values remain attached to the source experiment or model and its stated assumptions.
Replication
This candidate records one bounded source package. Independent replications and contradictory measurements must be compiled as separate records before maturity is upgraded.

Primary sources

Citation, locator, rights, and boundary travel together.

  1. Source 1 · Nature

    Quantum supremacy using a programmable superconducting processor

    Frank Arute, Kunal Arya, Ryan Babbush, Dave Bacon, et al.

    Exact locator
    Abstract; Figures 1–4; Methods; Supplementary Information; data availability.
    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.
    Boundary
    The reported advantage is task-, circuit-, fidelity-, classical-algorithm-, and comparison-hardware-specific and does not imply general commercial advantage.
    Rights basis
    citation with paraphrase · Maha paraphrases the source-level result and links to the version of record; no article passage is reproduced.
    Declared interests
    Most authors were affiliated with Google and the work evaluates Google hardware.