DOE OSTI · 2977848
Demonstration of Algorithmic Quantum Speedup for an Abelian Hidden Subgroup Problem
Abstract
Simon’s problem is to find a hidden period (a bitstring) encoded into an unknown 2-to-1 function. It is one of the earliest problems for which an exponential quantum speedup was proven for ideal, noiseless quantum computers, albeit in the oracle model. Here, using two different 127-qubit IBM Quantum superconducting processors, we demonstrate an algorithmic quantum speedup for a variant of Simon’s problem where the hidden period has a restricted Hamming weight 𝑤. For sufficiently small values of 𝑤 and for circuits involving up to 58 qubits, we demonstrate an exponential speedup, albeit of a lower quality than the speedup predicted for the noiseless algorithm. The speedup exponent and the range of 𝑤 values for which an exponential speedup exists are significantly enhanced when the computation is protected by dynamical decoupling. Further enhancement is achieved with measurement error mitigation. This case constitutes a demonstration of a bona fide quantum advantage for an Abelian hidden subgroup problem.
Explore related subjects
Keep this discovery
Explore connections, maps & timelines
Singkanipa, Phattharaporn [Univ. of Southern California, Los Angeles, CA (United States)] (ORCID:0009000636124293), Kasatkin, Victor [Univ. of Southern California, Los Angeles, CA (United States)] (ORCID:000900026506821X), Zhou, Zeyuan [Johns Hopkins Univ., Baltimore, MD (United States)], Quiroz, Gregory [Johns Hopkins Univ., Baltimore, MD (United States); Johns Hopkins University Applied Physics Laboratory, Laurel, MD (United States)] (ORCID:0000000343291445), Lidar, Daniel A. [Univ. of Southern California, Los Angeles, CA (United States); Quantum Elements, Inc., Thousand Oaks, CA (United States)] (ORCID:0000000216711515). 2025-06-05. Demonstration of Algorithmic Quantum Speedup for an Abelian Hidden Subgroup Problem. https://doi.org/10.1103/physrevx.15.021082
Cite the original work for its findings. Save a collection to share your selection of sources.