BlueQubit Verifiable Quantum Advantage With Peaked Circuits
BlueQubit is challenging “Unbreakable” Peaked Circuits to close the quantum computing “Trust Gap” for $20,000.
The $20,000 Quantum Circuit Challenge by BlueQubit
The world's leading quantum labs have struggled for years to prove their computers work as they grew more powerful. Today, quantum software business BlueQubit and University of Toronto researchers revealed a breakthrough in “verifiable quantum advantage,” using HQAP (Heuristic Quantum Advantage Peaked) circuits that a classical computer can check in seconds but a supercomputer 34,000 years to solve. The business has challenged the public to “break” these circuits using traditional methods to prove their resilience for $20,000 Bitcoin (BTC).
No more “Quantum Advantage You Have to Trust”
To verify quantum advantage claims like Google's Sycamore or Willow systems, exponentially expensive classical computation has been needed. Scientists have asked the public to trust discoveries that need millions of pounds in supercomputer time to verify. This “cat-and-mouse game” has made naysayers wonder if quantum supremacy has been achieved or if it is still subject to “spoofing” approaches.
The solution is “peaked circuits”. Instead of random circuits, which generate a disorderly distribution with trillions of outcomes, peaked circuits are designed to produce one bitstring, the “peak,” with a high probability, like 10%. Simple verification: Bob, a quantum computer, receives a circuit description from Alice, a challenger, and returns the proper peak. Alice can swiftly verify Bob's achievement if the peak appears frequently in his results without replicating the quantum state.
Construction of the “Unbreakable” Circuit
Peaked circuits were first proposed by quantum theorists Scott Aaronson and Yuxuan Zhang, but BlueQubit has developed “heuristic” versions that are classically impenetrable. Their HQAP circuits obfuscate the peak from typical algorithms utilizing three methods.
Identity Obfuscation inserts mathematically canceling quantum process blocks. Figuring out that these blocks don't affect the conclusion is a “QMA-complete” problem, the quantum equivalent of the hardest classical logic problems. Traditional simulators view these “identity” pieces as complex operations.
Second, the researchers employed Swap Transformations to permute qubits mid-circuit to break classical simulators' patterns and make their task easier. Tensor Patch Optimization, which involves angle sweeping and masking, hides correlations that could reveal the circuit's fundamental structure. The result is a circuit that looks random but is focused on one solution.
Quantum Performance vs. Classical Failure
The performance gap is obvious. The H2 processor of Quantinuum solved a 56-qubit circuit with almost 2,000 gates in under two hours. Despite the noise, the H2 spotted the peak 17 times out of 2,000 attempts, orders of magnitude higher than the random chance of 1 in 72 quadrillion.
BlueQubit, however, “threw everything” at these circuits, including thousands of GPU hours. Three cutting-edge simulation methods were tested:
Matrix Product States (MPS): Only worked for small circuits; memory needed rose fast when gates over 600. Believer Propagation Tensor Networks: Reach a “exponential wall” around 700 gates. A 2,000-gate HQAP circuit may take 300 million GPU hours to solve.
Pauli Path Simulation (PPS): A newer approach that monitored one billion Pauli strings on an H100 GPU before RAM ran out.
A New Encryption Method
These Peaked Circuits could advance post-quantum cryptography beyond benchmarks. Peaked circuits enable “truly quantum” encryption, while classical NIST standards are quantum-resistant. Only a quantum computer user can decrypt this protocol.
This method provides "Receiver-local validity," allowing users to rapidly check the peak weight to see if a message was encrypted correctly. It also serves as "Proof of quantum access," forcing potential decryptors to show quantum hardware. BlueQubit claims that classical cryptography like RSA relies on untested assumptions about the difficulty of factoring large integers, even if it relies on the “Peak-Search Hardness” theory.
Finally
The “BlueQubit Peak Portal” from BlueQubit makes these Peaked Circuits public. The corporation encourages the world's greatest programmers to locate the peaks classically to improve empirical confidence in quantum advantage, similar to the 1990s RSA challenges.In its report, the corporation said they were moving from ‘quantum advantage you have to trust’ to ‘quantum advantage you can verify. Anyone with a supercomputer and clever algorithm can win $20,000 Bitcoin. As quantum communities grow, milestones have given way to large and verifiable power demonstrations.
