BlueQubit has announced a $20,000 challenge for “Unbreakable” Peaked Circuits, closing the “Trust Gap” in quantum computing.
BlueQubit’s $20,000 Quantum Circuit Challenge
The top quantum labs in the world have been dealing with a recurring, fundamental problem for years: it gets harder to demonstrate that their computers work as they get more powerful. Today, quantum software firm BlueQubit and University of Toronto researchers announced a breakthrough in “verifiable quantum advantage,” deploying HQAP (Heuristic Quantum Advantage Peaked) circuits that can be checked in seconds by a classical computer but take a supercomputer 34,000 years to solve. The company has issued a public challenge with a $20,000 Bitcoin (BTC) reward for anyone who can “break” these circuits using traditional techniques to demonstrate their robustness.
The End of “Quantum Advantage You Have to Trust”
Up to now, exponentially costly classical computation has been needed to validate claims of quantum advantage, such as those made by Google’s Sycamore or Willow systems. Essentially, scientists have asked the public to believe findings that cannot be verified again without expending millions of pounds on supercomputer time. This “cat-and-mouse game” has made doubters wonder if quantum supremacy has actually been attained or if it is still susceptible to traditional “spoofing” techniques.
The use of “peaked circuits” is the answer. A peaked circuit is designed so that one particular bitstring, the “peak,” occurs with a high probability, like 10%, in contrast to random circuits, which generate a disorganized distribution with trillions of alternative outcomes. Verification becomes easy: Bob, a quantum computer, receives a circuit description from Alice, a challenger, and all he needs to do is return the right peak. Without having to replicate the complete quantum state, Alice may quickly confirm Bob’s accomplishment if the peak shows up frequently in his results.
You can also read University of Tennessee at Chattanooga news in Space quantum
The “Unbreakable” Circuit’s construction
Renowned quantum theorists Scott Aaronson and Yuxuan Zhang first investigated the idea of peaked circuits, but BlueQubit has advanced the technology by creating “heuristic” versions that are meant to be classically impenetrable. Their HQAP circuits conceal the peak from traditional algorithms using three different obfuscation strategies.
Blocks of quantum processes that mathematically cancel each other out are first inserted using Identity Obfuscation. Even if these blocks have no effect on the outcome, figuring out that they don’t is a “QMA-complete” problem, which is the quantum counterpart of the most difficult classical logic problems. These “identity” blocks appear to be significant, intricate processes to a traditional simulator.
Second, to break the patterns that classical simulators rely on to make their work easier, the team used Swap Transformations, which permute the qubits mid-circuit. Lastly, correlations that could expose the internal structure of the circuit are concealed using Tensor Patch Optimization, which includes angle sweeping and masking. The end effect is a circuit that appears to be a random jumble but is actually concentrated on a single solution.
You can also read GPCPI Improves Phase Stability For Single-Cell Analysis
Classical Failure vs. Quantum Performance
The performance gap is glaring. Recently, a 56-qubit circuit with more than 2,000 gates was solved in less than two hours utilizing Quantinuum’s H2 processor. The H2 detected the peak 17 times out of 2,000 attempts in spite of the noise, which is orders of magnitude greater than the random chance of 1 in 72 quadrillion.
BlueQubit, on the other hand, “threw everything” at these circuits in a traditional manner, including thousands of GPU hours. Three cutting-edge simulation techniques were put to the test:
- Matrix Product States (MPS): Only worked for small circuits; when the number of gates increased over 600, the amount of memory needed increased rapidly.
- Belief Propagation Tensor Networks: Reach a “exponential wall” around about 700 gates. An entire 2,000-gate HQAP circuit is thought to take 300 million GPU hours to solve.
- Pauli Path Simulation (PPS): A more recent method that used an H100 GPU to monitor one billion Pauli strings before running out of RAM.
A Novel Approach to Encryption
These Peaked Circuits have the potential to transform post-quantum cryptography beyond benchmarking. Peaked circuits allow for “truly quantum” encryption, whereas the classical techniques used in current NIST standards are resistant to quantum attacks. Only a person with a working quantum computer can decrypt a communication using this protocol.
This technique provides “Receiver-local validity,” which allows a user to inspect the peak weight and instantly determine whether a message has been encrypted correctly. Additionally, it acts as a “Proof of quantum access,” requiring any potential decryptor to demonstrate that they have quantum hardware. According to BlueQubit, classical cryptography such as RSA is likewise predicated on untested assumptions regarding the difficulty of factoring large integers, even if this depends on the unproven “Peak-Search Hardness” conjecture.
You can also read Non Hermitian Skin Effect: The Future of Quantum Technology
Finally
These Peaked Circuits are now publicly available through the “BlueQubit Peak Portal” from BlueQubit. The company invites the top programmers in the world to attempt to locate the peaks classically in an effort to increase empirical confidence in quantum advantage, much like the RSA challenges of the 1990s.”We’re transitioning from ‘quantum advantage you have to trust’ to ‘quantum advantage you can verify,'” the company wrote in their report. The $20,000 Bitcoin reward is now open to anyone with access to a supercomputer and a creative algorithm. As the quantum community develops, the emphasis has moved from milestones to significant and verifiable power demonstrations.
You can also read Photonic Graph States with Inefficient Quantum Emitters
