On the public citation graph
Quantum lower bounds for fanout
0 signed · 34 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/3-540-36494-3_22openalex-snapshot
Quantum Circuits with Unbounded Fan-out
inferredcites →https://doi.org/10.1007/bf01744431openalex-snapshot
Parity, circuits, and the polynomial-time hierarchy
inferredcites →https://doi.org/10.1103/physrevlett.86.3907openalex-snapshot
Multibit Gates for Quantum Computing
inferredcites →https://doi.org/10.1109/sfcs.2000.892140openalex-snapshot
Fast parallel circuits for the quantum Fourier transform
inferredcites →https://doi.org/10.1119/1.1463744openalex-snapshot
Quantum Computation and Quantum Information
inferredcites →https://doi.org/10.1137/s0036144598347011openalex-snapshot
Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
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.26421/qic2.1-3openalex-snapshot
Counting, fanout and the complexity of quantum ACC
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/3-540-36494-3_22openalex-snapshot
Quantum Circuits with Unbounded Fan-out
inferred← citeshttps://doi.org/10.1007/978-3-031-97063-4_11openalex-snapshot
Ancilla-Free Quantum Adder with Sublinear Depth
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.1016/j.ipl.2011.05.002openalex-snapshot
A lower bound method for 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/drp2-rzzwopenalex-snapshot
Analytical Lower Bound on Query Complexity for Transformations of Unknown Unitary Operations
inferred← citeshttps://doi.org/10.1109/qce60285.2024.00033openalex-snapshot
Efficient Variational Quantum Linear Solver for Structured Sparse Matrices
inferred← citeshttps://doi.org/10.1109/qcnc64685.2025.00096openalex-snapshot
Quantum Fanout and GHZ states using spin-exchange interactions*
inferred← citeshttps://doi.org/10.1109/tcad.2025.3539002openalex-snapshot
Shallow Quantum Circuit Implementation of Symmetric Functions With Limited Ancillary Qubits
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.26421/qic10.9-10-12openalex-snapshot
Quantum addition circuits and unbounded fan-out
inferred← citeshttps://doi.org/10.26421/qic8.6-7-5openalex-snapshot
A fast quantum circuit for addition with few qubits
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.48550/arxiv.1112.6063openalex-snapshot
Collapse of the Hierarchy of Constant-Depth Exact Quantum Circuits
inferred← citeshttps://doi.org/10.48550/arxiv.1201.3306openalex-snapshot
Simulating Special but Natural Quantum Circuits
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
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.