arXiv (All)
open access
Improved Quantum Algorithms for Black-Box Abelian Group Decomposition
Decomposing finite Abelian black-box groups into cyclic factors is a basic problem in quantum computation. We give a quantum algorithm for decomposing finite Abelian black-box groups by adapting the quantum sampling and classical lattice-reduction method of Regev's factoring algorithm. The algorithm
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
- Quantum Inversion of Units in Group Rings: Block Dimension, Not Commutativity, Governs Hardness#997600
- Faster Quantum Monte Carlo Simulation by Random Compilation#997362
- Practical Error Suppression and Mitigation for Reliable Quantum Computing#659023
- Practical Error Suppression and Mitigation for Reliable Quantum Computing#656887
- Adelic reduction of module lattices#1117648
Record · ID 1131322
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