On the public citation graph

Quantum algorithms for subset finding

https://doi.org/10.26421/qic5.7
0 signed · 26 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.1006/jcss.2000.1732openalex-snapshot
Quantum Simulations of Classical Random Walks and Undirected Graph Connectivity
inferredcites →https://doi.org/10.1103/physreva.58.915openalex-snapshot
Quantum computation and decision trees
inferredcites →https://doi.org/10.1103/physreva.70.022314openalex-snapshot
Spatial search by quantum walk
inferredcites →https://doi.org/10.1103/physrevlett.79.325openalex-snapshot
Quantum Mechanics Helps in Searching for a Needle in a Haystack
inferredcites →https://doi.org/10.1109/ccc.2001.933880openalex-snapshot
Quantum algorithms for element distinctness
inferredcites →https://doi.org/10.1109/focs.2004.54openalex-snapshot
Quantum Walk Algorithm for Element Distinctness
inferredcites →https://doi.org/10.1109/sfcs.1987.20openalex-snapshot
Distributive graph algorithms Global solutions from local data
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.1137/0221015openalex-snapshot
Locality in Distributed Graph Algorithms
inferredcites →https://doi.org/10.1137/s0097539796300933openalex-snapshot
Strengths and Weaknesses of Quantum Computing
inferredcites →https://doi.org/10.1145/380752.380757openalex-snapshot
One-dimensional quantum walks
inferredcites →https://doi.org/10.1145/509998.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.1145/780551.780552openalex-snapshot
Exponential algorithmic speedup by a quantum walk
inferredcites →https://doi.org/10.48550/arxiv.quant-ph/0310107openalex-snapshot
On the Quantum Query Complexity of Detecting Triangles in Graphs

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1016/j.cosrev.2021.100419openalex-snapshot
Quantum walk and its application domains: A systematic review
inferred← citeshttps://doi.org/10.1088/1367-2630/9/3/072openalex-snapshot
Almost uniform sampling via quantum walks
inferred← citeshttps://doi.org/10.1109/icde60146.2024.00192openalex-snapshot
Quantum Algorithms for the Maximum K-Plex Problem
inferred← citeshttps://doi.org/10.1109/tqe.2020.3045692openalex-snapshot
Finding Small and Large $k$-Clique Instances on a Quantum Computer
inferred← citeshttps://doi.org/10.22331/q-2023-07-12-1056openalex-snapshot
On Hitting Times for General Quantum Markov Processes
inferred← citeshttps://doi.org/10.48550/arxiv.1205.1534openalex-snapshot
Learning-Graph-Based Quantum Algorithm for k-distinctness
inferred← citeshttps://doi.org/10.48550/arxiv.1210.3279openalex-snapshot
On the Power of Non-Adaptive Learning Graphs
inferred← citeshttps://doi.org/10.48550/arxiv.1302.3143openalex-snapshot
Quantum Walks and Electric Networks
inferred← citeshttps://doi.org/10.48550/arxiv.quant-ph/0403127openalex-snapshot
Quantum Algorithms and Covering Spaces
inferred← citeshttps://doi.org/10.48550/arxiv.quant-ph/0509206openalex-snapshot
Quantum Algorithm for Commutativity Testing of a Matrix Set
inferred← citeshttps://doi.org/10.48550/arxiv.quant-ph/0510084openalex-snapshot
Quantum Complexity Bounds for Independent Set Problems
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.