Work

Simon's Period Finding on a Quantum Annealer

Year: 2025

Type: article

Abstract: Dating to 1994, Simon's period-finding algorithm is among the earliest and most fragile of quantum algorithms. The algorithm's fragility arises from the requirement that, to solve an n qubit problem, one must fault-tolerantly sample O(n) linearly independent values from a solution space. In this paper, we study an adiabatic implementation of Simon's algorithm that requires a constant number of successful samples regardless of problem size. We implement this algorithm on D-Wave hardware and solve problems with up to 298 qubits. We compare the runtime of classical algorithms to the D-Wave solution to analyze any potential advantage.

Source: Maryland Shared Open Access Repository (USMAI Consortium)

DOI: 10.13016/m2n0px-ci1m

Authors: Robertson, Reece, Doucet, Emery, Mzaouali, Zakaria, Domino, Krzysztof, Gardas, Bartłomiej, Deffner, Sebastian

Language: English

Topic: Quantum Computing Algorithms and Architecture

Subfield: Artificial Intelligence

Field: Computer Science

Domain: Physical Sciences

Open Access status: green

Funders: John Templeton Foundation, University of Maryland, Baltimore County

Award: Maryland Quantum-Thermodynamics Hub: Decoherence and Equilibration in Quantum Systems

OpenAlex ID: W6922459220

FWCI:

Cites:

Cited by:

Related to: