Quick Navigation

Overview Topics Abstract Importance Paper Tools References Reactions Discussion Publication Related

Topics

Quantum Simulation Quantum State Preparation Representation

A reduction of semigroup DLP to classic DLP

arXiv

Authors: Matan Banin, Boaz Tsaban

Year

2013

Paper ID

31177

Status

Preprint

Abstract Read

~2 min

Abstract Words

Citations

N/A

Abstract

We present a polynomial-time reduction of the discrete logarithm problem in any periodic (a.k.a. torsion) semigroup (SGDLP) to the same problem in a subgroup of the same semigroup. It follows that SGDLP can be solved in polynomial time by quantum computers, and that SGDLP has subexponential algorithms whenever the classic DLP in the corresponding groups has subexponential algorithms.

Why This Paper Matters

This paper contributes to the Quantum Simulation research area in the Quantum Articles archive.
It adds a 2013 reference point for readers tracking recent quantum research.
We present a polynomial-time reduction of the discrete logarithm problem in any periodic (a.k.a.

Paper Tools

Become a member to use research tools

Sign in to open papers, visit source links, share, cite, compare, copy DOI links, request category corrections, and build your reading list.

Become a member Sign in

Show Paper arXiv Publisher Share Cite This Paper Copy URL Compare Copy DOI Add to Reading List Category Correction Request

References & Citation Signals

[1] DOI https://doi.org/arXiv:1310.7903 [2] arXiv https://arxiv.org/abs/1310.7903 [3] Publisher https://arxiv.org/abs/1310.7903

Local Citation Graph (Related-Paper Links)

External citation index: OpenAlex citation signal

Community Reactions

Quick sentiment from readers on this paper.

Score: 0

Likes: 0 Dislikes: 0

Discussion & Reviews (Moderated)

Average Rating: 0.0 / 5 (0 ratings)

No written reviews yet.