Simon's Period Finding on a Quantum Annealer

Files

250410771v1.pdf (1.31 MB)

Links to Files

http://arxiv.org/abs/2504.10771

Permanent Link

https://doi.org/10.48550/arXiv.2504.10771
 http://hdl.handle.net/11603/38696

Collections

UMBC Student Collection
UMBC Computer Science and Electrical Engineering Department
UMBC Faculty Collection
UMBC Physics Department

Author/Creator

Author/Creator ORCID

https://orcid.org/0000-0003-1064-0012
 https://orcid.org/0000-0002-2693-8553
 https://orcid.org/0000-0003-0504-6932

Date

2025-04-15

Type of Work

journal articles
preprints
Text

Department

Program

Citation of Original Publication

Rights

This item is likely protected under Title 17 of the U.S. Copyright Law. Unless on a Creative Commons license, for uses protected by Copyright Law, contact the copyright holder or the author.

Subjects

UMBC Quantum Thermodynamics Group
Computer Science - Emerging Technologies Quantum Physics

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.