On the public citation graph
Symmetry-Assisted Adversaries for Quantum State Generation
0 signed · 73 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.1007/3-540-48224-5_29openalex-snapshot
Quantum Complexities of Ordered Searching, Sorting, and Element Distinctness
inferredcites →https://doi.org/10.1007/978-1-4612-0333-9openalex-snapshot
The Graph Isomorphism Problem
inferredcites →https://doi.org/10.1007/978-1-4757-6804-6_2openalex-snapshot
Representations of the Symmetric Group
inferredcites →https://doi.org/10.1007/978-1-4939-2864-4_304openalex-snapshot
Quantum Algorithm for the Collision Problem
inferredcites →https://doi.org/10.1007/978-3-540-27836-8_83openalex-snapshot
A Polynomial Quantum Query Lower Bound for the Set Equality Problem
inferredcites →https://doi.org/10.1007/s00453-002-0976-3openalex-snapshot
Quantum Complexities of Ordered Searching, Sorting, and Element Distinctness
inferredcites →https://doi.org/10.1007/s00453-007-9022-9openalex-snapshot
A New Quantum Lower Bound Method, with Applications to Direct Product Theorems and Time-Space Tradeoffs
inferredcites →https://doi.org/10.1016/j.jcss.2004.02.002openalex-snapshot
A lower bound on the quantum query complexity of read-once functions
inferredcites →https://doi.org/10.1016/j.jcss.2005.06.006openalex-snapshot
Polynomial degree vs. quantum query complexity
inferredcites →https://doi.org/10.1109/ccc.2008.9openalex-snapshot
The Multiplicative Quantum Adversary
inferredcites →https://doi.org/10.1109/focs.2009.55openalex-snapshot
Span Programs and Quantum Query Complexity: The General Adversary Bound Is Nearly Tight for Every Boolean Function
inferredcites →https://doi.org/10.1109/sfcs.1998.743485openalex-snapshot
Quantum lower bounds by polynomials
inferredcites →https://doi.org/10.1109/sfcs.2002.1181975openalex-snapshot
Quantum lower bounds for the collision and the element distinctness problems
inferredcites →https://doi.org/10.1109/sfcs.2003.1238197openalex-snapshot
Polynomial degree vs. quantum query complexity
inferredcites →https://doi.org/10.1137/05063235xopenalex-snapshot
Quantum and Classical Strong Direct Product Theorems and Optimal Time‐Space Tradeoffs
inferredcites →https://doi.org/10.1137/050639090openalex-snapshot
Lower Bounds for Randomized and Quantum Query Complexity Using Kolmogorov Arguments
inferredcites →https://doi.org/10.1137/110842661openalex-snapshot
Strong Direct Product Theorems for Quantum Communication and Query Complexity
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/s0097539796300933openalex-snapshot
Strengths and Weaknesses of Quantum Computing
inferredcites →https://doi.org/10.1145/1132516.1132603openalex-snapshot
Limitations of quantum coset states for graph isomorphism
inferredcites →https://doi.org/10.1145/1250790.1250867openalex-snapshot
Negative weights make adversaries stronger
inferredcites →https://doi.org/10.1145/237814.237866openalex-snapshot
A fast quantum mechanical algorithm for database search
inferredcites →https://doi.org/10.1145/261342.261346openalex-snapshot
Quantum cryptanalysis of hash and claw-free functions
inferredcites →https://doi.org/10.1145/335305.335394openalex-snapshot
Quantum lower bounds by quantum arguments
inferredcites →https://doi.org/10.1145/509907.509999openalex-snapshot
Quantum lower bound for the collision problem
inferredcites →https://doi.org/10.1145/780542.780546openalex-snapshot
Adiabatic quantum state generation and statistical zero knowledge
inferredcites →https://doi.org/10.48550/arxiv.quant-ph/0508200openalex-snapshot
A new quantum lower bound method, with an application to strong direct product theorem for quantum search
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-3-030-17656-3_26openalex-snapshot
Misuse Attacks on Post-quantum Cryptosystems
inferred← citeshttps://doi.org/10.1007/978-3-031-68391-6_7openalex-snapshot
Quantum One-Wayness of the Single-Round Sponge with Invertible Permutations
inferred← citeshttps://doi.org/10.1007/978-3-642-31594-7_47openalex-snapshot
Quantum Adversary (Upper) Bound
inferred← citeshttps://doi.org/10.1007/978-3-642-31653-1_3openalex-snapshot
Recovering Strings in Oracles: Quantum and Classic
inferred← citeshttps://doi.org/10.1007/978-981-96-0947-5_2openalex-snapshot
Quantum Money from Class Group Actions on Elliptic Curves
inferred← citeshttps://doi.org/10.1007/s00037-012-0043-7openalex-snapshot
Improved direct product theorems for randomized query complexity
inferred← citeshttps://doi.org/10.1007/s00037-013-0066-8openalex-snapshot
A strong direct product theorem for quantum query complexity
inferred← citeshttps://doi.org/10.1007/s00037-025-00282-7openalex-snapshot
Tight Quantum Lower Bound for Approximate Counting with Quantum States
inferred← citeshttps://doi.org/10.1016/j.tcs.2012.05.039openalex-snapshot
Quantum counterfeit coin problems
inferred← citeshttps://doi.org/10.1016/j.tcs.2020.11.013openalex-snapshot
Being a permutation is also orthogonal to one-wayness in quantum world: Impossibilities of quantum one-way permutations from one-wayness primitives
inferred← citeshttps://doi.org/10.1017/fms.2017.2openalex-snapshot
EXPONENTIAL IMPROVEMENT IN PRECISION FOR SIMULATING SPARSE HAMILTONIANS
inferred← citeshttps://doi.org/10.1109/ccc.2012.17openalex-snapshot
A Strong Direct Product Theorem for Quantum Query Complexity
inferred← citeshttps://doi.org/10.1109/focs.2011.75openalex-snapshot
Quantum Query Complexity of State Conversion
inferred← citeshttps://doi.org/10.1109/focs.2014.57openalex-snapshot
Quantum Attacks on Classical Proof Systems: The Hardness of Quantum Rewinding
inferred← citeshttps://doi.org/10.1109/focs.2015.54openalex-snapshot
Hamiltonian Simulation with Nearly Optimal Dependence on all Parameters
inferred← citeshttps://doi.org/10.1109/tit.2020.3005544openalex-snapshot
On the Algebraic Combinatorics of Injections and its Applications to Injection Codes
inferred← citeshttps://doi.org/10.1137/100792640openalex-snapshot
Span Programs are Equivalent to Quantum Query Algorithms
inferred← citeshttps://doi.org/10.1137/20m1344202openalex-snapshot
Quantum Hardness of Learning Shallow Classical Circuits
inferred← citeshttps://doi.org/10.1145/2213977.2213983openalex-snapshot
Quantum money from hidden subspaces
inferred← citeshttps://doi.org/10.1145/2591796.2591854openalex-snapshot
Exponential improvement in precision for simulating sparse Hamiltonians
inferred← citeshttps://doi.org/10.1145/3694906.3743335openalex-snapshot
Optimal quantum sampling on distributed databases
inferred← citeshttps://doi.org/10.22331/q-2020-03-02-241openalex-snapshot
Quantum Speedup Based on Classical Decision Trees
inferred← citeshttps://doi.org/10.22331/q-2021-10-07-560openalex-snapshot
The Quantum Supremacy Tsirelson Inequality
inferred← citeshttps://doi.org/10.22331/q-2026-03-13-2025openalex-snapshot
An adversary bound for quantum signal processing
inferred← citeshttps://doi.org/10.22331/q-2026-03-23-2039openalex-snapshot
Space-Efficient Quantum Error Reduction without log Factors
inferred← citeshttps://doi.org/10.26421/qic18.3-4-2openalex-snapshot
Adversary lower bounds for the collision and the set equality problems
inferred← citeshttps://doi.org/10.26421/qic19.3-4openalex-snapshot
Quantum fast-forwarding: Markov chains and graph property testing
inferred← citeshttps://doi.org/10.4230/lipics.mfcs.2018.22openalex-snapshot
Quantum vs Classical Proofs and Subset Verification
inferred← citeshttps://doi.org/10.48550/arxiv.1203.4740openalex-snapshot
Quantum Money from Hidden Subspaces
inferred← citeshttps://doi.org/10.48550/arxiv.1308.6067openalex-snapshot
Sealed States And Quantum Blackmail
inferred← citeshttps://doi.org/10.48550/arxiv.1401.3826openalex-snapshot
Adversary Lower Bound for Element Distinctness with Small Range
inferred← citeshttps://doi.org/10.48550/arxiv.1402.3858openalex-snapshot
Applications of the Adversary Method in Quantum Query Algorithms
inferred← citeshttps://doi.org/10.48550/arxiv.1404.6898openalex-snapshot
Quantum Attacks on Classical Proof Systems - The Hardness of Quantum Rewinding
inferred← citeshttps://doi.org/10.48550/arxiv.1504.06943openalex-snapshot
Variations on Quantum Adversary
inferred← citeshttps://doi.org/10.70675/43dbb94ez355ez42d2za9e8z47c1e9983ab9openalex-snapshot
Quantum algorithms for the Monte Carlo method
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.