On April 14, 2025, researchers demonstrated a novel adiabatic implementation of Simon’s period-finding algorithm on quantum annealing hardware, successfully solving problems with up to 298 qubits and comparing their results against classical algorithms.
The paper presents an adiabatic implementation of Simon’s period-finding algorithm that reduces the required number of fault-tolerant samples to a constant, regardless of problem size. This approach was tested on hardware with up to 298 qubits, demonstrating practical scalability. The study compares the runtime of classical algorithms against this quantum solution to assess potential advantages.
Computing using D-Wave employs adiabatic quantum computation, a method that leverages quantum mechanics to find the lowest energy state of a system, corresponding to the optimal solution for a given problem. This approach effectively solves quadratic unconstrained binary optimization (QUBO) problems, prevalent across various industries. For instance, D-Wave’s systems have been applied to reschedule trains in complex urban networks, demonstrating their potential in logistics and transportation.
Notably, experiments have successfully factored large numbers, a critical task for modern cryptography. Additionally, D-Wave’s systems have been utilized to solve challenging optimization problems, showcasing their versatility across different domains. These findings underscore quantum computing technologies’ growing maturity and readiness to address real-world issues computationally intensive for classical methods.
👉 More information
🗞 Simon’s Period Finding on a Quantum Annealer
🧠 DOI: https://doi.org/10.48550/arXiv.2504.10771
