Pith. sign in

REVIEW 1 cited by

Comment on "Quantum supremacy using a programmable superconducting processor"

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 1911.00577 v1 pith:RRWNCOS5 submitted 2019-11-01 quant-ph

classification quant-ph
keywords quantumclassicalevenprocessoruniversalalreadybeencapacity
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Even if Google AI's Sycamore processor is efficient for the particular task it has been designed for it fails to deliver universal computational capacity. Furthermore, even classical devices implementing transverse homoclinic orbits realize exponential speedups with respect to universal classical as well as quantum computations. Moreover, relative to the validity of quantum mechanics, there already exist quantum oracles which violate the Church-Turing thesis.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Generalized Cross-Entropy Benchmarking for Random Circuits with Ergodicity

    quant-ph 2025-02 conditional novelty 5.0 of 10

    Random circuits satisfy an ergodicity condition for positive-coefficient polynomials, and its deviation can benchmark quantum chip fidelity, recovering and generalizing linear cross-entropy benchmarking.

Pith tools