The power of oracle access: Optimal sample and query complexity of the abelian state hidden subgroup problem
quant-ph
Submitted: 2026-09-28
Updated: 2026-09-28
Terminology
Sources
- Quantum lower bounds by quantum arguments
- The Grand Challenge of Quantum Applications
- Compiling Quantum Regular Language States
- Variations on Quantum Adversary
- The state hidden subgroup problem and an efficient algorithm for locating unentanglement
- Quantum Amplitude Amplification and Estimation
- Quantum algorithm for a generalized hidden shift problem
- Demonstrating dynamic surface codes
- Mind the gaps: The fraught road to quantum advantage
- Quantum state isomorphism problems for groups
- Random purification channel made simple
- Efficient Learning of Structured Quantum Circuits via Pauli Dimensionality and Sparsity
- Quantum measurements and the Abelian Stabilizer Problem
- Learning T-conjugated stabilizers: The multiple-squares dihedral StateHSP
- Are controlled unitaries helpful?
Related papers
- Reconquering Bell sampling on qudits: stabilizer learning and testing, quantum pseudorandomness bounds, and more
- Encrypted clones can leak: Classification of informative subsets in Quantum Encrypted Cloning
- Polynomial-time classical and quantum simulation of quantum impurity models
- Theory of quantum-enhanced interferometry with general Markovian light sources
- A convergent hierarchy of spectral gap certificates for qubit Hamiltonians
- Universal Bound and Phase Transition in Many-Body Fermionic Non-Gaussianity