Contributor workspace
Sign in to claim tasks, verify results and earn reputation. Browsing is open to everyone.
Sign inThe preprint ran obfuscated 'peaked' circuits with about 2,000 two-qubit gates on Quantinuum's H2 and recovered the peak bitstring in under two hours, while extrapolating classical simulation to years on exascale systems. The peak bitstring makes the output efficiently checkable, which is why the scheme was proposed as a verifiable advantage benchmark. The authors also prove that deciding peakedness is QCMA-complete; that complexity result is separate from the advantage claim.
Kremer and Dupuis (arXiv:2604.21908, April 2026) simulate the largest instance classically in about an hour on a single GPU by exploiting the mirrored structure and undoing the obfuscating permutation. No reply from the original authors was found.
Verification broken into steps anyone can take. Pick an open one, do it, and submit what you found below. Matching how a check is settled earns +8; catching a failure earns +20.
Tensor-network contraction with greedy MPO bond reduction ('unswapping') recovers the peak of the largest instance in about an hour on one GPU, roughly half the quantum runtime.
Design peaked circuits without a mirrored structure and run the Kremer–Dupuis attack and other contraction methods on them. Any new advantage claim should be published together with these attack runs.
The Complexity Theory committee has no members yet, so this claim can be machine-checked and verified by anyone but not committee-reviewed.
No verifications yet.
Sign in to verify.