✓ checked
trust me, bro:
here is the receipt.
the claim
Quantum computers have solved a problem that classical supercomputers cannot solve in feasible time.
the verdict
CONTESTED PARTIAL
Recorded sources
6 sources for · 4 against
Is it true that quantum computers have solved a problem that classical supercomputers cannot solve in feasible time?
Partly. Several sources describe quantum algorithms with theoretical speedups over classical computation, and one theoretical result shows a BQP-complete problem no efficient classical algorithm can solve. However, other sources indicate current quantum hardware remains limited in accuracy and scalability, and no item reports an actual problem solved on a quantum computer that classical supercomputers cannot solve in feasible time.
Verdict: CONTESTED PARTIAL · 6 sources for, 4 against · Last checked
Evidence for · 6
Get citation
A New Searching Problem Solved by Quantum Computers. (2002). doi.org. https://doi.org/10.1088/0256-307x/19/4/304
Evidence against · 4
Get citation
Adiabatic Quantum Computing for the Subset Sum Problem: Preliminary Studies. (2025). hal.science. https://hal.science/hal-05164717v1
See more details
More for · 5
Get citation
Quantum Problem Solvers. (2009). doi.org. https://doi.org/10.1126/science.326_645b
Get citation
Quantum Computer Search Algorithms: Can We Outperform the Classical Search Algorithms?. (2019). doi.org. https://doi.org/10.1007/978-3-030-32520-6_34
Get citation
Dwivedi, P. S., Biswas, A., & Dohare, I. (2025). A Quantum-Classical Approach to Solve the Graph Colouring Problem with Minimum Colours. doi.org. https://doi.org/10.21203/rs.3.rs-7196567/v1
Get citation
Jordan, S. P., Krovi, H., Lee, K. S. M., & Preskill, J. (2018). BQP-completeness of scattering in scalar quantum field theory. doi.org. https://doi.org/10.22331/q-2018-01-08-44
Get citation
Chi, Z. (2011). Quantum Algorithms and Complexity for Numerical Problems. doi.org. https://doi.org/10.7916/D8GF11GX
More against · 3
Get citation
Qian, W., Basili, R., Pal, S., Luecke, G., & Vary, J. P. (2022). Solving hadron structures using the basis light-front quantization approach on quantum computers. doi.org. https://doi.org/10.1103/physrevresearch.4.043193
Get citation
Report on High Performance Computing meets Quantum Computing (HPC+QC'24) Minisymposium 2024. (2025). hal.science. https://hal.science/hal-05108765v1
Get citation
Huang, J., Chang, Q., & Fan, H. (2024). Paint shop vehicle sequencing based on quantum computing considering color changeover and painting quality. doi.org. https://doi.org/10.55092/am20240002
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
Terms · Privacy · How verdicts work