On the public citation graph

All Quantum Adversary Methods Are Equivalent

0 signed · 53 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/rsa.3240060108openalex-snapshot
On the Monte carlo boolean decision tree complexity of read‐once formulae
inferredcites →https://doi.org/10.1006/jcss.2002.1826openalex-snapshot
Quantum Lower Bounds by Quantum Arguments
inferredcites →https://doi.org/10.1007/0-387-22444-0_6openalex-snapshot
Semidefinite Programs and Combinatorial Optimization
inferredcites →https://doi.org/10.1007/3-540-45061-0_25openalex-snapshot
Quantum Search on Bounded-Error Inputs
inferredcites →https://doi.org/10.1007/978-1-4757-2606-0openalex-snapshot
An Introduction to Kolmogorov Complexity and Its Applications
inferredcites →https://doi.org/10.1007/978-3-030-11298-1openalex-snapshot
An Introduction to Kolmogorov Complexity and Its Applications
inferredcites →https://doi.org/10.1007/978-3-540-27836-8_102openalex-snapshot
On the Power of Ambainis’s Lower Bounds
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.1016/0024-3795(90)90403-yopenalex-snapshot
The spectral norm of a nonnegative matrix
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.1016/j.tcs.2005.01.019openalex-snapshot
On the power of Ambainis lower bounds
inferredcites →https://doi.org/10.1016/s0304-3975(01)00144-xopenalex-snapshot
Complexity measures and decision tree complexity: a survey
inferredcites →https://doi.org/10.1109/ccc.2003.1214419openalex-snapshot
Quantum query complexity and semi-definite programming
inferredcites →https://doi.org/10.1109/ccc.2004.1313852openalex-snapshot
Lower bounds for randomized and quantum query complexity using Kolmogorov arguments
inferredcites →https://doi.org/10.1109/ccc.2005.29openalex-snapshot
The Quantum Adversary Method and Classical Formula Size Lower Bounds
inferredcites →https://doi.org/10.1109/focs.2004.54openalex-snapshot
Quantum Walk Algorithm for Element Distinctness
inferredcites →https://doi.org/10.1109/sfcs.1986.44openalex-snapshot
Probabilistic Boolean decision trees and the complexity of evaluating game trees
inferredcites →https://doi.org/10.1109/sfcs.2003.1238197openalex-snapshot
Polynomial degree vs. quantum query complexity
inferredcites →https://doi.org/10.1119/1.1463744openalex-snapshot
Quantum Computation and Quantum Information
inferredcites →https://doi.org/10.1137/s0097539796300933openalex-snapshot
Strengths and Weaknesses of Quantum Computing
inferredcites →https://doi.org/10.1145/1008731.1008735openalex-snapshot
Quantum lower bounds for the collision and the element distinctness problems
inferredcites →https://doi.org/10.1145/237814.237866openalex-snapshot
A fast quantum mechanical algorithm for database search
inferredcites →https://doi.org/10.1145/262301.1040343openalex-snapshot
Book Review: An introduction to Kolmogorov Complexity and its Applications Second Edition, 1997 by Ming Li and Paul Vitanyi (Springer (Graduate Text Series))
inferredcites →https://doi.org/10.1145/502090.502097openalex-snapshot
Quantum lower bounds by polynomials
inferredcites →https://doi.org/10.1145/505482.505499openalex-snapshot
Quantum computation and quantum information
inferredcites →https://doi.org/10.4086/toc.2005.v001a003openalex-snapshot
inferredcites →https://doi.org/10.48550/arxiv.quant-ph/0310107openalex-snapshot
On the Quantum Query Complexity of Detecting Triangles in Graphs
inferredcites →https://doi.org/10.48550/arxiv.quant-ph/0509153openalex-snapshot
Lower Bounds on Quantum Query Complexity
inferredcites →https://doi.org/10.5555/1070432.1070591openalex-snapshot
Quantum algorithms for the triangle problem

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-540-69937-8_20openalex-snapshot
Adversary Lower Bounds for Nonadaptive Quantum Algorithms
inferred← citeshttps://doi.org/10.1007/978-3-642-33090-2_30openalex-snapshot
The Quantum Query Complexity of Read-Many Formulas
inferred← citeshttps://doi.org/10.1007/s00037-006-0212-7openalex-snapshot
THE QUANTUM ADVERSARY METHOD AND CLASSICAL FORMULA SIZE LOWER BOUNDS
inferred← citeshttps://doi.org/10.1007/s00453-009-9289-0openalex-snapshot
Quantum Separation of Local Search and Fixed Point Computation
inferred← citeshttps://doi.org/10.1016/j.jcss.2005.06.006openalex-snapshot
Polynomial degree vs. quantum query complexity
inferred← citeshttps://doi.org/10.1016/j.jcss.2009.10.007openalex-snapshot
Adversary lower bounds for nonadaptive quantum algorithms
inferred← citeshttps://doi.org/10.1016/j.tcs.2005.01.019openalex-snapshot
On the power of Ambainis lower bounds
inferred← citeshttps://doi.org/10.1016/j.tcs.2012.05.039openalex-snapshot
Quantum counterfeit coin problems
inferred← citeshttps://doi.org/10.1109/ccc.2005.29openalex-snapshot
The Quantum Adversary Method and Classical Formula Size Lower Bounds
inferred← citeshttps://doi.org/10.1145/1132516.1132605openalex-snapshot
New upper and lower bounds for randomized and quantum local search
inferred← citeshttps://doi.org/10.1145/1250790.1250867openalex-snapshot
Negative weights make adversaries stronger
inferred← citeshttps://doi.org/10.1145/1374376.1374394openalex-snapshot
Span-program-based quantum algorithm for evaluating formulas
inferred← citeshttps://doi.org/10.2197/ipsjdc.1.415openalex-snapshot
General Bounds for Quantum Biased Oracles
inferred← citeshttps://doi.org/10.22331/q-2021-11-24-587openalex-snapshot
Two new results about quantum exact learning
inferred← citeshttps://doi.org/10.22331/q-2026-03-13-2025openalex-snapshot
An adversary bound for quantum signal processing
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.4086/cjtcs.2014.004openalex-snapshot
inferred← citeshttps://doi.org/10.4086/cjtcs.2016.008openalex-snapshot
inferred← citeshttps://doi.org/10.4086/toc.2010.v006a001openalex-snapshot
inferred← citeshttps://doi.org/10.4086/toc.2012.v008a013openalex-snapshot
inferred← citeshttps://doi.org/10.48550/arxiv.1311.6777openalex-snapshot
Quantum Algorithms for Learning Symmetric Juntas via the Adversary Bound
inferred← citeshttps://doi.org/10.48550/arxiv.quant-ph/0504085openalex-snapshot
(Almost) tight bounds for randomized and quantum Local Search on hypercubes and grids
inferred← citeshttps://doi.org/10.5555/1070432.1070591openalex-snapshot
Quantum algorithms for the triangle problem
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.