Simon's Period Finding on a Quantum Annealer

Simple item page
dc.contributor.authorRobertson, Reece
dc.contributor.authorDoucet, Emery
dc.contributor.authorMzaouali, Zakaria
dc.contributor.authorDomino, Krzysztof
dc.contributor.authorGardas, Bartłomiej
dc.contributor.authorDeffner, Sebastian
dc.date.accessioned2025-06-05T14:03:22Z
dc.date.available2025-06-05T14:03:22Z
dc.date.issued2025-04-15
dc.description.abstractDating 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.
dc.description.sponsorshipThe authors acknowledge the Julich Supercomputing Centre3 for providing computing time on the DWave Advantage System JUPSI through the Julich UNified Infrastructure for Quantum computing JUNIQ R R acknowledges funding from the UMBC Cybersecurity Institute Z M acknowledges funding from the National Science Center NCN under the Miniatura 8 grant 2024 08 X ST2 00099; and from the Ministry of Economic Affairs Labour and Tourism BadenWurttemberg in the frame of the Competence Center Quan tum Computing BadenWurttemberg project KQCBW24 B G acknowledges funding from the National Science Center NCN Poland under Projects Sonata Bis 10 No 2020 38 E ST3 00269 S D acknowledges support from the John Templeton Foundation under Grant No 62422
dc.description.urihttp://arxiv.org/abs/2504.10771
dc.format.extent6 pages
dc.genrejournal articles
dc.genrepreprints
dc.identifierdoi:10.13016/m2n0px-ci1m
dc.identifier.urihttps://doi.org/10.48550/arXiv.2504.10771
dc.identifier.urihttp://hdl.handle.net/11603/38696
dc.language.isoen_US
dc.relation.isAvailableAtThe University of Maryland, Baltimore County (UMBC)
dc.relation.ispartofUMBC Student Collection
dc.relation.ispartofUMBC Computer Science and Electrical Engineering Department
dc.relation.ispartofUMBC Faculty Collection
dc.relation.ispartofUMBC Physics Department
dc.rightsThis 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.
dc.subjectUMBC Quantum Thermodynamics Group
dc.subjectComputer Science - Emerging Technologies Quantum Physics
dc.titleSimon's Period Finding on a Quantum Annealer
dc.typeText
dcterms.creatorhttps://orcid.org/0000-0003-1064-0012
dcterms.creatorhttps://orcid.org/0000-0002-2693-8553
dcterms.creatorhttps://orcid.org/0000-0003-0504-6932

Files

Original bundle

Now showing 1 - 1 of 1
Thumbnail Image
Name:
250410771v1.pdf
Size:
1.31 MB
Format:
Adobe Portable Document Format
Download

Collections

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