trustmebro.to/r/…
✓ checked
trust me, bro:
here is the receipt.
the claim

Quantum computers have performed specific computations that classical supercomputers cannot complete in practical time.

the verdict
CONTESTED PARTIAL
Recorded sources
2 sources for · 3 against

Counts group repeated records of the same source within each side. They do not measure evidence strength or source independence.

Is it true that quantum computers have performed specific computations that classical supercomputers cannot complete in practical time?

Partly. One reference reports Google's 2019 claimed quantum supremacy computation, though IBM disputed it, and a peer-reviewed paper says quantum computation is expected to be faster for specific problems. Other peer-reviewed sources say current noise prohibits substantial quantum computations, fault-tolerant machines are years away, and true practical quantum supremacy has not been established.

Verdict: CONTESTED PARTIAL · 2 sources for, 3 against · Last checked

The private library was unavailable for some searches in this check. Missing library results are not evidence against the claim.

Evidence for · 2
Universal quantum computation using quantum annealing with the transverse-field Ising Hamiltonian
Get citation
Universal quantum computation using quantum annealing with the transverse-field Ising Hamiltonian. (n.d.). cir.nii.ac.jp. https://doi.org/10.48550/arxiv.2402.19114

Evidence against · 3
Solving Quantum Many-Body Problems on Quantum Computers
2023
Get citation
Solving Quantum Many-Body Problems on Quantum Computers. (2023). theses.hal.science. https://doi.org/10.70675/911dc194ze97bz42d2z8611z3daf90a7419c

See more details
More for · 1
Quantum computing
Get citation
Quantum computing. (n.d.). en.wikipedia.org. https://en.wikipedia.org/wiki/Quantum_computing

More against · 2
Provably efficient machine learning for quantum many-body problems
2021
Get citation
Huang, H., Kueng, R., Torlai, G., Albert, V. V., & Preskill, J. (2021). Provably efficient machine learning for quantum many-body problems. doi.org. https://doi.org/10.1126/science.abk3333

ASAS-NANP SYMPOSIUM: MATHEMATICAL MODELING IN ANIMAL NUTRITION: quantum computing in agricultural sciences: from theory to reality.
2026
Get citation
LO, T. (2026). ASAS-NANP SYMPOSIUM: MATHEMATICAL MODELING IN ANIMAL NUTRITION: quantum computing in agricultural sciences: from theory to reality.. doi.org. https://doi.org/10.1093/jas/skaf445

Receipt History
Anyone with this link can read the claim and its public receipt, including any personal information in that text. Open permanent receipt.
Check your own claim
Challenge the receipt
Requests are recorded for review. This does not start an automatic check or guarantee a response time.

Citation formatting by citeproc-js (Frank Bennett) and the Citation Style Language project. Source and licenses.

This receipt is an automated verdict against our published method · not an opinion about any author or publication.
Terms · Privacy · How verdicts work