On the public citation graph

Holographic Circuits

0 signed · 40 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.1007/1-4020-0611-x_141openalex-snapshot
COMPUTATIONAL Complexity
inferredcites →https://doi.org/10.1007/11533719_1openalex-snapshot
Completeness for Parity Problems
inferredcites →https://doi.org/10.1016/0166-218x(92)00034-jopenalex-snapshot
On the computation of pfaffians
inferredcites →https://doi.org/10.1016/s0304-3975(01)00325-5openalex-snapshot
Expressiveness of matchgates
inferredcites →https://doi.org/10.1017/cbo9781107325708openalex-snapshot
Combinatorial Matrix Theory
inferredcites →https://doi.org/10.1103/physreva.52.3457openalex-snapshot
Elementary gates for quantum computation
inferredcites →https://doi.org/10.1103/physrevlett.89.247902openalex-snapshot
Practical Scheme for Quantum Computation with Any Two-Qubit Entangling Gate
inferredcites →https://doi.org/10.1109/focs.2004.34openalex-snapshot
Holographic Algorithms (Extended Abstract)
inferredcites →https://doi.org/10.1119/1.1463744openalex-snapshot
Quantum Computation and Quantum Information
inferredcites →https://doi.org/10.1137/0219003openalex-snapshot
The Complexity of Very Simple Boolean Formulas with Applications
inferredcites →https://doi.org/10.1137/s0097539700377025openalex-snapshot
Quantum Circuits That Can Be Simulated Classically in Polynomial Time
inferredcites →https://doi.org/10.1145/505482.505499openalex-snapshot
Quantum computation and quantum information
inferredcites →https://doi.org/10.1201/9781420010572.pt2openalex-snapshot
Combinatorial Matrix Theory
inferredcites →https://doi.org/10.1201/9781420035377openalex-snapshot
Mathematics of Quantum Computation
inferredcites →https://doi.org/10.1201/9781420035377-5openalex-snapshot
Universal quantum gates
inferredcites →https://doi.org/10.26421/qic1.s-16openalex-snapshot
Universal quantum gates for single cooper pair box based quantum computing
inferredcites →https://doi.org/10.5555/314161.314263openalex-snapshot
Graph orientations with no sink and an approximation for a hard case of #SAT

What points at this work

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

inferred← citeshttps://doi.org/10.1007/11533719_1openalex-snapshot
Completeness for Parity Problems
inferred← citeshttps://doi.org/10.1007/11750321_24openalex-snapshot
Valiant’s Holant Theorem and Matchgate Tensors
inferred← citeshttps://doi.org/10.1007/11786986_61openalex-snapshot
Some Results on Matchgates and Holographic Algorithms
inferred← citeshttps://doi.org/10.1007/978-3-540-73420-8_55openalex-snapshot
Holographic Algorithms: The Power of Dimensionality Resolved
inferred← citeshttps://doi.org/10.1007/978-3-540-92182-0_51openalex-snapshot
Signature Theory in Holographic Algorithms
inferred← citeshttps://doi.org/10.1007/978-3-642-14165-2_56openalex-snapshot
Holographic Reduction: A Domain Changed Application and Its Partial Converse Theorems
inferred← citeshttps://doi.org/10.1007/s00037-008-0249-xopenalex-snapshot
Basis Collapse in Holographic Algorithms
inferred← citeshttps://doi.org/10.1007/s00224-007-9092-8openalex-snapshot
On the Theory of Matchgate Computations
inferred← citeshttps://doi.org/10.1007/s00453-009-9383-3openalex-snapshot
Signature Theory in Holographic Algorithms
inferred← citeshttps://doi.org/10.1007/s11390-005-0735-4openalex-snapshot
Progress in Computational Complexity Theory
inferred← citeshttps://doi.org/10.1016/j.jsc.2010.06.015openalex-snapshot
P versus NP and geometry
inferred← citeshttps://doi.org/10.1016/j.laa.2012.01.010openalex-snapshot
Holographic algorithms without matchgates
inferred← citeshttps://doi.org/10.1016/j.tcs.2008.12.047openalex-snapshot
Holographic algorithms: The power of dimensionality resolved
inferred← citeshttps://doi.org/10.1109/ccc.2007.6openalex-snapshot
Bases Collapse in Holographic Algorithms
inferred← citeshttps://doi.org/10.1109/qce60285.2024.00195openalex-snapshot
Fermionic Machine Learning
inferred← citeshttps://doi.org/10.1109/tit.2008.920245openalex-snapshot
Constrained Codes as Networks of Relations
inferred← citeshttps://doi.org/10.1145/1250790.1250850openalex-snapshot
Holographic algorithms
inferred← citeshttps://doi.org/10.1145/1388240.1388254openalex-snapshot
Holographic algorithms
inferred← citeshttps://doi.org/10.1145/2897518.2897546openalex-snapshot
Basis collapse for holographic algorithms over all domain sizes
inferred← citeshttps://doi.org/10.1145/2897518.2897560openalex-snapshot
Base collapse of holographic algorithms
inferred← citeshttps://doi.org/10.21203/rs.3.rs-3849497/v1openalex-snapshot
On Duplication-Free Codes for Disjoint or Equal-Length Errors
inferred← citeshttps://doi.org/10.48550/arxiv.1405.7381openalex-snapshot
On computation with 'probabilities' modulo k
inferred← citeshttps://doi.org/10.48550/arxiv.1509.07789openalex-snapshot
On exact counting and quasi-quantum complexity
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.