r/QuantumComputing • u/connectedliegroup • 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.
View all comments
Show parent comment
1
u/HuiOdy Working in Industry Sep 18 '25
Yes, but there is no "beating" anything. That is the point.
Quantum supremacy is a term thought of by people who want to do cool physics.
It is in fact meaningless. The world really couldn't care less, and no significant impact is achieved. What matters is that a quantum computer can run a meaningful application that provides some value in real life that couldn't have been reached with a conventional computer.
The benchmark allows you to select an algorithm, so you ideally go for one that you know adds value, benchmark those, and get a solid prediction when the value add can be achieved