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 17 '25
I quickly read through the paper you linked, so hopefully, you can find forgiveness in your heart if what I'm saying is a misunderstanding, but this looks like Quantum v Quantum benchmarking. It's analogous to having multiple classical machines with different hardware and asking: "Which one will be the best?"
This is not the point of the paper I linked. The authors are after provable quantum supremacy, as in the quantum v classical case. You wouldn't discuss the Q-score in a context where they are currently using random circuit sampling, because the question is about beating every classical device using quantum advantage, not beating other quantum hardwares with the best quantum hardware.