On the public citation graph

On Quantum Algorithms for Noncommutative Hidden Subgroups

0 signed · 101 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.
Claim with ORCID
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.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1016/s0304-3975(96)00188-0openalex-snapshot
Testing shift-equivalence of polynomials by deterministic, probabilistic and quantum machines
inferredcites →https://doi.org/10.1080/01621459.1963.10500830openalex-snapshot
Probability Inequalities for Sums of Bounded Random Variables
inferredcites →https://doi.org/10.1098/rspa.1998.0163openalex-snapshot
Quantum algorithms and the Fourier transform
inferredcites →https://doi.org/10.1137/s0097539795293172openalex-snapshot
Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
inferredcites →https://doi.org/10.1137/s0097539796298637openalex-snapshot
On the Power of Quantum Computation

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1002/qute.202300269openalex-snapshot
Computationally Secure Semi‐Quantum All‐Or‐Nothing Oblivious Transfer from Dihedral Coset States
inferred← citeshttps://doi.org/10.1007/11426639_16openalex-snapshot
Computational Indistinguishability Between Quantum States and Its Cryptographic Application
inferred← citeshttps://doi.org/10.1007/978-0-387-30440-3_423openalex-snapshot
Quantum Algorithms
inferred← citeshttps://doi.org/10.1007/978-1-4614-1800-9_144openalex-snapshot
Quantum Algorithms
inferred← citeshttps://doi.org/10.1007/978-3-031-31368-4_15openalex-snapshot
Generic Models for Group Actions
inferred← citeshttps://doi.org/10.1007/978-3-031-68391-6_1openalex-snapshot
Quantum Complexity for Discrete Logarithms and Related Problems
inferred← citeshttps://doi.org/10.1007/978-3-031-95130-5_7openalex-snapshot
Quantum Algorithm for a Special Case of the Dihedral Hidden Subgroup Problem
inferred← citeshttps://doi.org/10.1007/978-3-032-01878-6_15openalex-snapshot
Quantum State Group Actions
inferred← citeshttps://doi.org/10.1007/978-3-032-10775-6_4openalex-snapshot
Key Quantum Algorithms: Shor’s, Grover’s, and Applications
inferred← citeshttps://doi.org/10.1007/978-3-540-45138-9_36openalex-snapshot
Quantum Testers for Hidden Group Properties
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-540-79228-4_6openalex-snapshot
On the Complexity of the Hidden Subgroup Problem
inferred← citeshttps://doi.org/10.1007/978-3-642-10698-9_1openalex-snapshot
Solutions to the Hidden Subgroup Problem on Some Metacyclic Groups
inferred← citeshttps://doi.org/10.1007/978-981-99-8727-6_4openalex-snapshot
Hidden Stabilizers, the Isogeny to Endomorphism Ring Problem and the Cryptanalysis of pSIDH
inferred← citeshttps://doi.org/10.1007/s00145-011-9103-4openalex-snapshot
Computational Indistinguishability Between Quantum States and Its Cryptographic Application
inferred← citeshttps://doi.org/10.1007/s00450-006-0008-7openalex-snapshot
Quantum algorithms: A survey of some recent results
inferred← citeshttps://doi.org/10.1007/s00453-008-9231-xopenalex-snapshot
Random Measurement Bases, Quantum State Distinction and Applications to the Hidden Subgroup Problem
inferred← citeshttps://doi.org/10.1007/s10701-006-9060-1openalex-snapshot
Quantum Mechanics on Finite Groups
inferred← citeshttps://doi.org/10.1007/s10773-014-2109-6openalex-snapshot
The Independence of Reduced Subgroup-State
inferred← citeshttps://doi.org/10.1007/s11128-007-0066-1openalex-snapshot
Is Grover’s Algorithm a Quantum Hidden Subgroup Algorithm?
inferred← citeshttps://doi.org/10.1007/s11128-020-02673-xopenalex-snapshot
Quantum algorithms for typical hard problems: a perspective of cryptanalysis
inferred← citeshttps://doi.org/10.1007/s11128-021-03290-yopenalex-snapshot
Quantum algorithm based on the $$\varepsilon $$-random linear disequations for the continuous hidden shift problem
inferred← citeshttps://doi.org/10.1007/s11128-022-03592-9openalex-snapshot
Leveraging the hardness of dihedral coset problem for quantum cryptography
inferred← citeshttps://doi.org/10.1007/s11128-024-04387-wopenalex-snapshot
Post-quantum $$\kappa $$-to-1 trapdoor claw-free functions from extrapolated dihedral cosets
inferred← citeshttps://doi.org/10.1007/s11128-026-05145-wopenalex-snapshot
Improvements to the DHSP quantum solving algorithm
inferred← citeshttps://doi.org/10.1007/s11424-019-9008-0openalex-snapshot
Quantum Algorithm Design: Techniques and Applications
inferred← citeshttps://doi.org/10.1016/j.ipl.2004.01.024openalex-snapshot
The quantum query complexity of the hidden subgroup problem is polynomial
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.1038/s41534-024-00865-2openalex-snapshot
Information compression via hidden subgroup quantum autoencoders
inferred← citeshttps://doi.org/10.1088/1751-8113/40/28/s07openalex-snapshot
Optimal phase estimation in quantum networks
inferred← citeshttps://doi.org/10.1103/physreva.106.012430openalex-snapshot
Quantum computation capability verification protocol for noisy intermediate-scale quantum devices with the dihedral coset problem
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/ccc.2003.1214420openalex-snapshot
On statistical query sampling and NMR quantum computing
inferred← citeshttps://doi.org/10.1109/ccc.2006.37openalex-snapshot
Random Measurement Bases, Quantum State Distinction and Applications to the Hidden Subgroup Problem
inferred← citeshttps://doi.org/10.1109/focs.2007.18openalex-snapshot
Quantum Algorithms for Hidden Nonlinear Structures
inferred← citeshttps://doi.org/10.1109/icqnm.2010.23openalex-snapshot
The Hidden Subgroup Problem for Generalized Quaternions
inferred← citeshttps://doi.org/10.1109/mbits.2023.3275885openalex-snapshot
Shaping Postquantum Cryptography: The Hidden Subgroup and Shift Problems
inferred← citeshttps://doi.org/10.1109/sfcs.2002.1181976openalex-snapshot
Quantum computation and lattice problems
inferred← citeshttps://doi.org/10.1109/sfcs.2003.1238195openalex-snapshot
A lattice problem in quantum NP
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.1112/s1461157000001182openalex-snapshot
Extending the Promise of the Deutsch–Jozsa–Høyer Algorithm for Finite Groups
inferred← citeshttps://doi.org/10.1137/050644896openalex-snapshot
The Symmetric Group Defies Strong Fourier Sampling
inferred← citeshttps://doi.org/10.1137/130907203openalex-snapshot
Hidden Translation and Translating Coset in Quantum Computing
inferred← citeshttps://doi.org/10.1137/s009753970139450xopenalex-snapshot
The Hidden Subgroup Problem and Quantum Computation Using Group Representations
inferred← citeshttps://doi.org/10.1137/s009753970343141xopenalex-snapshot
Quantum Algorithms for Some Hidden Shift Problems
inferred← citeshttps://doi.org/10.1137/s0097539703436345openalex-snapshot
A Subexponential-Time Quantum Algorithm for the Dihedral Hidden Subgroup Problem
inferred← citeshttps://doi.org/10.1137/s0097539703440678openalex-snapshot
Quantum Computation and Lattice Problems
inferred← citeshttps://doi.org/10.1137/s0097539705447177openalex-snapshot
The Power of Strong Fourier Sampling: Quantum Algorithms for Affine Groups and Hidden Shifts
inferred← citeshttps://doi.org/10.1142/9789814425988_0003openalex-snapshot
QUANTUM ALGORITHMS FOR PROBLEMS IN NUMBER THEORY, ALGEBRAIC GEOMETRY, AND GROUP THEORY
inferred← citeshttps://doi.org/10.1142/s0129054113500305openalex-snapshot
ON THE COMPLEXITY OF THE HIDDEN SUBGROUP PROBLEM
inferred← citeshttps://doi.org/10.1145/1039488.1039490openalex-snapshot
New lattice-based cryptographic constructions
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/335305.335392openalex-snapshot
Normal subgroup reconstruction and quantum computation using group representations
inferred← citeshttps://doi.org/10.1145/380752.380769openalex-snapshot
Quantum mechanical algorithms for the nonabelian hidden subgroup problem
inferred← citeshttps://doi.org/10.1145/509907.509999openalex-snapshot
Quantum lower bound for the collision problem
inferred← citeshttps://doi.org/10.1145/509998.509999openalex-snapshot
Quantum lower bound for the collision problem
inferred← citeshttps://doi.org/10.1145/780542.780544openalex-snapshot
Hidden translation and orbit coset in quantum computing
inferred← citeshttps://doi.org/10.1145/780542.780603openalex-snapshot
New lattice based cryptographic constructions
inferred← citeshttps://doi.org/10.1515/jmc-2022-0029openalex-snapshot
The dihedral hidden subgroup problem
inferred← citeshttps://doi.org/10.20944/preprints202205.0112.v1openalex-snapshot
Fermat’s Last Theorem Proved in Hilbert Arithmetic. II. Its Proof in Hilbert Arithmetic by the Kochen-Specker Theorem With or Without Induction
inferred← citeshttps://doi.org/10.2139/ssrn.5083035openalex-snapshot
The GOOGLE and XPRIZE award for how to use quantum computers practically: The problem of the "P" versus "NP" outputs of any quantum computer and the pathway for its resolving
inferred← citeshttps://doi.org/10.2197/ipsjdc.1.470openalex-snapshot
Dihedral Hidden Subgroup Problem: A Survey
inferred← citeshttps://doi.org/10.26421/qic13.3-4-4openalex-snapshot
Reduction from non-injective hidden shift problem to injective hidden shift problem
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/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.26421/qic8.6-7-2openalex-snapshot
On solving systems of random linear disequations
inferred← citeshttps://doi.org/10.4086/cjtcs.2006.002openalex-snapshot
inferred← citeshttps://doi.org/10.4171/ggd/24openalex-snapshot
Permutation groups, minimal degrees and quantum computing
inferred← citeshttps://doi.org/10.4230/lipics.itcs.2020.86openalex-snapshot
Efficient Quantum Algorithms for Shifted Quadratic Character Problems
inferred← citeshttps://doi.org/10.4230/lipics.stacs.2010.2484openalex-snapshot
An Efficient Quantum Algorithm for Some Instances of the Group Isomorphism Problem
inferred← citeshttps://doi.org/10.4230/lipics.tqc.2013.50openalex-snapshot
Easy and Hard Functions for the Boolean Hidden Shift Problem
inferred← citeshttps://doi.org/10.4230/lipics.tqc.2016.8openalex-snapshot
Quantum Algorithms for Abelian Difference Sets and Applications to Dihedral Hidden Subgroups
inferred← citeshttps://doi.org/10.48550/arxiv.0808.1546openalex-snapshot
The Study of Entangled States in Quantum Computation and Quantum Information Science
inferred← citeshttps://doi.org/10.48550/arxiv.1101.1053openalex-snapshot
An Improved Query for the Hidden Subgroup Problem
inferred← citeshttps://doi.org/10.48550/arxiv.1104.1361openalex-snapshot
Solution to the Hidden Subgroup Problem for a Class of Noncommutative Groups
inferred← citeshttps://doi.org/10.48550/arxiv.1705.00760openalex-snapshot
Quantum Fourier Sampling is Guaranteed to Fail to Compute Automorphism Groups of Easy Graphs
inferred← citeshttps://doi.org/10.48550/arxiv.1806.09660openalex-snapshot
On learning linear functions from subset and its applications in quantum computing
inferred← citeshttps://doi.org/10.48550/arxiv.2102.04171openalex-snapshot
A new quantum algorithm for the hidden shift problem in $\mathbb{Z}_{2^t}^n$
inferred← citeshttps://doi.org/10.48550/arxiv.cs/0304005openalex-snapshot
Quantum Computation and Lattice Problems
inferred← citeshttps://doi.org/10.48550/arxiv.cs/0610086openalex-snapshot
The central nature of the Hidden Subgroup problem
inferred← citeshttps://doi.org/10.48550/arxiv.quant-ph/0102014openalex-snapshot
Efficient quantum algorithms for some instances of the non-Abelian hidden subgroup problem
inferred← citeshttps://doi.org/10.48550/arxiv.quant-ph/0403069openalex-snapshot
Computational Indistinguishability between Quantum States and Its Cryptographic Application
inferred← citeshttps://doi.org/10.48550/arxiv.quant-ph/0404061openalex-snapshot
Classical Cryptosystems In A Quantum Setting
inferred← citeshttps://doi.org/10.48550/arxiv.quant-ph/0406046openalex-snapshot
The hidden subgroup problem and permutation group theory
inferred← citeshttps://doi.org/10.48550/arxiv.quant-ph/0406151openalex-snapshot
A Subexponential Time Algorithm for the Dihedral Hidden Subgroup Problem with Polynomial Space
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/0412067openalex-snapshot
Extending the Promise of the Deutsch--Jozsa--Hoyer Algorithm for Finite Groups
inferred← citeshttps://doi.org/10.48550/arxiv.quant-ph/0412143openalex-snapshot
Limits on Efficient Computation in the Physical World
inferred← citeshttps://doi.org/10.48550/arxiv.quant-ph/0511148openalex-snapshot
Limitations of Quantum Coset States for Graph Isomorphism
inferred← citeshttps://doi.org/10.48550/arxiv.quant-ph/0609220openalex-snapshot
Hidden Subhypergroup Problem
inferred← citeshttps://doi.org/10.48550/arxiv.quant-ph/9901029openalex-snapshot
A Quantum Observable for the Graph Isomorphism Problem
inferred← citeshttps://doi.org/10.48550/arxiv.quant-ph/9901034openalex-snapshot
Hidden Subgroup States are Almost Orthogonal
inferred← citeshttps://doi.org/10.5772/16185openalex-snapshot
Fourier Transform on Group-Like Structures and Applications
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.