On the public citation graph
https://doi.org/10.4086/toc.2009.v005a005
0 signed · 39 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.
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.
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.1016/0304-3975(85)90210-5openalex-snapshot
Lower bounds on probabilistic linear decision trees
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.1103/physreva.58.915openalex-snapshot
Quantum computation and decision trees
inferredcites →https://doi.org/10.1109/focs.2007.57openalex-snapshot
Any AND-OR Formula of Size N can be Evaluated in time N^{1/2 + o(1)} on a Quantum Computer
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/aisy.202200232openalex-snapshot
A New Type of Classical Logic Circuit with Exponential Speedup
inferred← citeshttps://doi.org/10.1002/qute.202300251openalex-snapshot
Quantum Combinational Logics and their Realizations with Circuits
inferred← citeshttps://doi.org/10.1007/978-3-642-31594-7_47openalex-snapshot
Quantum Adversary (Upper) Bound
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-013-0066-8openalex-snapshot
A strong direct product theorem for quantum query complexity
inferred← citeshttps://doi.org/10.1007/s11128-012-0389-4openalex-snapshot
Asymptotic behavior of quantum walks with spatio-temporal coin fluctuations
inferred← citeshttps://doi.org/10.1007/s11128-012-0475-7openalex-snapshot
Intricacies of quantum computational paths
inferred← citeshttps://doi.org/10.1007/s11128-015-1137-3openalex-snapshot
Challenges of adiabatic quantum evaluation of NAND trees
inferred← citeshttps://doi.org/10.1007/s11424-019-9008-0openalex-snapshot
Quantum Algorithm Design: Techniques and Applications
inferred← citeshttps://doi.org/10.1016/j.cosrev.2018.11.002openalex-snapshot
A Survey on quantum computing technology
inferred← citeshttps://doi.org/10.1016/j.physleta.2025.130759openalex-snapshot
Multi-target quantum walk search on Johnson graph
inferred← citeshttps://doi.org/10.1016/j.physrep.2016.07.001openalex-snapshot
Green’s function approach for quantum graphs: An overview
inferred← citeshttps://doi.org/10.1017/fms.2017.2openalex-snapshot
EXPONENTIAL IMPROVEMENT IN PRECISION FOR SIMULATING SPARSE HAMILTONIANS
inferred← citeshttps://doi.org/10.1063/1.3643768openalex-snapshot
Disordered quantum walks in one lattice dimension
inferred← citeshttps://doi.org/10.1088/1361-6633/aab406openalex-snapshot
Machine learning & artificial intelligence in the quantum domain: a review of recent progress
inferred← citeshttps://doi.org/10.1103/physreva.104.062211openalex-snapshot
Search by lackadaisical quantum walk with symmetry breaking
inferred← citeshttps://doi.org/10.1103/physreva.109.022412openalex-snapshot
Two methods for breaking down a quantum algorithm
inferred← citeshttps://doi.org/10.1103/physreva.82.042304openalex-snapshot
Universal quantum computation by discontinuous quantum walk
inferred← citeshttps://doi.org/10.1103/physreva.84.062302openalex-snapshot
Single-qubit unitary gates by graph scattering
inferred← citeshttps://doi.org/10.1103/physreva.85.052314openalex-snapshot
Bose-Hubbard model for universal quantum-walk-based computation
inferred← citeshttps://doi.org/10.1103/physreva.86.022335openalex-snapshot
Quantum walks on trees with disorder: Decay, diffusion, and localization
inferred← citeshttps://doi.org/10.1103/physrevlett.114.090502openalex-snapshot
Simulating Hamiltonian Dynamics with a Truncated Taylor Series
inferred← citeshttps://doi.org/10.1103/physrevlett.125.160502openalex-snapshot
Integrated Quantum-Walk Structure and NAND Tree on a Photonic Chip
inferred← citeshttps://doi.org/10.1109/ccc.2012.17openalex-snapshot
A Strong Direct Product Theorem for Quantum Query Complexity
inferred← citeshttps://doi.org/10.1109/focs.2011.75openalex-snapshot
Quantum Query Complexity of State Conversion
inferred← citeshttps://doi.org/10.1109/focs.2015.54openalex-snapshot
Hamiltonian Simulation with Nearly Optimal Dependence on all Parameters
inferred← citeshttps://doi.org/10.1137/080712167openalex-snapshot
Any AND-OR Formula of Size N Can Be Evaluated in Time $N^{1/2+o(1)}$ on a Quantum Computer
inferred← citeshttps://doi.org/10.1145/2591796.2591854openalex-snapshot
Exponential improvement in precision for simulating sparse Hamiltonians
inferred← citeshttps://doi.org/10.22331/q-2021-09-16-543openalex-snapshot
Quantum algorithms and approximating polynomials for composed functions with shared inputs
inferred← citeshttps://doi.org/10.22331/q-2026-03-23-2039openalex-snapshot
Space-Efficient Quantum Error Reduction without log Factors
inferred← citeshttps://doi.org/10.4230/lipics.itcs.2022.67openalex-snapshot
Small Circuits Imply Efficient Arthur-Merlin Protocols
inferred← citeshttps://doi.org/10.48550/arxiv.1709.02779openalex-snapshot
Machine learning \& artificial intelligence in the quantum domain
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.