On the public citation graph

Counting, fanout and the complexity of quantum ACC

0 signed · 91 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.1006/jcss.1999.1651openalex-snapshot
Complexity Limitations on Quantum Computation
inferredcites →https://doi.org/10.1006/jcss.1999.1673openalex-snapshot
Circuits and Expressions with Nonassociative Gates
inferredcites →https://doi.org/10.1007/3-540-56503-5_55openalex-snapshot
Circuits with monoidal gates
inferredcites →https://doi.org/10.1007/978-3-662-03612-9_3openalex-snapshot
Computational Complexity
inferredcites →https://doi.org/10.1007/bf01137685openalex-snapshot
Lower bounds on the size of bounded depth circuits over a complete basis with logical addition
inferredcites →https://doi.org/10.1007/bf01744431openalex-snapshot
Parity, circuits, and the polynomial-time hierarchy
inferredcites →https://doi.org/10.1016/0022-0000(89)90037-8openalex-snapshot
Bounded-width polynomial-size branching programs recognize exactly those languages in NC1
inferredcites →https://doi.org/10.1016/0168-0072(83)90038-6openalex-snapshot
∑11-Formulae on finite structures
inferredcites →https://doi.org/10.1016/s0020-0190(99)00084-8openalex-snapshot
NQP co-CP
inferredcites →https://doi.org/10.1080/09500349414552351openalex-snapshot
Oracle Quantum Computing
inferredcites →https://doi.org/10.1093/oso/9780198536901.003.0007openalex-snapshot
On polynomial size Frege proofs of certain combinatorial principles
inferredcites →https://doi.org/10.1098/rspa.1985.0070openalex-snapshot
Quantum theory, the Church–Turing principle and the universal quantum computer
inferredcites →https://doi.org/10.1098/rspa.1992.0167openalex-snapshot
Rapid solution of problems by quantum computation
inferredcites →https://doi.org/10.1098/rspa.1999.0485openalex-snapshot
Determining acceptance possibility for a quantum computation is hard for the polynomial hierarchy
inferredcites →https://doi.org/10.1103/physreva.52.3457openalex-snapshot
Elementary gates for quantum computation
inferredcites →https://doi.org/10.1103/physrevlett.73.58openalex-snapshot
Experimental realization of any discrete unitary operator
inferredcites →https://doi.org/10.1103/physrevlett.74.4091openalex-snapshot
Quantum Computations with Cold Trapped Ions
inferredcites →https://doi.org/10.1103/physrevlett.77.3260openalex-snapshot
Fault-Tolerant Error Correction with Efficient Quantum Codes
inferredcites →https://doi.org/10.1109/ccc.1996.507676openalex-snapshot
Randomization and derandomization in space-bounded computation
inferredcites →https://doi.org/10.1109/ccc.2000.856756openalex-snapshot
On the complexity of quantum ACC
inferredcites →https://doi.org/10.1109/fscs.1990.89583openalex-snapshot
ON ACC and threshold circuits
inferredcites →https://doi.org/10.1109/sct.1992.215388openalex-snapshot
The quantum challenge to structural complexity theory
inferredcites →https://doi.org/10.1109/sfcs.1993.366852openalex-snapshot
Quantum circuit complexity
inferredcites →https://doi.org/10.1109/sfcs.1994.365700openalex-snapshot
Algorithms for quantum computation: discrete logarithms and factoring
inferredcites →https://doi.org/10.1109/sfcs.1996.548464openalex-snapshot
Fault-tolerant quantum computation
inferredcites →https://doi.org/10.1126/science.275.5298.350openalex-snapshot
Bulk Spin-Resonance Quantum Computation
inferredcites →https://doi.org/10.1137/0213028openalex-snapshot
Constant Depth Reducibility
inferredcites →https://doi.org/10.1137/0218053openalex-snapshot
Time/Space Trade-Offs for Reversible Computation
inferredcites →https://doi.org/10.1137/0404038openalex-snapshot
On the Power of Threshold Circuits with Small Weights
inferredcites →https://doi.org/10.1137/0709039openalex-snapshot
On a Class of Finite Elements Generated by Lagrange Interpolation
inferredcites →https://doi.org/10.1137/0710019openalex-snapshot
On a Class of Finite Elements Generated by Lagrange Interpolation. II
inferredcites →https://doi.org/10.1137/0714050openalex-snapshot
On Lattices Admitting Unique Lagrange Interpolations
inferredcites →https://doi.org/10.1137/s0097539795293639openalex-snapshot
Quantum Computability
inferredcites →https://doi.org/10.1137/s0097539796298637openalex-snapshot
On the Power of Quantum Computation
inferredcites →https://doi.org/10.1137/s0097539796300933openalex-snapshot
Strengths and Weaknesses of Quantum Computing
inferredcites →https://doi.org/10.1137/s0097539799355053openalex-snapshot
Parallel Quantum Computation and Quantum Codes
inferredcites →https://doi.org/10.1137/s0895480192228619openalex-snapshot
On Optimal Depth Threshold Circuits for Multiplication and Related Problems
inferredcites →https://doi.org/10.1145/12130.12131openalex-snapshot
Bounded-width polynomial-size branching programs recognize exactly those languages in NC 1
inferredcites →https://doi.org/10.1145/167088.167097openalex-snapshot
Quantum complexity theory
inferredcites →https://doi.org/10.1145/237814.237866openalex-snapshot
A fast quantum mechanical algorithm for database search
inferredcites →https://doi.org/10.1145/28395.28404openalex-snapshot
Algebraic methods in the theory of lower bounds for Boolean circuit complexity
inferredcites →https://doi.org/10.1145/48014.63138openalex-snapshot
Finite monoids and the fine structure of NC 1
inferredcites →https://doi.org/10.48550/arxiv.quant-ph/9903046openalex-snapshot
Quantum Circuits: Fanout, Parity, and Counting

