On the public citation graph
On the Need for Large Quantum Depth
0 signed · 33 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.1007/978-3-030-26951-7_10openalex-snapshot
Quantum Security Proofs Using Semi-classical Oracles
inferredcites →https://doi.org/10.1007/978-3-319-78381-9_9openalex-snapshot
Random Oracles and Non-uniformity
inferredcites →https://doi.org/10.1007/978-3-540-74143-5_12openalex-snapshot
Random Oracles and Auxiliary Input
inferredcites →https://doi.org/10.1007/978-3-662-44381-1_5openalex-snapshot
The Impossibility of Obfuscation with Auxiliary Input or a Universal Simulator
inferredcites →https://doi.org/10.1038/s41586-019-1666-5openalex-snapshot
Quantum supremacy using a programmable superconducting processor
inferredcites →https://doi.org/10.1088/1367-2630/18/2/023023openalex-snapshot
The theory of variational hybrid quantum-classical algorithms
inferredcites →https://doi.org/10.1098/rspa.2010.0301openalex-snapshot
Classical simulation of commuting quantum computations implies collapse of the polynomial hierarchy
inferredcites →https://doi.org/10.1109/sfcs.1994.365701openalex-snapshot
On the power of quantum computation
inferredcites →https://doi.org/10.1109/sfcs.2000.892140openalex-snapshot
Fast parallel circuits for the quantum Fourier transform
inferredcites →https://doi.org/10.1145/1806689.1806711openalex-snapshot
BQP and the polynomial hierarchy
inferredcites →https://doi.org/10.1145/2817206openalex-snapshot
Revocable Quantum Timed-Release Encryption
inferredcites →https://doi.org/10.1145/3357713.3384269openalex-snapshot
Computations with greater Quantum depth are strictly more powerful (relative to an oracle)
inferredcites →https://doi.org/10.1145/780542.780552openalex-snapshot
Exponential algorithmic speedup by a quantum walk
inferredcites →https://doi.org/10.22331/q-2018-08-06-79openalex-snapshot
Quantum Computing in the NISQ era and beyond
inferredcites →https://doi.org/10.26421/qic4.2-5openalex-snapshot
Adaptive Quantum Computation, Constant Depth Quantum Circuits and Arthur-Merlin Games
inferredcites →https://doi.org/10.48550/arxiv.1411.4028openalex-snapshot
A Quantum Approximate Optimization Algorithm
inferredcites →https://doi.org/10.48550/arxiv.1602.07674openalex-snapshot
Quantum Supremacy through the Quantum Approximate Optimization Algorithm
inferredcites →https://doi.org/10.48550/arxiv.quant-ph/0010033openalex-snapshot
Quantum computing via measurements only
inferredcites →https://doi.org/10.48550/arxiv.quant-ph/0508124openalex-snapshot
An introduction to measurement based quantum computation
inferredcites →https://doi.org/10.48550/arxiv.quant-ph/9808027openalex-snapshot
Parallel Quantum Computation and Quantum Codes
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-58737-5_1openalex-snapshot
The NISQ Complexity of Collision Finding
inferred← citeshttps://doi.org/10.1007/978-3-031-68391-6_1openalex-snapshot
Quantum Complexity for Discrete Logarithms and Related Problems
inferred← citeshttps://doi.org/10.1007/978-3-031-97063-4_5openalex-snapshot
Universal Graph Theory Operations for Graph State Preparation
inferred← citeshttps://doi.org/10.1007/978-981-96-0947-5_3openalex-snapshot
Generalized Hybrid Search with Applications to Blockchains and Hash Function Security
inferred← citeshttps://doi.org/10.1103/physreva.110.012422openalex-snapshot
Tight quantum depth lower bound for solving systems of linear equations
inferred← citeshttps://doi.org/10.1109/qce65121.2025.00165openalex-snapshot
Distributed Quantum Neural Networks on Distributed Photonic Quantum Computing
inferred← citeshttps://doi.org/10.1109/tit.2022.3151760openalex-snapshot
Learning Quantum Circuits of Some T Gates
inferred← citeshttps://doi.org/10.1145/3357713.3384269openalex-snapshot
Computations with greater Quantum depth are strictly more powerful (relative to an oracle)
inferred← citeshttps://doi.org/10.1145/3648573openalex-snapshot
Hybrid Quantum-classical Search Algorithms
inferred← citeshttps://doi.org/10.22331/q-2024-01-15-1228openalex-snapshot
Parallel Quantum Algorithm for Hamiltonian Simulation
inferred← citeshttps://doi.org/10.48550/arxiv.1911.13091openalex-snapshot
Hybrid Decision Trees: Longer Quantum Time is Strictly More Powerful
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.