Bounded definition
The cited study reports random-circuit samples from a 53-qubit superconducting processor and cross-entropy-based verification for the reported circuit family. Within this page, that proposition is limited to The models, apparatus, protocols, datasets, and comparisons reported in Quantum supremacy using a programmable superconducting processor.
Definition and evidence boundary
A benchmark task that samples outputs from pseudo-random quantum circuits and compares them with a defined classical simulation and verification procedure. The bounded proposition retained by the canonical record is: The cited study reports random-circuit samples from a 53-qubit superconducting processor and cross-entropy-based verification for the reported circuit family.
The applicable scope is The models, apparatus, protocols, datasets, and comparisons reported in Quantum supremacy using a programmable superconducting processor. This definition must not be generalized beyond the cited source and exact record boundary.
Claims: urn:maha:claim:random-circuit-sampling
Mechanism and technical context
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. This is the source-bound technical context for the record; no uncited mechanism is added by the compiler.
A speed comparison for random-circuit sampling is not evidence of faster performance on unrelated industrial workloads. The mechanism or method is therefore presented as one component of a larger system, not as evidence for every downstream outcome.
Claims: urn:maha:claim:random-circuit-sampling
How to interpret the evidence
No platform-independent uncertainty interval exists; numerical values remain attached to the source experiment or model and its stated assumptions. The evidence maturity recorded here is single study, and the claim kind is empirical claim.
This candidate records one bounded source package. Independent replications and contradictory measurements must be compiled as separate records before maturity is upgraded. The reported advantage is task-, circuit-, fidelity-, classical-algorithm-, and comparison-hardware-specific and does not imply general commercial advantage. These qualifications travel with the claim whenever it is reused.
Claims: urn:maha:claim:random-circuit-sampling
What the source supports and what remains unknown
The inspected source supports exactly this: 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. It was read at Abstract; Figures 1–4; Methods; Supplementary Information; data availability.
What remains unknown is everything outside that locator. A speed comparison for random-circuit sampling is not evidence of faster performance on unrelated industrial workloads. No quantity, comparison, or downstream outcome is established here unless a separately scoped record measures it.
Claims: urn:maha:claim:random-circuit-sampling
Source identity, locator, and reuse boundary
The bound source is “Quantum supremacy using a programmable superconducting processor” by Frank Arute, Kunal Arya, Ryan Babbush, Dave Bacon, et al., published by Nature on 2019-10-23; its declared stable identity is doi:10.1038/s41586-019-1666-5.
The inspected-content locator is Abstract; Figures 1–4; Methods; Supplementary Information; data availability. Reuse is limited to citation-with-paraphrase. Maha paraphrases the source-level result and links to the version of record; no article passage is reproduced. This metadata establishes source identity and inspection scope, not the truth of claims outside the cited locator.
Claims: urn:maha:claim:random-circuit-sampling
Comparison and calculation boundary
Applicability is decided explicitly, not filled with generic material.
This record carries 1 source-bound proposition and therefore has no second supported side. A comparison would have to be manufactured from an adjacent title rather than from a second inspected claim, which the gate forbids.
The canonical claim declares no reproducible numerical inputs, equation, units, or uncertainty propagation; recorded uncertainty kind is qualitative. Supplying sample values would invent an unsupported quantitative result.
Limitations and prohibited inference
The claim stops where its evidence stops.
- record boundary
A speed comparison for random-circuit sampling is not evidence of faster performance on unrelated industrial workloads.
- record boundary
A source-bounded mechanism, method, or measurement record does not establish manufacturing yield, economic advantage, safety, clinical benefit, or commercial readiness unless those outcomes are measured in a separately scoped record.
- prohibited inference
Do not infer general quantum-computing readiness from the random-circuit sampling record alone.
- prohibited inference
Do not transfer a reported result across hardware, organisms, protocols, datasets, operating conditions, or outcome definitions without a declared comparison contract.
- editorial
This compilation reorganizes an existing inspected claim and its declared source; it does not add a new experiment, measurement, or independent replication.
- editorial
Internal editorial inspection is not external peer review, and no result on this page has been independently reproduced.
Related records and mathematical bridges
Typed links expose context without asserting equivalence.
Quantum hardware benchmark scope
Declared mechanistic-dependency edge from this record. The edge is navigational and asserts no equivalence or causation beyond the cited source scope.
Selection: bridge edge
Quantum volume benchmark
Declared strategic-dependency edge from this record. The edge is navigational and asserts no equivalence or causation beyond the cited source scope.
Selection: bridge edge
When no declared bridge edge is present, related records are linked by shared evidence or canonical domain adjacency. Those links are navigational and do not claim mathematical or physical equivalence.
Connected domain graph
Typed dependencies preserve publication state.
Only independently canonical records receive public links and relation statements. Draft graph topology remains private.
Quantum hardware benchmark scope
outbound connection · comparison
The claim depends on the exact task, fidelity metric, classical baseline, and hardware snapshot.
Quantum volume benchmark
outbound connection · measurement
Both use random circuits but define different acceptance metrics and scaling summaries.
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.
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.
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.