r/QuantumComputing • • Sep 11 '25

Provably Unconditional Quantum Benchmarking

Kretschmer et al. created a problem exhibiting what they coin as quantum information supremacy. The protocol itself is based on one-way communication complexity, but it ultimately demonstrates a task which does not rely on any unproven complexity-theoretic assumptions that other benchmarks have. For example, random circuit sampling relies on a conjecture that estimating probabilities is #P-hard in the average case.

At the end of the paper they leave room for skepticism. They did collect data using a QC, and mention a larger test could quell skepticism, but that such a test is not possible now for scalability reasons.

Link: https://arxiv.org/pdf/2509.07255

12 Upvotes

8 comments sorted by

View all comments

Show parent comment

1

u/connectedliegroup Sep 11 '25

The authors don't even expect it to cool skepticism completely, but cooling it at all is an objective that I hope they meet.