On the public citation graph

Hybrid Quantum-classical Search Algorithms

0 signed · 23 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-030-26951-7_10openalex-snapshot
Quantum Security Proofs Using Semi-classical Oracles
inferredcites →https://doi.org/10.1007/978-3-031-58737-5_1openalex-snapshot
The NISQ Complexity of Collision Finding
inferredcites →https://doi.org/10.1007/978-3-540-70575-8_63openalex-snapshot
Impossibility of a Quantum Speed-Up with a Faulty Oracle
inferredcites →https://doi.org/10.1007/s00037-025-00282-7openalex-snapshot
Tight Quantum Lower Bound for Approximate Counting with Quantum States
inferredcites →https://doi.org/10.1103/physreva.60.2746openalex-snapshot
Grover’s quantum searching algorithm is optimal
inferredcites →https://doi.org/10.1137/s0097539796300933openalex-snapshot
Strengths and Weaknesses of Quantum Computing
inferredcites →https://doi.org/10.1145/3570637openalex-snapshot
On the Need for Large Quantum Depth
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.4230/lipics.ccc.2020.7openalex-snapshot
Quantum Lower Bound for Approximate Counting Via Laurent Polynomials
inferredcites →https://doi.org/10.48550/arxiv.1411.4028openalex-snapshot
A Quantum Approximate Optimization Algorithm

What points at this work

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

inferred← citeshttps://doi.org/10.1002/qute.202400286openalex-snapshot
A Scalable Fully Distributed Quantum Alternating Direction Method of Multipliers for Unit Commitment Problems
inferred← citeshttps://doi.org/10.1007/978-3-031-58737-5_1openalex-snapshot
The NISQ Complexity of Collision Finding
inferred← citeshttps://doi.org/10.1007/978-3-032-12296-4_15openalex-snapshot
NISQ Security and Complexity via Simple Classical Reasoning
inferred← citeshttps://doi.org/10.1007/s10479-024-06346-1openalex-snapshot
Q-ensemble learning for customer churn prediction with blockchain-enabled data transparency
inferred← citeshttps://doi.org/10.1016/j.asoc.2023.110147openalex-snapshot
Solving DC power flow problems using quantum and hybrid algorithms
inferred← citeshttps://doi.org/10.1088/1367-2630/ad6f3dopenalex-snapshot
Gate-based quantum neurons in hybrid neural networks
inferred← citeshttps://doi.org/10.1109/icse55347.2025.00137openalex-snapshot
When Quantum Meets Classical: Characterizing Hybrid Quantum-Classical Issues Discussed in Developer Forums
inferred← citeshttps://doi.org/10.1109/nqcomp68334.2026.11497722openalex-snapshot
Performance Analysis of Grover’s Algorithm Under Noise: A Simulation-Driven Study with Error Mitigation and Hybrid Bloom–Grover Search
inferred← citeshttps://doi.org/10.3390/math13060958openalex-snapshot
Exploring the Role of Material Science in Advancing Quantum Machine Learning: A Scientometric Study
inferred← citeshttps://doi.org/10.3390/quantum8010024openalex-snapshot
Defining Quantum Agents: Formal Foundations, Architectures, and NISQ-Era Prototypes
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.