On the public citation graph

Quantum algorithms for subset finding

0 signed · 35 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 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-031-99850-8_11openalex-snapshot
Quantum Generic Attacks on Feistel Schemes
inferred← citeshttps://doi.org/10.1007/978-3-540-69365-9_7openalex-snapshot
Quantum Walks
inferred← citeshttps://doi.org/10.1007/978-3-540-74456-6_48openalex-snapshot
An Improved Claw Finding Algorithm Using Quantum Walk
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/s00220-009-0930-1openalex-snapshot
On the Relationship Between Continuous- and Discrete-Time Quantum Walk
inferred← citeshttps://doi.org/10.1007/s11128-018-1930-xopenalex-snapshot
Element distinctness revisited
inferred← citeshttps://doi.org/10.1007/s11128-021-03346-zopenalex-snapshot
The effect of quantum noise on algorithmic perfect quantum state transfer on NISQ processors
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.1016/j.ic.2025.105295openalex-snapshot
Derandomization of quantum algorithm for triangle finding
inferred← citeshttps://doi.org/10.1016/j.physa.2014.01.002openalex-snapshot
Quantum walks with memory on cycles
inferred← citeshttps://doi.org/10.1016/j.physa.2015.02.061openalex-snapshot
History dependent quantum walk on the cycle with an unbalanced coin
inferred← citeshttps://doi.org/10.1016/j.physa.2023.129252openalex-snapshot
Quantum walk mixing is faster than classical on periodic lattices
inferred← citeshttps://doi.org/10.1016/j.tcs.2009.08.030openalex-snapshot
Claw finding algorithms using quantum walk
inferred← citeshttps://doi.org/10.1017/s0960129507006354openalex-snapshot
Decoherence in quantum walks – a review
inferred← citeshttps://doi.org/10.1038/s41598-023-30600-4openalex-snapshot
Biomolecular and quantum algorithms for the dominating set problem in arbitrary networks
inferred← citeshttps://doi.org/10.1088/1361-6633/ad85f0openalex-snapshot
Quantum algorithms for scientific computing
inferred← citeshttps://doi.org/10.1088/1367-2630/9/3/072openalex-snapshot
Almost uniform sampling via quantum walks
inferred← citeshttps://doi.org/10.1088/1751-8113/40/37/011openalex-snapshot
Modifying quantum walks: a scattering theory approach
inferred← citeshttps://doi.org/10.1103/physreva.74.022310openalex-snapshot
Quantum walks with random phase shifts
inferred← citeshttps://doi.org/10.1109/ccc.2013.14openalex-snapshot
On the Power of Non-adaptive Learning Graphs
inferred← citeshttps://doi.org/10.1109/focs.2004.54openalex-snapshot
Quantum Walk Algorithm for Element Distinctness
inferred← citeshttps://doi.org/10.1109/focs.2012.18openalex-snapshot
Learning-Graph-Based Quantum Algorithm for k-Distinctness
inferred← citeshttps://doi.org/10.1109/ispa.2011.12openalex-snapshot
Using Quantum Search to Solve Dynamic Maximum Network Flow Problem
inferred← citeshttps://doi.org/10.1109/jiot.2025.3627427openalex-snapshot
Conditional Constant Function Problem and Its Quantum Solutions: Attacking Feistel Ciphers
inferred← citeshttps://doi.org/10.1109/nano.2007.4601381openalex-snapshot
Improving the network flow problem using quantum search
inferred← citeshttps://doi.org/10.1109/qcnc62729.2024.00027openalex-snapshot
Weaving Complex Graph on Simple Low-Dimensional Qubit Lattices
inferred← citeshttps://doi.org/10.1109/tnb.2021.3075733openalex-snapshot
Quantum Speedup and Mathematical Solutions of Implementing Bio-Molecular Solutions for the Independent Set Problem on IBM Quantum Computers
inferred← citeshttps://doi.org/10.1137/s0097539705447311openalex-snapshot
Quantum Walk Algorithm for Element Distinctness
inferred← citeshttps://doi.org/10.1142/s0219749909005572openalex-snapshot
TIGHT QUANTUM BOUNDS FOR COMPUTATIONAL GEOMETRY PROBLEMS
inferred← citeshttps://doi.org/10.1515/gcc.2011.013openalex-snapshot
Quantum algorithms for fixed points and invariant subgroups
inferred← citeshttps://doi.org/10.2200/s00144ed1v01y200808qmc001openalex-snapshot
Quantum Walks for Computer Scientists
inferred← citeshttps://doi.org/10.2478/v10155-011-0006-6openalex-snapshot
Quantum Walks
inferred← citeshttps://doi.org/10.2478/v10175-011-0039-5openalex-snapshot
Models of quantum computation and quantum programming languages
inferred← citeshttps://doi.org/10.70675/df2903f6ze80az4acezb7a7zbac3d3410f94openalex-snapshot
Quantum and side-channel attacks
inferred← citeshttps://doi.org/10.7498/aps.64.240301openalex-snapshot
Quantum walk search algorithm based on phase matching and circuit cmplementation
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.