On the public citation graph

For distinguishing conjugate Hidden subgroups, the pretty good measurement is as good as it gets

0 signed · 64 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.1007/11523468_113openalex-snapshot
On the Power of Random Bases in Fourier Sampling: Hidden Subgroup Problem in the Heisenberg Group
inferredcites →https://doi.org/10.1007/978-1-4612-0979-9openalex-snapshot
Representation Theory: A First Course
inferredcites →https://doi.org/10.1007/978-1-4684-9458-7openalex-snapshot
Linear Representations of Finite Groups
inferredcites →https://doi.org/10.1007/s002220050083openalex-snapshot
Upper bound on the characters of the symmetric groups
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.1080/09500349414552221openalex-snapshot
A ‘Pretty Good’ Measurement for Distinguishing Quantum States
inferredcites →https://doi.org/10.1109/sfcs.2002.1181976openalex-snapshot
Quantum computation and lattice problems
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/tit.1975.1055351openalex-snapshot
Optimum testing of multiple hypotheses in quantum detection theory
inferredcites →https://doi.org/10.1109/tit.2004.828070openalex-snapshot
Optimal Detection of Symmetric Mixed Quantum States
inferredcites →https://doi.org/10.1137/050644896openalex-snapshot
The Symmetric Group Defies Strong Fourier Sampling
inferredcites →https://doi.org/10.1137/s0097539703436345openalex-snapshot
A Subexponential-Time Quantum Algorithm for the Dihedral Hidden Subgroup Problem
inferredcites →https://doi.org/10.1145/1132516.1132603openalex-snapshot
Limitations of quantum coset states for graph isomorphism
inferredcites →https://doi.org/10.4086/cjtcs.2006.002openalex-snapshot
inferredcites →https://doi.org/10.48550/arxiv.quant-ph/0406046openalex-snapshot
The hidden subgroup problem and permutation group theory
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.5860/choice.37-6316openalex-snapshot
Fourier analysis on finite groups and applications

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/s00453-008-9231-xopenalex-snapshot
Random Measurement Bases, Quantum State Distinction and Applications to the Hidden Subgroup Problem
inferred← citeshttps://doi.org/10.1016/j.tcs.2022.04.014openalex-snapshot
Sample complexity of hidden subgroup problem
inferred← citeshttps://doi.org/10.1088/1751-8121/ae0a95openalex-snapshot
On the distinguishability of geometrically uniform quantum states
inferred← citeshttps://doi.org/10.1093/acprof:oso/9780199233212.001.0001openalex-snapshot
The Nature of Computation
inferred← citeshttps://doi.org/10.1093/acprof:oso/9780199233212.002.0003openalex-snapshot
Copyright Page
inferred← citeshttps://doi.org/10.1093/acprof:oso/9780199233212.002.0004openalex-snapshot
Dedication
inferred← citeshttps://doi.org/10.1093/acprof:oso/9780199233212.002.0006openalex-snapshot
Figure Credits
inferred← citeshttps://doi.org/10.1093/acprof:oso/9780199233212.002.0007openalex-snapshot
Preface
inferred← citeshttps://doi.org/10.1093/acprof:oso/9780199233212.003.0001openalex-snapshot
Prologue
inferred← citeshttps://doi.org/10.1093/acprof:oso/9780199233212.003.0002openalex-snapshot
The Basics
inferred← citeshttps://doi.org/10.1093/acprof:oso/9780199233212.003.0003openalex-snapshot
Insights and Algorithms
inferred← citeshttps://doi.org/10.1093/acprof:oso/9780199233212.003.0004openalex-snapshot
Needles in a Haystack: the Class NP
inferred← citeshttps://doi.org/10.1093/acprof:oso/9780199233212.003.0005openalex-snapshot
Who is the Hardest One of All? NP-Completeness
inferred← citeshttps://doi.org/10.1093/acprof:oso/9780199233212.003.0006openalex-snapshot
The Deep Question: P vs. NP
inferred← citeshttps://doi.org/10.1093/acprof:oso/9780199233212.003.0007openalex-snapshot
The Grand Unified Theory of Computation
inferred← citeshttps://doi.org/10.1093/acprof:oso/9780199233212.003.0008openalex-snapshot
Memory, Paths, and Games
inferred← citeshttps://doi.org/10.1093/acprof:oso/9780199233212.003.0009openalex-snapshot
Optimization and Approximation
inferred← citeshttps://doi.org/10.1093/acprof:oso/9780199233212.003.0010openalex-snapshot
Randomized Algorithms
inferred← citeshttps://doi.org/10.1093/acprof:oso/9780199233212.003.0011openalex-snapshot
Interaction and Pseudorandomness
inferred← citeshttps://doi.org/10.1093/acprof:oso/9780199233212.003.0012openalex-snapshot
Random Walks and Rapid Mixing
inferred← citeshttps://doi.org/10.1093/acprof:oso/9780199233212.003.0013openalex-snapshot
Counting, Sampling, and Statistical Physics
inferred← citeshttps://doi.org/10.1093/acprof:oso/9780199233212.003.0014openalex-snapshot
When Formulas Freeze: Phase Transitions in Computation
inferred← citeshttps://doi.org/10.1093/acprof:oso/9780199233212.003.0015openalex-snapshot
Quantum Computation
inferred← citeshttps://doi.org/10.1093/acprof:oso/9780199233212.005.0001openalex-snapshot
Mathematical Tools
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/physreva.79.032343openalex-snapshot
Error rates of Belavkin weighted quantum measurements and a converse to Holevo’s asymptotic optimality theorem
inferred← citeshttps://doi.org/10.1103/physreva.82.022326openalex-snapshot
Using postmeasurement information in state discrimination
inferred← citeshttps://doi.org/10.1103/physreva.92.062333openalex-snapshot
Optimal measurements for symmetric quantum states with applications to optical communication
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/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.1109/sfcs.2005.73openalex-snapshot
The Symmetric Group Defies Strong Fourier Sampling
inferred← citeshttps://doi.org/10.1137/080724101openalex-snapshot
On the Impossibility of a Quantum Sieve Algorithm for Graph Isomorphism
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.1145/1250790.1250868openalex-snapshot
On the impossibility of a quantum sieve algorithm for graph isomorphism
inferred← citeshttps://doi.org/10.1515/jmc-2022-0029openalex-snapshot
The dihedral hidden subgroup problem
inferred← citeshttps://doi.org/10.2197/ipsjdc.1.470openalex-snapshot
Dihedral Hidden Subgroup Problem: A Survey
inferred← citeshttps://doi.org/10.26421/qic14.5-6-6openalex-snapshot
An improved query for the hidden subbroup problem
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.0902.0395openalex-snapshot
Estimates of non-optimality of quantum measurements and a simple iterative method for computing optimal measurements
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.quant-ph/0501066openalex-snapshot
The Symmetric Group Defies Strong Fourier Sampling: Part II
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/0510233openalex-snapshot
Quantum Measurements for Graph Isomorphism Require Entanglement: Tight Results on Multiregister Fourier Sampling (Withdrawn)
inferred← citeshttps://doi.org/10.48550/arxiv.quant-ph/0511149openalex-snapshot
Tight Results on Multiregister Fourier Sampling: Quantum Measurements for Graph Isomorphism Require Entanglement
inferred← citeshttps://doi.org/10.48550/arxiv.quant-ph/0609138openalex-snapshot
On the Impossibility of a Quantum Sieve Algorithm for Graph Isomorphism
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.