On the public citation graph
Random Measurement Bases, Quantum State Distinction and Applications to the Hidden Subgroup Problem
0 signed · 52 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.1006/aama.2000.0699openalex-snapshot
On Quantum Algorithms for Noncommutative Hidden Subgroups
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-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/978-1-4684-9458-7_1openalex-snapshot
Generalities on linear representations
inferredcites →https://doi.org/10.1007/bf01121471openalex-snapshot
Refinement of the upper bound of the constant in the central limit theorem
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.1063/1.1459754openalex-snapshot
Reversing quantum dynamics with near-optimal quantum and classical fidelity
inferredcites →https://doi.org/10.1080/09500349414552221openalex-snapshot
A ‘Pretty Good’ Measurement for Distinguishing Quantum States
inferredcites →https://doi.org/10.1103/physreva.72.060302openalex-snapshot
Convergence conditions for random quantum circuits
inferredcites →https://doi.org/10.1109/ccc.2007.26openalex-snapshot
Quantum t-designs: t-wise Independence in the Quantum World
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.1109/tit.2004.828070openalex-snapshot
Optimal Detection of Symmetric Mixed Quantum States
inferredcites →https://doi.org/10.1111/j.1467-9574.1985.tb01137.xopenalex-snapshot
PROBABILITY THEORY AND ITS APPLICATIONS
inferredcites →https://doi.org/10.1119/1.1463744openalex-snapshot
Quantum Computation and Quantum Information
inferredcites →https://doi.org/10.1126/science.1090790openalex-snapshot
Pseudo-Random Unitary Operators for Quantum Information Processing
inferredcites →https://doi.org/10.1137/040615572openalex-snapshot
Numerical Cubature Using Error-Correcting Codes
inferredcites →https://doi.org/10.1137/s009753970139450xopenalex-snapshot
The Hidden Subgroup Problem and Quantum Computation Using Group Representations
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.1145/276698.276708openalex-snapshot
Quantum circuits with mixed states
inferredcites →https://doi.org/10.1145/380752.380808openalex-snapshot
Learning mixtures of arbitrary gaussians
inferredcites →https://doi.org/10.1145/505482.505499openalex-snapshot
Quantum computation and quantum information
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.quant-ph/0506205openalex-snapshot
Distinguishing sets of quantum states
inferredcites →https://doi.org/10.48550/arxiv.quant-ph/9901034openalex-snapshot
Hidden Subgroup States are Almost Orthogonal
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/11766247_37openalex-snapshot
Machine Learning in a Quantum World
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/978-3-642-03685-9_41openalex-snapshot
Efficient Quantum Tensor Product Expanders and k-Designs
inferred← citeshttps://doi.org/10.1007/978-3-642-22006-7_8openalex-snapshot
Limitations on Quantum Dimensionality Reduction
inferred← citeshttps://doi.org/10.1007/s00220-009-0873-6openalex-snapshot
Random Quantum Circuits are Approximate 2-designs
inferred← citeshttps://doi.org/10.1007/s00220-023-04675-zopenalex-snapshot
Approximate Unitary t-Designs by Short Random Quantum Circuits Using Nearest-Neighbor and Long-Range Gates
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/1367-2630/16/5/053043openalex-snapshot
Generating a statet-design by diagonal quantum circuits
inferred← citeshttps://doi.org/10.1088/1367-2630/aa5fdbopenalex-snapshot
Commuting quantum circuits and complexity of Ising partition functions
inferred← citeshttps://doi.org/10.1088/1367-2630/aa60edopenalex-snapshot
Direct dialling of Haar random unitary matrices
inferred← citeshttps://doi.org/10.1103/21vm-bz3topenalex-snapshot
Computational Complexity of Unitary and State Design Properties
inferred← citeshttps://doi.org/10.1103/25v1-my1xopenalex-snapshot
Non-Clifford Cost of Random Unitaries
inferred← citeshttps://doi.org/10.1103/physrevlett.106.230501openalex-snapshot
Direct Fidelity Estimation from Few Pauli Measurements
inferred← citeshttps://doi.org/10.1103/physrevlett.116.170502openalex-snapshot
Efficient Quantum Pseudorandomness
inferred← citeshttps://doi.org/10.1103/revmodphys.82.1openalex-snapshot
Quantum algorithms for algebraic problems
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/tit.2026.3678498openalex-snapshot
Pretty Good Simulation of All Quantum Measurements by Projective Measurements
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/qic8.3-4-8openalex-snapshot
Quantum measurements for hidden subgroup problems with optimal sample complexity
inferred← citeshttps://doi.org/10.26907/2541-7746.2020.3.259-268openalex-snapshot
Universal Hash Functions from Quantum Procedures
inferred← citeshttps://doi.org/10.4230/lipics.tqc.2021.3openalex-snapshot
Sample Efficient Algorithms for Learning Quantum Channels in PAC Model and the Approximate State Discrimination Problem
inferred← citeshttps://doi.org/10.48550/arxiv.1006.5227openalex-snapshot
Pseudo-randomness and Learning in Quantum Computation
inferred← citeshttps://doi.org/10.48550/arxiv.1703.01932openalex-snapshot
One-Shot Private Classical Capacity of Quantum Wiretap Channel: Based on one-shot quantum covering lemma
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.