On the public citation graph

On the Power of Random Bases in Fourier Sampling: Hidden Subgroup Problem in the Heisenberg Group

0 signed · 44 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.1002/0471722154openalex-snapshot
The Probabilistic Method
inferredcites →https://doi.org/10.1007/3-540-46796-3_15openalex-snapshot
Fast Quantum Fourier Transforms for a Class of Non-abelian Groups
inferredcites →https://doi.org/10.1007/978-1-4613-0039-7openalex-snapshot
Lectures on Discrete Geometry
inferredcites →https://doi.org/10.1007/978-1-4684-9458-7openalex-snapshot
Linear Representations of Finite Groups
inferredcites →https://doi.org/10.1007/s00493-004-0009-8openalex-snapshot
Quantum Mechanical Algorithms for the Nonabelian Hidden Subgroup Problem
inferredcites →https://doi.org/10.1016/0003-4916(89)90322-9openalex-snapshot
Optimal state-determination by mutually unbiased measurements
inferredcites →https://doi.org/10.1016/j.ipl.2004.01.024openalex-snapshot
The quantum query complexity of the hidden subgroup problem is polynomial
inferredcites →https://doi.org/10.1017/cbo9781139172769openalex-snapshot
Introduction to Finite Fields and their Applications
inferredcites →https://doi.org/10.1063/1.1834400openalex-snapshot
Pseudo-Random Operators: Theory and Applications
inferredcites →https://doi.org/10.1109/sfcs.2005.38openalex-snapshot
From optimal measurement to efficient quantum algorithms for the hidden subgroup problem over semidirect product groups
inferredcites →https://doi.org/10.1109/sfcs.2005.73openalex-snapshot
The Symmetric Group Defies Strong Fourier Sampling
inferredcites →https://doi.org/10.1126/science.1090790openalex-snapshot
Pseudo-Random Unitary Operators for Quantum Information Processing
inferredcites →https://doi.org/10.1137/s009753970139450xopenalex-snapshot
The Hidden Subgroup Problem and Quantum Computation Using Group Representations
inferredcites →https://doi.org/10.1137/s0097539703436345openalex-snapshot
A Subexponential-Time Quantum Algorithm for the Dihedral Hidden Subgroup Problem
inferredcites →https://doi.org/10.1142/s0129054103001996openalex-snapshot
EFFICIENT QUANTUM ALGORITHMS FOR SOME INSTANCES OF THE NON-ABELIAN HIDDEN SUBGROUP PROBLEM
inferredcites →https://doi.org/10.1142/s0219749904000109openalex-snapshot
EXACT QUANTUM FOURIER TRANSFORMS AND DISCRETE LOGARITHM ALGORITHMS
inferredcites →https://doi.org/10.1145/780542.780544openalex-snapshot
Hidden translation and orbit coset in quantum computing
inferredcites →https://doi.org/10.26421/qic4.3-8openalex-snapshot
Quantum solution to the hidden subgroup problem for Poly-Near-Hamiltonian groups
inferredcites →https://doi.org/10.26421/qic7.8-5openalex-snapshot
For distinguishing conjugate Hidden subgroups, the pretty good measurement is as good as it gets
inferredcites →https://doi.org/10.48550/arxiv.1112.3333openalex-snapshot
Another subexponential-time quantum algorithm for the dihedral hidden subgroup problem
inferredcites →https://doi.org/10.48550/arxiv.quant-ph/0501066openalex-snapshot
The Symmetric Group Defies Strong Fourier Sampling: Part II
inferredcites →https://doi.org/10.48550/arxiv.quant-ph/9702028openalex-snapshot
Efficient Quantum Transforms
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/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-540-70918-3_50openalex-snapshot
An Efficient Quantum Algorithm for the Hidden Subgroup Problem in Extraspecial Groups
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-89994-5_7openalex-snapshot
An Efficient Quantum Algorithm for the Hidden Subgroup Problem over Weyl-Heisenberg Groups
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.1088/1751-8113/40/46/f04openalex-snapshot
Qudits of composite dimension, mutually unbiased bases and projective ring geometry
inferred← citeshttps://doi.org/10.1103/physreva.80.012304openalex-snapshot
Exact and approximate unitary 2-designs and their application to fidelity estimation
inferred← citeshttps://doi.org/10.1103/revmodphys.82.1openalex-snapshot
Quantum algorithms for algebraic problems
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/ccc.2007.26openalex-snapshot
Quantum t-designs: t-wise Independence in the Quantum World
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.22331/q-2022-03-17-668openalex-snapshot
The Pursuit of Uniqueness: Extending Valiant-Vazirani Theorem to the Probabilistic and Quantum Settings
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/qic7.8-5openalex-snapshot
For distinguishing conjugate Hidden subgroups, the pretty good measurement is as good as it gets
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.0811.0562openalex-snapshot
Fast quantum algorithms for approximating some irreducible representations of 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.quant-ph/0504067openalex-snapshot
Explicit Multiregister Measurements for Hidden Subgroup Problems
inferred← citeshttps://doi.org/10.48550/arxiv.quant-ph/0511149openalex-snapshot
Tight Results on Multiregister Fourier Sampling: Quantum Measurements for Graph Isomorphism Require Entanglement
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.