On the public citation graph
Collapse of the Hierarchy of Constant-Depth Exact Quantum Circuits
0 signed · 36 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/11537311_5openalex-snapshot
Bounds on the Power of Constant-Depth Quantum Circuits
inferredcites →https://doi.org/10.1007/978-3-642-18073-6_4openalex-snapshot
Computational Depth Complexity of Measurement-Based Quantum Computation
inferredcites →https://doi.org/10.1007/978-3-662-03927-4openalex-snapshot
Introduction to Circuit Complexity
inferredcites →https://doi.org/10.1007/bf01744431openalex-snapshot
Parity, circuits, and the polynomial-time hierarchy
inferredcites →https://doi.org/10.1016/0022-0000(85)90015-7openalex-snapshot
Unbounded fan-in circuits and associative functions
inferredcites →https://doi.org/10.1088/1367-2630/13/2/023014openalex-snapshot
Non-adaptive measurement-based quantum computation and multi-party Bell inequalities
inferredcites →https://doi.org/10.1090/conm/305/05215openalex-snapshot
Quantum amplitude amplification and estimation
inferredcites →https://doi.org/10.1109/18.256501openalex-snapshot
Depth efficient neural networks for division and related problems
inferredcites →https://doi.org/10.1109/istcs.1997.595153openalex-snapshot
An exact quantum polynomial-time algorithm for Simon's problem
inferredcites →https://doi.org/10.1109/sfcs.2000.892139openalex-snapshot
An improved quantum Fourier transform algorithm and applications
inferredcites →https://doi.org/10.1109/sfcs.2000.892140openalex-snapshot
Fast parallel circuits for the quantum Fourier transform
inferredcites →https://doi.org/10.1109/tit.1978.1055817openalex-snapshot
An improved algorithm for computing logarithms overGF(p)and its cryptographic significance (Corresp.)
inferredcites →https://doi.org/10.1119/1.1463744openalex-snapshot
Quantum Computation and Quantum Information
inferredcites →https://doi.org/10.1137/s0097539795293172openalex-snapshot
Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
inferredcites →https://doi.org/10.1137/s0097539799355053openalex-snapshot
Parallel Quantum Computation and Quantum Codes
inferredcites →https://doi.org/10.1142/s0219749904000109openalex-snapshot
EXACT QUANTUM FOURIER TRANSFORMS AND DISCRETE LOGARITHM ALGORITHMS
inferredcites →https://doi.org/10.1145/1374376.1374458openalex-snapshot
Some topics in analysis of boolean functions
inferredcites →https://doi.org/10.1145/1806689.1806711openalex-snapshot
BQP and the polynomial hierarchy
inferredcites →https://doi.org/10.1145/505482.505499openalex-snapshot
Quantum computation and quantum information
inferredcites →https://doi.org/10.1145/800061.808732openalex-snapshot
Unbounded fan-in circuits and associative functions
inferredcites →https://doi.org/10.26421/qic2.1-3openalex-snapshot
Counting, fanout and the complexity of quantum ACC
inferredcites →https://doi.org/10.48550/arxiv.quant-ph/0311134openalex-snapshot
Quantum Computing Discrete Logarithms with the Help of a Preprocessed State
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-319-21398-9_18openalex-snapshot
Commuting Quantum Circuits with Few Outputs are Unlikely to be Classically Simulatable
inferred← citeshttps://doi.org/10.1007/978-3-642-40313-2_70openalex-snapshot
Hardness of Classically Simulating Quantum Circuits with Unbounded Toffoli and Fan-Out Gates
inferred← citeshttps://doi.org/10.1007/978-3-662-44777-2_49openalex-snapshot
Optimal Parallel Quantum Query Algorithms
inferred← citeshttps://doi.org/10.1007/s00037-016-0140-0openalex-snapshot
Collapse of the Hierarchy of Constant-Depth Exact Quantum Circuits
inferred← citeshttps://doi.org/10.1007/s00453-016-0206-zopenalex-snapshot
Optimal Parallel Quantum Query Algorithms
inferred← citeshttps://doi.org/10.1145/3729283openalex-snapshot
Quantum Register Machine: Efficient Implementation of Quantum Recursive Programs
inferred← citeshttps://doi.org/10.22331/q-2024-12-09-1552openalex-snapshot
State preparation by shallow circuits using feed forward
inferred← citeshttps://doi.org/10.26421/qic16.3-4-4openalex-snapshot
Commuting quantum circuits with few outputs are unlikely to be classically simulatable
inferred← citeshttps://doi.org/10.26421/qic19.5-6-2openalex-snapshot
Periodic Fourier representation of Boolean functions
inferred← citeshttps://doi.org/10.4230/lipics.ccc.2023.33openalex-snapshot
On the Impossibility of General Parallel Fast-Forwarding of Hamiltonian Simulation
inferred← citeshttps://doi.org/10.4230/lipics.mfcs.2021.59openalex-snapshot
Test of Quantumness with Small-Depth Quantum Circuits
inferred← citeshttps://doi.org/10.48550/arxiv.1309.6116openalex-snapshot
Optimal parallel quantum query algorithms
inferred← citeshttps://doi.org/10.53829/ntr201411fa7openalex-snapshot
Quantum Computing Beyond Integer Factorization--Exploring the Potential of Quantum Search
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.