On the public citation graph

Learning-Graph-Based Quantum Algorithm for k-Distinctness

0 signed · 81 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/(sici)1521-3978(199806)46:4/5<493::aid-prop493>3.0.co;2-popenalex-snapshot
Tight Bounds on Quantum Searching
inferredcites →https://doi.org/10.1006/jcss.2002.1826openalex-snapshot
Quantum Lower Bounds by Quantum Arguments
inferredcites →https://doi.org/10.1007/978-3-540-74240-1_22openalex-snapshot
The Quantum Query Complexity of Algebraic Properties
inferredcites →https://doi.org/10.1007/978-3-642-33090-2_18openalex-snapshot
Span Programs and Quantum Algorithms for st-Connectivity and Claw Detection
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/focs.2004.53openalex-snapshot
Quantum Speed-Up of Markov Chain Based Algorithms
inferredcites →https://doi.org/10.1137/050643684openalex-snapshot
Quantum Algorithms for the Triangle Problem
inferredcites →https://doi.org/10.1137/090745854openalex-snapshot
Search via Quantum Walk
inferredcites →https://doi.org/10.1137/1.9781611973082.44openalex-snapshot
Reflections for quantum query algorithms
inferredcites →https://doi.org/10.1137/s0097539705447311openalex-snapshot
Quantum Walk Algorithm for Element Distinctness
inferredcites →https://doi.org/10.1142/s0219749912500190openalex-snapshot
QUANTUM QUERY COMPLEXITY OF CONSTANT-SIZED SUBGRAPH CONTAINMENT
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/1109557.1109654openalex-snapshot
Quantum verification of matrix products
inferredcites →https://doi.org/10.1145/1250790.1250867openalex-snapshot
Negative weights make adversaries stronger
inferredcites →https://doi.org/10.1145/1250790.1250874openalex-snapshot
Search via quantum walk
inferredcites →https://doi.org/10.1145/2213977.2213985openalex-snapshot
Span programs for functions with constant-sized 1-certificates
inferredcites →https://doi.org/10.1145/2422436.2422474openalex-snapshot
Adversary lower bound for the k-sum problem
inferredcites →https://doi.org/10.1145/335305.335394openalex-snapshot
Quantum lower bounds by quantum arguments
inferredcites →https://doi.org/10.26421/qic5.7-7openalex-snapshot
Quantum algorithms for subset finding
inferredcites →https://doi.org/10.4086/toc.2005.v001a002openalex-snapshot
inferredcites →https://doi.org/10.4086/toc.2005.v001a003openalex-snapshot
inferredcites →https://doi.org/10.48550/arxiv.0705.1446openalex-snapshot
The Quantum Query Complexity of Algebraic Properties
inferredcites →https://doi.org/10.48550/arxiv.1108.3022openalex-snapshot
Quantum Algorithm for k-distinctness with Prior Knowledge on the Input
inferredcites →https://doi.org/10.48550/arxiv.1109.5135openalex-snapshot
A learning graph based quantum query algorithm for finding constant-size subgraphs
inferredcites →https://doi.org/10.48550/arxiv.1205.1534openalex-snapshot
Learning-Graph-Based Quantum Algorithm for k-distinctness
inferredcites →https://doi.org/10.48550/arxiv.1206.6528openalex-snapshot
Adversary Lower Bound for the k-sum 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-1-4939-2864-4_306openalex-snapshot
Quantum Algorithm for Element Distinctness
inferred← citeshttps://doi.org/10.1007/978-3-030-17659-4_7openalex-snapshot
On Finding Quantum Multi-collisions
inferred← citeshttps://doi.org/10.1007/978-3-030-25510-7_19openalex-snapshot
Improved Quantum Multicollision-Finding Algorithm
inferred← citeshttps://doi.org/10.1007/978-3-031-04613-1_6openalex-snapshot
Implications of Quantum Science on Industry 4.0: Challenges and Opportunities
inferred← citeshttps://doi.org/10.1007/978-3-319-08783-2_37openalex-snapshot
Quantum Algorithms for Finding Constant-Sized Sub-hypergraphs
inferred← citeshttps://doi.org/10.1007/978-3-319-09704-6_1openalex-snapshot
Recent Developments in Quantum Algorithms and Complexity
inferred← citeshttps://doi.org/10.1007/978-3-319-70697-9_7openalex-snapshot
Quantum Multicollision-Finding Algorithm
inferred← citeshttps://doi.org/10.1007/978-3-642-27848-8_302-2openalex-snapshot
Quantum Analogs of Markov Chains
inferred← citeshttps://doi.org/10.1007/978-3-642-27848-8_306-2openalex-snapshot
Quantum Algorithm for Element Distinctness
inferred← citeshttps://doi.org/10.1007/978-3-642-39206-1_10openalex-snapshot
Time-Efficient Quantum Walks for 3-Distinctness
inferred← citeshttps://doi.org/10.1007/978-3-662-44777-2_49openalex-snapshot
Optimal Parallel Quantum Query Algorithms
inferred← citeshttps://doi.org/10.1007/978-981-95-5018-0_17openalex-snapshot
Revisiting Time-Space Tradeoffs in Collision Search and Decision Problems
inferred← citeshttps://doi.org/10.1007/s00037-014-0084-1openalex-snapshot
On the Power of Non-adaptive Learning Graphs
inferred← citeshttps://doi.org/10.1007/s00037-015-0099-2openalex-snapshot
Quantum Algorithms for Learning Symmetric Juntas via the Adversary Bound
inferred← citeshttps://doi.org/10.1007/s00453-015-0084-9openalex-snapshot
Improved Quantum Query Algorithms for Triangle Detection and Associativity Testing
inferred← citeshttps://doi.org/10.1007/s00453-016-0206-zopenalex-snapshot
Optimal Parallel Quantum Query Algorithms
inferred← citeshttps://doi.org/10.1007/s00453-018-0527-1openalex-snapshot
Approximate Span Programs
inferred← citeshttps://doi.org/10.1007/s00453-019-00627-zopenalex-snapshot
Extended Learning Graphs for Triangle Finding
inferred← citeshttps://doi.org/10.1007/s10623-022-01008-4openalex-snapshot
On subset-resilient hash function families
inferred← citeshttps://doi.org/10.1007/s11128-018-1930-xopenalex-snapshot
Element distinctness revisited
inferred← citeshttps://doi.org/10.1007/s11128-021-03042-yopenalex-snapshot
Three-state quantum walk on the Cayley Graph of the Dihedral Group
inferred← citeshttps://doi.org/10.1016/j.tcs.2015.10.006openalex-snapshot
Quantum algorithms for finding constant-sized sub-hypergraphs
inferred← citeshttps://doi.org/10.1016/j.tcs.2020.07.039openalex-snapshot
Quantum algorithm for the multicollision problem
inferred← citeshttps://doi.org/10.1038/s41598-018-27825-zopenalex-snapshot
Quantum walks on regular uniform hypergraphs
inferred← citeshttps://doi.org/10.1109/ccc.2013.14openalex-snapshot
On the Power of Non-adaptive Learning Graphs
inferred← citeshttps://doi.org/10.1109/ccc.2014.11openalex-snapshot
Quantum Algorithms for Learning Symmetric Juntas via Adversary Bound
inferred← citeshttps://doi.org/10.1109/focs.2014.31openalex-snapshot
Improved Quantum Algorithm for Triangle Finding via Combinatorial Arguments
inferred← citeshttps://doi.org/10.1109/focs.2017.10openalex-snapshot
A Nearly Optimal Lower Bound on the Approximate Degree of AC^0
inferred← citeshttps://doi.org/10.1109/iscas45731.2020.9180793openalex-snapshot
An Overview of Quantum Algorithms: From Quantum Supremacy to Shor Factorization
inferred← citeshttps://doi.org/10.1109/ted.2018.2832118openalex-snapshot
Determining External Quantum Efficiency From Energy Conversion Efficiency for Light-Emitting Diodes
inferred← citeshttps://doi.org/10.1109/tit.2018.2883306openalex-snapshot
Quantum Query Complexity of Entropy Estimation
inferred← citeshttps://doi.org/10.1137/1.9781611973105.106openalex-snapshot
Nested Quantum Walks with Quantum Data Structures
inferred← citeshttps://doi.org/10.1137/1.9781611973105.107openalex-snapshot
Improved Quantum Query Algorithms for Triangle Finding and Associativity Testing
inferred← citeshttps://doi.org/10.1137/1.9781611975031.76openalex-snapshot
Approximating Edit Distance in Truly Subquadratic Time: Quantum and MapReduce
inferred← citeshttps://doi.org/10.1137/17m1161737openalex-snapshot
A Nearly Optimal Lower Bound on the Approximate Degree of AC$^0$
inferred← citeshttps://doi.org/10.1137/19m1278831openalex-snapshot
Algorithmic Polynomials
inferred← citeshttps://doi.org/10.1145/2422436.2422474openalex-snapshot
Adversary lower bound for the k-sum problem
inferred← citeshttps://doi.org/10.1145/3188745.3188784openalex-snapshot
The polynomial method strikes back: tight quantum query bounds via dual polynomials
inferred← citeshttps://doi.org/10.1145/3188745.3188958openalex-snapshot
Algorithmic polynomials
inferred← citeshttps://doi.org/10.1145/3444815.3444825openalex-snapshot
Guest Column
inferred← citeshttps://doi.org/10.1145/3564246.3585158openalex-snapshot
Multidimensional Quantum Walks
inferred← citeshttps://doi.org/10.1145/3723884openalex-snapshot
Quantum Divide and Conquer
inferred← citeshttps://doi.org/10.1360/n112016-00084openalex-snapshot
A survey on quantum computing
inferred← citeshttps://doi.org/10.1587/bplus.14.102openalex-snapshot
An Overview of Quantum Algorithms
inferred← citeshttps://doi.org/10.22331/q-2024-08-23-1444openalex-snapshot
Taming Quantum Time Complexity
inferred← citeshttps://doi.org/10.22331/q-2025-06-23-1777openalex-snapshot
Improved Quantum Query Upper Bounds Based on Classical Decision Trees
inferred← citeshttps://doi.org/10.22364/bjmc.2016.4.4.10openalex-snapshot
Quantum Lower Bound for Graph Collision Implies Lower Bound for Triangle Detection
inferred← citeshttps://doi.org/10.22456/2175-2745.65372openalex-snapshot
QEDS: Um Simulador Clássico para Distinção de Elementos Quântico
inferred← citeshttps://doi.org/10.26421/qic17.11-12-5openalex-snapshot
Efficient quantum algorithms for analyzing large sparse electrical networks
inferred← citeshttps://doi.org/10.4086/cjtcs.2012.010openalex-snapshot
inferred← citeshttps://doi.org/10.4086/cjtcs.2014.004openalex-snapshot
inferred← citeshttps://doi.org/10.4086/toc.2015.v011a016openalex-snapshot
inferred← citeshttps://doi.org/10.4086/toc.2020.v016a010openalex-snapshot
inferred← citeshttps://doi.org/10.48550/arxiv.1109.5135openalex-snapshot
A learning graph based quantum query algorithm for finding constant-size subgraphs
inferred← citeshttps://doi.org/10.48550/arxiv.2004.06439openalex-snapshot
The quantum query complexity of composition with a relation
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.