arXiv (All)
open access
Quantum Algorithms for Minimum Generating Set
In this paper, we present a polynomial-time quantum algorithm for computing a minimum-sized generating set of solvable black-box groups. Next, we consider the class $Γ_d$ of black-box groups, where every non-abelian composition factor is isomorphic to a subgroup of the symmetric group $S_d$ for a fi
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
- The fields generated by character values of linear and unitary groups#1129780
- A Restricted Boltzmann Machine with Quantum-State Visible Units#1014209
- Multi-qubit controlled gate synthesis without T-count overhead in the small-error limit#1144766
- Quantum MeanFlow: single-shot generative sampling on NISQ hardware#822580
- Optimal entanglement-assisted source coding under a balanced-difference promise#1109721
Record · ID 1154521
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