What points at this work

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

inferred← citeshttps://doi.org/10.1007/11537311_5openalex-snapshot
Bounds on the Power of Constant-Depth Quantum Circuits
inferred← citeshttps://doi.org/10.1007/3-540-36494-3_22openalex-snapshot
Quantum Circuits with Unbounded Fan-out
inferred← citeshttps://doi.org/10.1007/978-0-387-35608-2_27openalex-snapshot
Quantum NP and a Quantum Hierarchy
inferred← citeshttps://doi.org/10.1007/978-3-642-02882-3_42openalex-snapshot
Efficient Universal Quantum Circuits
inferred← citeshttps://doi.org/10.1007/978-3-642-18073-6_4openalex-snapshot
Computational Depth Complexity of Measurement-Based Quantum Computation
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.1016/j.tcs.2008.12.046openalex-snapshot
Parallelizing quantum circuits
inferred← citeshttps://doi.org/10.1016/j.tcs.2020.11.039openalex-snapshot
Power of uninitialized qubits in shallow quantum circuits
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.1103/qdst-yrh6openalex-snapshot
Benincasa-Dowker-Glaser causal set actions by quantum counting
inferred← citeshttps://doi.org/10.1109/ccc.2013.25openalex-snapshot
Collapse of the Hierarchy of Constant-Depth Exact Quantum Circuits
inferred← citeshttps://doi.org/10.1109/cec.2003.1299569openalex-snapshot
On the computational power of constant-depth quantum circuits with gates for addition
inferred← citeshttps://doi.org/10.1109/qce52317.2021.00045openalex-snapshot
Quantum Fan-out: Circuit Optimizations and Technology Modeling
inferred← citeshttps://doi.org/10.1109/qcnc64685.2025.00096openalex-snapshot
Quantum Fanout and GHZ states using spin-exchange interactions*
inferred← citeshttps://doi.org/10.1137/s0097539799355053openalex-snapshot
Parallel Quantum Computation and Quantum Codes
inferred← citeshttps://doi.org/10.1145/1007352.1007378openalex-snapshot
Multilinear formulas and skepticism of quantum computing
inferred← citeshttps://doi.org/10.1145/1272729.1272739openalex-snapshot
Small depth quantum circuits
inferred← citeshttps://doi.org/10.1145/3313276.3316404openalex-snapshot
Exponential separation between shallow quantum circuits and unbounded fan-in shallow classical circuits
inferred← citeshttps://doi.org/10.1145/3717823.3718189openalex-snapshot
On the Computational Power of QAC0 with Barely Superlinear Ancillae
inferred← citeshttps://doi.org/10.1145/3729283openalex-snapshot
Quantum Register Machine: Efficient Implementation of Quantum Recursive Programs
inferred← citeshttps://doi.org/10.1145/568425.568432openalex-snapshot
SIGACT news complexity theory column 34
inferred← citeshttps://doi.org/10.1587/essfr.14.1_15openalex-snapshot
Development of Fast Quantum Algorithms
inferred← citeshttps://doi.org/10.22331/q-2024-01-15-1228openalex-snapshot
Parallel Quantum Algorithm for Hamiltonian Simulation
inferred← citeshttps://doi.org/10.22331/q-2024-11-20-1530openalex-snapshot
Constant-depth circuits for Boolean functions and quantum memory devices using multi-qubit gates
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.22331/q-2026-06-30-2144openalex-snapshot
Query and Depth Upper Bounds for Quantum Unitaries via Grover Search
inferred← citeshttps://doi.org/10.26421/qic10.9-10-12openalex-snapshot
Quantum addition circuits and unbounded fan-out
inferred← citeshttps://doi.org/10.26421/qic14.9-10-11openalex-snapshot
A quantum circuit to find discrete logarithms on ordinary binary elliptic curves in depth O(log^2n)
inferred← citeshttps://doi.org/10.26421/qic4.2-5openalex-snapshot
Adaptive Quantum Computation, Constant Depth Quantum Circuits and Arthur-Merlin Games
inferred← citeshttps://doi.org/10.26421/qic6.1-3openalex-snapshot
Quantum lower bounds for fanout
inferred← citeshttps://doi.org/10.4086/toc.2005.v001a005openalex-snapshot
inferred← citeshttps://doi.org/10.4230/lipics.ccc.2019.21openalex-snapshot
Average-Case Quantum Advantage with Shallow Circuits
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.itcs.2021.32openalex-snapshot
Bounds on the QAC$^0$ Complexity of Approximating Parity
inferred← citeshttps://doi.org/10.4230/lipics.stacs.2008.1322openalex-snapshot
Distinguishing Short Quantum Computations
inferred← citeshttps://doi.org/10.4230/lipics.tqc.2013.80openalex-snapshot
Dequantizing Read-once Quantum Formulas
inferred← citeshttps://doi.org/10.48550/arxiv.0909.3930openalex-snapshot
Computational Distinguishability of Quantum Channels
inferred← citeshttps://doi.org/10.48550/arxiv.0909.4673openalex-snapshot
Computational depth complexity of measurement-based quantum computation
inferred← citeshttps://doi.org/10.48550/arxiv.1112.6063openalex-snapshot
Collapse of the Hierarchy of Constant-Depth Exact Quantum Circuits
inferred← citeshttps://doi.org/10.48550/arxiv.1306.1161openalex-snapshot
A quantum circuit to find discrete logarithms on ordinary binary elliptic curves in depth O(log^2 n)
inferred← citeshttps://doi.org/10.48550/arxiv.1309.6116openalex-snapshot
Optimal parallel quantum query algorithms
inferred← citeshttps://doi.org/10.48550/arxiv.1406.4361openalex-snapshot
Quantum Oracles in Constant Depth with Measurement-Based Quantum Computation
inferred← citeshttps://doi.org/10.48550/arxiv.2005.12169openalex-snapshot
Depth-2 QAC circuits cannot simulate quantum parity
inferred← citeshttps://doi.org/10.48550/arxiv.quant-ph/0407125openalex-snapshot
Implementing fanout, parity, and Mod gates via spin exchange interactions
inferred← citeshttps://doi.org/10.48550/arxiv.quant-ph/0412143openalex-snapshot
Limits on Efficient Computation in the Physical World
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.