arXiv (All)
open access
Regev's reduction as a candidate quantum algorithm for the discrete logarithm problem in finite abelian groups
In this article, we investigate whether combining Regev's reduction with the Cheng-Wan reduction can yield an alternative quantum algorithm for the discrete logarithm problem (DLOG) in finite abelian groups. Cheng and Wan reduce DLOG over finite fields to bounded-distance decoding of low-rate Reed-S
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Projector additive group codes#821838
- Perfect Combinatorial Structures in Coding Theory and Cryptography#1069934
- Real-time decoding of quantum error correction codes using high-performance computing#429322
- Circuit Implementation of Discrete-Time Quantum Walks on Complex Networks#160823
- High-Dimensional Deterministic Secure Quantum Communication with Reed-Solomon Erasure Coding#618525
Record · ID 1155184
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive