On the public citation graph
Logical network implementation for graph codes and cluster states
0 signed · 22 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.1103/physreva.56.76openalex-snapshot
Efficient computations of encodings for quantum error correction
inferredcites →https://doi.org/10.1103/physreva.65.012308openalex-snapshot
Quantum error-correcting codes associated with graphs
inferredcites →https://doi.org/10.1103/physrevlett.86.5188openalex-snapshot
A One-Way Quantum Computer
inferredcites →https://doi.org/10.1103/physrevlett.86.910openalex-snapshot
Persistent Entanglement in Arrays of Interacting Particles
inferredcites →https://doi.org/10.26421/qic2.4-4openalex-snapshot
Stabilizer codes can be realized as graph codes
inferredcites →https://doi.org/10.48550/arxiv.quant-ph/0010033openalex-snapshot
Quantum computing via measurements only
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1016/j.aop.2014.09.026openalex-snapshot
On the Schmidt-rank-three bipartite and multipartite unitary operator
inferred← citeshttps://doi.org/10.1016/j.physleta.2013.12.009openalex-snapshot
Standard form of qudit stabilizer groups
inferred← citeshttps://doi.org/10.1038/ncomms4658openalex-snapshot
Experimental demonstration of a graph state quantum error-correction code
inferred← citeshttps://doi.org/10.1038/ncomms6480openalex-snapshot
Experimental demonstration of graph-state quantum secret sharing
inferred← citeshttps://doi.org/10.1063/1.1797533openalex-snapshot
Error syndrome calculation for graph codes on a one-way quantum computer: Towards a quantum memory
inferred← citeshttps://doi.org/10.1088/1367-2630/7/1/170openalex-snapshot
Entanglement on mixed stabilizer states: normal forms and reduction procedures
inferred← citeshttps://doi.org/10.1088/1367-2630/7/1/194openalex-snapshot
Optical generation of matter qubit graph states
inferred← citeshttps://doi.org/10.1103/physreva.78.042303openalex-snapshot
Quantum-error-correcting codes using qudit graph states
inferred← citeshttps://doi.org/10.1103/physreva.97.012323openalex-snapshot
Qudit hypergraph states and their properties
inferred← citeshttps://doi.org/10.1142/s0217979217501326openalex-snapshot
Stabilizer codes and equientangled bases from phase states
inferred← citeshttps://doi.org/10.26421/qic2.4-4openalex-snapshot
Stabilizer codes can be realized as graph codes
inferred← citeshttps://doi.org/10.26421/qic4.4-4openalex-snapshot
Cluster states, algorithms and graphs
inferred← citeshttps://doi.org/10.48550/arxiv.quant-ph/0412060openalex-snapshot
Complementarity and Entanglement in Quantum Information Theory
inferred← citeshttps://doi.org/10.48550/arxiv.quant-ph/0412071openalex-snapshot
Complexity of Graph State Preparation
inferred← citeshttps://doi.org/10.48550/arxiv.quant-ph/0506126openalex-snapshot
Towards Large-Scale Quantum Computation
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.