Logo des Repositoriums
 

Implementations for Shor's algorithm for the DLP

dc.contributor.authorMandl,Alexander
dc.contributor.authorEgly,Uwe
dc.contributor.editorDemmler, Daniel
dc.contributor.editorKrupka, Daniel
dc.contributor.editorFederrath, Hannes
dc.date.accessioned2022-09-28T17:11:03Z
dc.date.available2022-09-28T17:11:03Z
dc.date.issued2022
dc.description.abstractShor's algorithm for solving the discrete logarithm problem is one of the most celebrated works in quantum computing. It builds upon a quantum circuit performing modular exponentiation. As this is a comparatively expensive process, many approaches for reducing both the number of used qubits and the number of applied gate operations have been proposed. We provide quantum circuits in Qiskit for three different implementation proposals aiming to reduce space complexity and compare their performance regarding their asymptotic gate complexity. We make use of the circuit implementations and Qiskit’s simulation capabilities to compare the actual number of applied gate operations in compiled circuits for small problem instances to aid future applications of this algorithm.en
dc.identifier.doi10.18420/inf2022_96
dc.identifier.isbn978-3-88579-720-3
dc.identifier.pissn1617-5468
dc.identifier.urihttps://dl.gi.de/handle/20.500.12116/39601
dc.language.isoen
dc.publisherGesellschaft für Informatik, Bonn
dc.relation.ispartofINFORMATIK 2022
dc.relation.ispartofseriesLecture Notes in Informatics (LNI) - Proceedings, Volume P-326
dc.subjectquantum computing
dc.subjectdiscrete logarithm
dc.subjectimplementation
dc.subjectShor's algorithm
dc.titleImplementations for Shor's algorithm for the DLPen
gi.citation.endPage1143
gi.citation.startPage1133
gi.conference.date26.-30. September 2022
gi.conference.locationHamburg
gi.conference.sessiontitleGI Quantum Computing Workshop

Dateien

Originalbündel
1 - 1 von 1
Lade...
Vorschaubild
Name:
giquantum_03.pdf
Größe:
132.58 KB
Format:
Adobe Portable Document Format