On the public citation graph
On the Quantum Chromatic Number of a Graph
0 signed · 105 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/3-540-33099-2openalex-snapshot
Algorithms in Real Algebraic Geometry
inferredcites →https://doi.org/10.1007/978-3-662-05355-3openalex-snapshot
Algorithms in Real Algebraic Geometry
inferredcites →https://doi.org/10.1007/s00220-004-1087-6openalex-snapshot
Randomizing Quantum States: Constructions and Applications
inferredcites →https://doi.org/10.1016/s1355-2198(97)85538-4openalex-snapshot
Quantum theory: Concepts and methods
inferredcites →https://doi.org/10.1090/s0002-9947-1987-0871675-6openalex-snapshot
Forbidden Intersections
inferredcites →https://doi.org/10.1093/ietfec/e89-a.5.1378openalex-snapshot
A Quantum Protocol to Win the Graph Colouring Game on All Hadamard Graphs
inferredcites →https://doi.org/10.1103/physrevlett.83.1874openalex-snapshot
Cost of Exactly Simulating Quantum Entanglement with Classical Communication
inferredcites →https://doi.org/10.1109/isit.2002.1023373openalex-snapshot
Pseudo-telepathy, entanglement, and graph colorings
inferredcites →https://doi.org/10.1109/isit.2003.1228474openalex-snapshot
The impossibility of pseudotelepathy without quantum entanglement
inferredcites →https://doi.org/10.1109/tit.1979.1055985openalex-snapshot
On the Shannon capacity of a graph
inferredcites →https://doi.org/10.1137/s0895479802410293openalex-snapshot
On the Digraph of a Unitary Matrix
inferredcites →https://doi.org/10.48550/arxiv.math/0509151openalex-snapshot
Colouring an Orthogonality Graph
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-030-28796-2_15openalex-snapshot
Localisation-Resistant Random Words with Small Alphabets
inferred← citeshttps://doi.org/10.1007/978-3-319-13350-8_15openalex-snapshot
Maximally Entangled State in Pseudo-Telepathy Games
inferred← citeshttps://doi.org/10.1007/978-3-319-42794-2_8openalex-snapshot
Recent Developments in Quantum Zero-Error Information Theory
inferred← citeshttps://doi.org/10.1007/978-3-319-97686-0_14openalex-snapshot
An Annotated Glossary of Graph Theory Parameters, with Conjectures
inferred← citeshttps://doi.org/10.1007/978-3-662-43948-7_27openalex-snapshot
Characterization of Binary Constraint System Games
inferred← citeshttps://doi.org/10.1007/978-88-7642-475-5_26openalex-snapshot
Zero-error source-channel coding with entanglement
inferred← citeshttps://doi.org/10.1007/s00220-024-05001-xopenalex-snapshot
Quantum No-signalling Correlations and Non-local Games
inferred← citeshttps://doi.org/10.1007/s00493-014-3132-1openalex-snapshot
Sabidussi versus Hedetniemi for three variations of the chromatic number
inferred← citeshttps://doi.org/10.1007/s10107-016-1049-8openalex-snapshot
Linear conic formulations for two-party correlations and values of nonlocal games
inferred← citeshttps://doi.org/10.1007/s10107-018-1287-zopenalex-snapshot
Bounds on entanglement dimensions and quantum graph parameters via noncommutative polynomial optimization
inferred← citeshttps://doi.org/10.1007/s10801-016-0665-yopenalex-snapshot
Conic formulations of graph homomorphisms
inferred← citeshttps://doi.org/10.1007/s11040-020-9331-7openalex-snapshot
Perfect Strategies for Non-Local Games
inferred← citeshttps://doi.org/10.1007/s11128-020-02693-7openalex-snapshot
Properties of operator systems, corresponding to channels
inferred← citeshttps://doi.org/10.1016/j.ejc.2019.04.006openalex-snapshot
Topological bounds on the dimension of orthogonal representations of graphs
inferred← citeshttps://doi.org/10.1016/j.ejc.2025.104252openalex-snapshot
A spectral lower bound on chromatic numbers using p-energy
inferred← citeshttps://doi.org/10.1016/j.jcss.2026.103757openalex-snapshot
Kernelization for orthogonality dimension
inferred← citeshttps://doi.org/10.1016/j.jcta.2019.06.008openalex-snapshot
Spectral lower bounds for the quantum chromatic number of a graph
inferred← citeshttps://doi.org/10.1016/j.jctb.2018.11.002openalex-snapshot
Quantum and non-signalling graph isomorphisms
inferred← citeshttps://doi.org/10.1016/j.jctb.2025.10.002openalex-snapshot
Quantum advantage and CSP complexity
inferred← citeshttps://doi.org/10.1016/j.jfa.2016.01.010openalex-snapshot
Estimating quantum chromatic numbers
inferred← citeshttps://doi.org/10.1016/j.jmaa.2024.128907openalex-snapshot
Homomorphisms of quantum hypergraphs
inferred← citeshttps://doi.org/10.1016/j.laa.2023.01.008openalex-snapshot
Approximating projections by quantum operations
inferred← citeshttps://doi.org/10.1016/j.tcs.2012.12.013openalex-snapshot
Deterministic quantum non-locality and graph colorings
inferred← citeshttps://doi.org/10.1016/j.tcs.2012.12.017openalex-snapshot
Classical, quantum and nonsignalling resources in bipartite games
inferred← citeshttps://doi.org/10.1016/j.tcs.2021.09.041openalex-snapshot
Belief-invariant and quantum equilibria in games of incomplete information
inferred← citeshttps://doi.org/10.1063/1.4936751openalex-snapshot
Synchronous correlation matrices and Connes’ embedding conjecture
inferred← citeshttps://doi.org/10.1063/1.5020566openalex-snapshot
A compositional approach to quantum functions
inferred← citeshttps://doi.org/10.1063/5.0248557openalex-snapshot
Quantum chromatic number of products of quantum graphs
inferred← citeshttps://doi.org/10.1073/pnas.1203857110openalex-snapshot
Violating the Shannon capacity of metric graphs with entanglement
inferred← citeshttps://doi.org/10.1080/00927872.2021.1890756openalex-snapshot
Quantum multiplicative graph and a type of separate clique number
inferred← citeshttps://doi.org/10.1088/1751-8113/49/38/38lt01openalex-snapshot
Quantum state-independent contextuality requires 13 rays
inferred← citeshttps://doi.org/10.1088/1751-8121/ad2b85openalex-snapshot
Semi-definite programming and quantum information
inferred← citeshttps://doi.org/10.1088/2058-9565/adf1c0openalex-snapshot
Application-level benchmarking of quantum computers using nonlocal game strategies
inferred← citeshttps://doi.org/10.1090/proc/14851openalex-snapshot
Quantum extensions of ordinary maps
inferred← citeshttps://doi.org/10.1093/qmath/hav004openalex-snapshot
QUANTUM CHROMATIC NUMBERS VIA OPERATOR SYSTEMS
inferred← citeshttps://doi.org/10.1103/physrevlett.127.070401openalex-snapshot
Converting Contextuality into Nonlocality
inferred← citeshttps://doi.org/10.1109/icqnm.2008.18openalex-snapshot
Classical, Quantum and Non-signalling Resources in Bipartite Games
inferred← citeshttps://doi.org/10.1109/tit.2011.2178018openalex-snapshot
Kochen–Specker Sets and the Rank-1 Quantum Chromatic Number
inferred← citeshttps://doi.org/10.1109/tit.2013.2248031openalex-snapshot
New Separations in Zero-Error Channel Capacity Through Projective Kochen–Specker Sets and Quantum Coloring
inferred← citeshttps://doi.org/10.1109/tit.2014.2385080openalex-snapshot
Entanglement-Assisted Zero-Error Source-Channel Coding
inferred← citeshttps://doi.org/10.1109/tit.2022.3176935openalex-snapshot
On a Tracial Version of Haemers Bound
inferred← citeshttps://doi.org/10.1137/14097865xopenalex-snapshot
Conic Approach to Quantum Graph Parameters Using Linear Optimization Over the Completely Positive Semidefinite Cone
inferred← citeshttps://doi.org/10.1145/2897518.2897634openalex-snapshot
Classical verification of quantum proofs
inferred← citeshttps://doi.org/10.1145/3055399.3055441openalex-snapshot
Compression of quantum multi-prover interactive proofs
inferred← citeshttps://doi.org/10.1145/3661814.3662118openalex-snapshot
Quantum advantage and CSP complexity
inferred← citeshttps://doi.org/10.1145/3772356.3772419openalex-snapshot
Faster-than-light coordination for networked systems with quantum non-local games
inferred← citeshttps://doi.org/10.11606/d.45.2021.tde-23092021-183204openalex-snapshot
Combinatorial and geometric dualities in graph homomorphism optimization problems
inferred← citeshttps://doi.org/10.11606/d.45.2022.tde-19062023-143615openalex-snapshot
An introduction to quantum: computing, communication complexity protocols, nonlocality and graph parameters
inferred← citeshttps://doi.org/10.1184/r1/6716282openalex-snapshot
Entanglement and Interference Resources in Quantum Computation and Communication
inferred← citeshttps://doi.org/10.1215/00192082-11831196openalex-snapshot
Satisfiability problems and algebras of Boolean constraint system games
inferred← citeshttps://doi.org/10.13001/1081-3810.1606openalex-snapshot
Minimum vector rank and complement critical graphs
inferred← citeshttps://doi.org/10.13001/1081-3810.3102openalex-snapshot
Orthogonal Representations, Projective Rank, and Fractional Minimum Positive Semidefinite Rank: Connections and New Directions
inferred← citeshttps://doi.org/10.13001/1081-3810.3201openalex-snapshot
On the closure of the completely positive semidefinite cone and linear approximations to quantum colorings
inferred← citeshttps://doi.org/10.13001/ela.2022.6675openalex-snapshot
Spectral upper bound on the quantum $k$-independence number of a graph
inferred← citeshttps://doi.org/10.22331/q-2023-02-16-922openalex-snapshot
Graph-theoretic approach to Bell experiments with low detection efficiency
inferred← citeshttps://doi.org/10.31274/etd-180810-4532openalex-snapshot
A fractional approach to minimum rank and zero forcing
inferred← citeshttps://doi.org/10.37236/3128openalex-snapshot
Optimization Problems over Unit-Distance Representations of Graphs
inferred← citeshttps://doi.org/10.37236/8183openalex-snapshot
Spectral Lower Bounds for the Orthogonal and Projective Ranks of a Graph
inferred← citeshttps://doi.org/10.37236/9295openalex-snapshot
Spectral Lower Bounds for the Quantum Chromatic Number of a Graph – Part II
inferred← citeshttps://doi.org/10.4064/dm230309-14-11openalex-snapshot
Quantum hypergraph homomorphisms and non-local games
inferred← citeshttps://doi.org/10.4171/jncg/533openalex-snapshot
Discrete quantum structures II: Examples
inferred← citeshttps://doi.org/10.4204/eptcs.318.4openalex-snapshot
Effectus of Quantum Probability on Relational Structures
inferred← citeshttps://doi.org/10.4230/lipics.ccc.2021.8openalex-snapshot
The (Generalized) Orthogonality Dimension of (Generalized) Kneser Graphs: Bounds and Applications
inferred← citeshttps://doi.org/10.4230/lipics.mfcs.2019.39openalex-snapshot
Approximating the Orthogonality Dimension of Graphs and Hypergraphs
inferred← citeshttps://doi.org/10.4230/lipics.tqc.2014.212openalex-snapshot
Graph Homomorphisms for Quantum Players
inferred← citeshttps://doi.org/10.4230/lipics.tqc.2014.67openalex-snapshot
Graph-theoretical Bounds on the Entangled Value of Non-local Games
inferred← citeshttps://doi.org/10.4230/lipics.tqc.2015.206openalex-snapshot
Round Elimination in Exact Communication Complexity
inferred← citeshttps://doi.org/10.4230/lipics.tqc.2023.8openalex-snapshot
Fully Device-Independent Quantum Key Distribution Using Synchronous Correlations
inferred← citeshttps://doi.org/10.48550/arxiv.1209.2729openalex-snapshot
Characterization of Binary Constraint System Games
inferred← citeshttps://doi.org/10.48550/arxiv.1305.5545openalex-snapshot
Sabidussi Versus Hedetniemi for Three Variations of the Chromatic Number
inferred← citeshttps://doi.org/10.48550/arxiv.1506.07429openalex-snapshot
Deciding the existence of perfect entangled strategies for nonlocal games
inferred← citeshttps://doi.org/10.48550/arxiv.1608.06113openalex-snapshot
On the orthogonal rank of Cayley graphs and impossibility of quantum round elimination
inferred← citeshttps://doi.org/10.48550/arxiv.1707.06200openalex-snapshot
Nonlocal games, synchronous correlations, and Bell inequalities
inferred← citeshttps://doi.org/10.48550/arxiv.1805.08334openalex-snapshot
Spectral lower bounds for the quantum chromatic number of a graph
inferred← citeshttps://doi.org/10.48550/arxiv.1810.10074openalex-snapshot
Morphisms in categories of nonlocal games
inferred← citeshttps://doi.org/10.48550/arxiv.1909.01918openalex-snapshot
On Orthogonal Vector Edge Coloring
inferred← citeshttps://doi.org/10.48550/arxiv.2004.04377openalex-snapshot
Discrete quantum structures
inferred← citeshttps://doi.org/10.70500/bjs.1947617openalex-snapshot
Nonlocal Games Revisited: A Review of Representation Frameworks from Bell Locality to Quantum Pseudo-Telepathy
inferred← citeshttps://doi.org/10.70675/8a31edd0z6c6cz4167za099zc7947720d54dopenalex-snapshot
Questions de localisabilité pour le calcul distribué
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.