On the public citation graph
Quantum solution to the hidden subgroup problem for Poly-Near-Hamiltonian groups
0 signed · 34 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1137/s0097539796298637openalex-snapshot
On the Power of Quantum Computation
inferredcites →https://doi.org/10.1145/258533.258548openalex-snapshot
Quantum computation of Fourier transforms over symmetric groups
inferredcites →https://doi.org/10.1145/335305.335392openalex-snapshot
Normal subgroup reconstruction and quantum computation using group representations
inferredcites →https://doi.org/10.1145/380752.380759openalex-snapshot
Quantum algorithms for solvable groups
inferredcites →https://doi.org/10.1145/380752.380769openalex-snapshot
Quantum mechanical algorithms for the nonabelian hidden subgroup problem
inferredcites →https://doi.org/10.1145/780542.780544openalex-snapshot
Hidden translation and orbit coset in quantum computing
inferredcites →https://doi.org/10.48550/arxiv.quant-ph/9901034openalex-snapshot
Hidden Subgroup States are Almost Orthogonal
inferredcites →https://doi.org/10.5555/982792.982910openalex-snapshot
Generic quantum Fourier transforms
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/11523468_113openalex-snapshot
On the Power of Random Bases in Fourier Sampling: Hidden Subgroup Problem in the Heisenberg Group
inferred← citeshttps://doi.org/10.1007/978-3-540-70918-3_51openalex-snapshot
Weak Fourier-Schur Sampling, the Hidden Subgroup Problem, and the Quantum Collision Problem
inferred← citeshttps://doi.org/10.1007/978-3-662-44465-8_20openalex-snapshot
An Efficient Quantum Algorithm for Finding Hidden Parabolic Subgroups in the General Linear Group
inferred← citeshttps://doi.org/10.1007/s11424-019-9008-0openalex-snapshot
Quantum Algorithm Design: Techniques and Applications
inferred← citeshttps://doi.org/10.1016/j.physleta.2006.06.014openalex-snapshot
Quantum algorithms for the hidden subgroup problem on some semi-direct product groups by reduction to Abelian cases
inferred← citeshttps://doi.org/10.1103/physreva.77.032335openalex-snapshot
Optimal single-copy measurement for the hidden-subgroup problem
inferred← citeshttps://doi.org/10.1103/revmodphys.82.1openalex-snapshot
Quantum algorithms for algebraic problems
inferred← citeshttps://doi.org/10.1109/icac3n56670.2022.10074591openalex-snapshot
An Efficient CL-Signature scheme over NTRU Lattices
inferred← citeshttps://doi.org/10.1109/sfcs.2005.38openalex-snapshot
From optimal measurement to efficient quantum algorithms for the hidden subgroup problem over semidirect product groups
inferred← citeshttps://doi.org/10.1145/1132516.1132603openalex-snapshot
Limitations of quantum coset states for graph isomorphism
inferred← citeshttps://doi.org/10.1145/1857914.1857918openalex-snapshot
Limitations of quantum coset states for graph isomorphism
inferred← citeshttps://doi.org/10.1145/780542.780544openalex-snapshot
Hidden translation and orbit coset in quantum computing
inferred← citeshttps://doi.org/10.26421/qic12.7-8-10openalex-snapshot
Finding hidden Borel subgroups of the general linear group
inferred← citeshttps://doi.org/10.26421/qic7.5-6openalex-snapshot
On the quantum hardness of solving isomorphism problems as nonabelian hidden shift problems
inferred← citeshttps://doi.org/10.26421/qic7.5-6-6openalex-snapshot
On the quantum hardness of solving isomorphism problems as nonabelian hidden shift problems
inferred← citeshttps://doi.org/10.26421/qic7.5-6-9openalex-snapshot
Efficient quantum algorithms for the hidden subgroup problem over semi-direct product groups
inferred← citeshttps://doi.org/10.26421/qic8.3-4-8openalex-snapshot
Quantum measurements for hidden subgroup problems with optimal sample complexity
inferred← citeshttps://doi.org/10.26421/qic8.5-6openalex-snapshot
How a Clebsch-Gordan transform helps to solve the Heisenberg hidden subgroup problem
inferred← citeshttps://doi.org/10.48550/arxiv.0808.0174openalex-snapshot
Simon's Algorithm, Clebsch-Gordan Sieves, and Hidden Symmetries of Multiple Squares
inferred← citeshttps://doi.org/10.48550/arxiv.0809.2307openalex-snapshot
Quantum Computation Beyond the Circuit Model
inferred← citeshttps://doi.org/10.48550/arxiv.1509.05806openalex-snapshot
Abelian Hypergroups and Quantum Computation
inferred← citeshttps://doi.org/10.48550/arxiv.1611.09274openalex-snapshot
Normalizer Circuits and Quantum Computation
inferred← citeshttps://doi.org/10.48550/arxiv.quant-ph/0411037openalex-snapshot
The Hidden Subgroup Problem - Review and Open Problems
inferred← citeshttps://doi.org/10.48550/arxiv.quant-ph/0507190openalex-snapshot
Quantum algorithm for a generalized hidden shift problem
inferred← citeshttps://doi.org/10.5753/etc.2025.9189openalex-snapshot
Quantum Coset Multiplication and the Hidden Subgroup Problem in Dihedral Groups Dp
inferred← citeshttps://doi.org/10.5772/intechopen.102478openalex-snapshot
Introductory Chapter: Quantum Computing and Communications
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.