Curator's Take
This article delivers a sobering reality check to recent quantum advantage claims, demonstrating that circuits thought to be classically intractable can actually be simulated efficiently using clever tensor network techniques. The researchers' ability to extract the hidden peak from Quantinuum's 56-qubit circuits in just one hour on a single GPU—faster than the quantum hardware itself—highlights how the race for quantum supremacy continues to be a moving target as classical algorithms evolve. Their "unswapping" method that exploits the mirrored structure of peaked circuits represents an important advance in classical simulation techniques, reminding the field that demonstrating true quantum advantage requires careful consideration of the best possible classical approaches, not just brute-force methods. This work underscores why the quantum computing community must continuously raise the bar for what constitutes genuine quantum computational advantage.
— Mark Eatherly
Summary
Peaked quantum circuits, whose output distribution is sharply concentrated on a single bitstring, have emerged as a promising candidate for verifiable quantum advantage, as the correctness of the quantum output can be checked by simply comparing against the known peak. Recent work by Gharibyan et al. arXiv:2510.25838 claimed heuristic quantum advantage using peaked circuits executed on Quantinuum's 56-qubit H2 processor. These peaked circuits concentrate their output on a single hidden bitstring by training a shallow simulable circuit variationally and inserting an obfuscated permutation to increase the depth to a level that makes classical simulation intractable, with estimated runtimes of years for the largest instances. We show that these circuits can be efficiently simulated classically. We describe a method that efficiently performs a full tensor network contraction, allowing near-exact sampling and extraction of the peaked bitstring. The method exploits the mirrored structure of the circuit and iteratively cancels both halves into a Matrix Product Operator (MPO), and avoids the obfuscated permutation by greedily reducing the MPO bond dimension through a process we call unswapping. The method can fully contract and extract the peak of the largest circuit in approximately one hour on a single GPU, around half the time it took to run on the quantum hardware.