THE QUANTUM INTELLIGENCER

Demonstrating Heuristic Quantum Advantage with Peaked Circuits on Quantinuum H2: A Path to Verifiable Quantum Supremacy and Quantum-Safe Encryption In Plain English: Scientists have built a special kind of quantum program that their quantum computer can run quickly, but even the best regular supercomputers would take years to solve. They designed these programs to produce a very specific, predictable answer that’s easy to check, solving a big problem with earlier quantum experiments that were hard to verify. They ran the program on a powerful quantum machine and got the answer in under two hours, while simulations suggest it would take today’s fastest supercomputers far longer. This shows a real speed advantage for quantum computers on a verifiable task. They also suggest that the difficulty of cracking these programs could be used in the future to create new types of unbreakable digital security. Summary: This paper introduces "Heuristic Quantum Advantage with Peaked Circuits" (HQAP), a protocol designed to demonstrate verifiable quantum advantage on current utility-scale quantum hardware. The authors implement HQAP circuits on Quantinuum’s System Model H2, a trapped-ion quantum processor with high-fidelity gates and all-to-all qubit connectivity. These circuits are engineered to produce a sharply peaked output distribution — meaning one specific bitstring appears with significantly higher probability than others — enabling straightforward verification of correct operation. The largest circuit tested applies 2000 two-qubit gates with full connectivity and generates the target bitstring in under two hours. To assess classical difficulty, the team benchmarks multiple state-of-the-art classical simulation techniques, including tensor network contraction enhanced with belief propagation and Pauli path integral simulators. Extrapolations indicate that simulating this instance would require years on exascale systems like Frontier and Summit, suggesting a potentially exponential quantum speedup. The work thus represents a milestone in achieving a verifiable, scalable quantum advantage on a programmable quantum device. Beyond the experimental demonstration, the paper contributes a theoretical hardness result: determining whether a generic quantum circuit is "peaked" — when both input and output are unknown — is QCMA-complete. This complexity-theoretic result implies that even quantum computers cannot efficiently verify such properties without a proof (a witness), assuming standard complexity conjectures. Inspired by this intractability, the authors propose a novel application: a quantum-safe encryption scheme where the security relies on the computational difficulty of analyzing peaked circuits. The proposal draws on existing literature in post-quantum cryptography and suggests a new paradigm based on quantum circuit structure rather than traditional mathematical problems. All circuit designs are made publicly available to encourage further classical challenges, testing the robustness of the observed quantum-classical gap. Key Points: - Researchers have demonstrated a quantum advantage using specially designed "peaked circuits" on Quantinuum’s H2 quantum processor. - The circuits produce a single dominant output bitstring, making the correct result easy to verify — a major improvement over prior unverifiable advantage claims. - A 2000 two-qubit-gate circuit with all-to-all connectivity was executed in under two hours on H2. - Classical simulations using advanced methods (tensor networks + belief propagation, Pauli path simulators) are extrapolated to require years on exascale supercomputers. - The observed quantum-classical runtime gap suggests potentially exponential separation, marking a heuristic (not provable) quantum advantage. - Theoretically, determining whether a circuit is peaked (with unknown input/output) is proven to be QCMA-complete, indicating computational hardness. - This hardness motivates a proposed quantum-safe encryption scheme based on the intractability of analyzing peaked circuits. - The circuits are publicly released to invite the community to attempt classical solutions and validate the advantage claim. Notable Quotes: - “Our extrapolations from leading classical simulation techniques… indicate the same instance would take years on exascale systems (Frontier, Summit), suggesting a potentially exponential separation.” - “This work marks an important milestone toward verifiable quantum advantage, as well as providing a useful benchmarking protocol for current utility-scale quantum hardware.” - “Determining whether the circuit is peaked constitutes a QCMA-complete problem, meaning the problem remains hard even for a quantum polynomial-time machine under commonly accepted complexity assumptions.” - “Inspired by this observation, we propose an application of the peaked circuits as a potentially quantum-safe encryption scheme” \cite{chen2016report,kumar2020post,joseph2022transitioning,dam2023survey}. Data Points: - Largest circuit: 2000 two-qubit gates with all-to-all connectivity. - Quantum runtime: Under 2 hours to produce the target peaked bitstring on Quantinuum H2. - Classical simulation estimate: Years on exascale systems (Frontier, Summit). - Simulation methods tested: Tensor networks with belief propagation, Pauli path simulators. - Date of publication context: February 17, 2026 (current date). - Complexity class: QCMA-complete for the decision problem of determining if a circuit is peaked with unknown input and output. Controversial Claims: - The claim that classical simulation would take "years" on exascale systems is based on extrapolation from smaller instances and current simulation techniques - novel classical algorithms or optimizations could potentially close the gap, making the advantage non-robust. - The assertion of "potentially exponential separation" is heuristic and not mathematically proven - it relies on the assumption that no efficient classical algorithm exists for simulating peaked circuits. - The proposal of a "quantum-safe encryption scheme" based on peaked circuits is highly speculative at this stage, lacking a formal security proof or cryptanalysis, and may not meet standard criteria for cryptographic deployment. - The QCMA-completeness result applies to a worst-case decision problem about generic peaked circuits, but it is unclear how tightly this connects to the average-case hardness required for practical encryption. Technical Terms: - Peaked circuits: Quantum circuits engineered to produce a sharply peaked output probability distribution. - Heuristic Quantum Advantage (HQA): A quantum speedup demonstrated empirically without formal proof of classical hardness. - QCMA-complete: A complexity class where problems are verifiable with a quantum polynomial-time verifier given a classical proof - completeness implies hardness. - Tensor networks: A method for classically simulating quantum circuits by representing quantum states as networks of tensors. - Belief propagation: An algorithm used in tensor network contraction to optimize the contraction order. - Pauli path simulators: Classical simulation techniques that sample quantum circuits using paths in Pauli operator space. - All-to-all connectivity: A qubit architecture where any qubit can directly interact with any other. - Quantum advantage (or supremacy): The point at which a quantum computer solves a task infeasible for classical computers. - Verifiable quantum advantage: A quantum advantage where the correct output can be efficiently checked by a classical observer. —Ada H. Pemberley Dispatch from The Prepared E0