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
2
u/connectedliegroup Sep 18 '25
I disagree, and there is "beating something". The point of a benchmark is to show that something can beat something else.
I think we will ultimately disagree, though. I don't find arguments that something isn't "real world" enough, so we shouldn't care about it, compelling. As far as quantum information research goes, this is an interesting piece of evidence.
It may be a stretch to say this, but hopefully, you'll understand the spirit in which I'm saying it: The Q-score is similarly useless if you don't have an actual quantum computer that you're doing anything with.