arXiv (All)
open access
A Fourier-Label Information-Loss Barrier for Dihedral Coset Algorithms
We establish a no-go theorem for a broad class of quantum algorithms for the dihedral coset problem (DCP). We consider the Fourier-sampling and subset-sum-measurement template proposed by Regev (SIAM Journal on Computing, 2004), which is one of the main approaches to solving DCP. Suppose that, after
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
- A Fourier-Label Information-Loss Barrier for Dihedral Coset Algorithms#1136753
- G_q-concurrence and entanglement constraints in multiqubit systems#1062745
- Constrained minimax approximation for quantum signal processing#818979
- Constrained minimax approximation for quantum signal processing#808987
- Predicting Multipartite Entanglement in Quantum Circuits using Transformer#784765
Record · ID 1154331
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