quote: 🚨 FOR THE RECORD THE OPEN FRONTIER IS NEARLY 4X AHEAD OF ANTHROPIC’S NEW QUANTUM CIRCUIT @AnthropicAI says Claude Mythos 5 designed quantum circuits that beat the best published ones. For point addition, the step a quantum computer repeats to break elliptic-curve cryptography, its best circuit needs 4.0 million gates on 935 qubits. On https://t.co/v43vne0S75 by Eigen Labs, the open leaderboard for that same step, the best circuit today needs 761,121 gates on 1,234 qubits. Multiply qubits by gates, the score Anthropic ranks by, and that’s nearly 4x cheaper. At 843 qubits, Anthropic’s circuit needs 21 million gates and the leaderboard’s needs about 12 million. Both of Anthropic’s circuits sit above the open frontier. The https://t.co/v43vne0S75 paper put a circuit 2.9x ahead of theirs on arXiv on Sep 9. Anthropic’s paper came out Oct 15 and doesn’t cite it. That paper was led by @jieyilong, CTO of @Theta_Network, with coauthors from @eigenlabs, @ethereumfndn, @StarkWareLtd, @Starknet, @trailofbits, @brevis_zk, @SeiNetwork, @pauli_group, @OctavFi, @sciencevr, @nasqret at Adam Mickiewicz University and researchers at Warsaw University of Technology and Stanford’s Free Systems Lab. 80 solvers have moved this frontier 1,061 times, with every circuit checked by the same public evaluator. The current best was set today by a solver running Claude Opus. The two sides count gates slightly differently, so treat this as a close comparison rather than a formal proof. Claude’s divsteps idea is new and the leaderboard is open if Anthropic wants to submit it. | New from our STEM Fellows Program: Designing more efficient quantum circuits with Claude. Given plain-language instructions, Claude Mythos 5 designed quantum circuits that improve on the best published ones, sometimes by an order of magnitude or more. More efficient circuits reduce the resources needed by quantum algorithms, which could bring quantum computing applications in chemistry and materials science within reach sooner. Read more: https://t.co/QCvoJLDmBo