On the public citation graph
Quantum XOR Games
0 signed · 61 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/bf00417500openalex-snapshot
Quantum generalizations of Bell's inequality
inferredcites →https://doi.org/10.1007/bf01200056openalex-snapshot
Non-deterministic exponential time has two-prover interactive protocols
inferredcites →https://doi.org/10.1007/bf01663472openalex-snapshot
Quantum analogues of the Bell inequalities. The case of two spatially separated domains
inferredcites →https://doi.org/10.1007/bf02790792openalex-snapshot
A new upper bound for the complex Grothendieck constant
inferredcites →https://doi.org/10.1007/s00037-008-0250-4openalex-snapshot
Perfect Parallel Repetition Theorem for Quantum Xor Proof Systems
inferredcites →https://doi.org/10.1007/s00220-008-0418-4openalex-snapshot
Unbounded Violation of Tripartite Bell Inequalities
inferredcites →https://doi.org/10.1007/s00220-010-1125-5openalex-snapshot
Unbounded Violations of Bipartite Bell Inequalities via Operator Space Theory
inferredcites →https://doi.org/10.1007/s00220-011-1296-8openalex-snapshot
Large Violation of Bell Inequalities with Low Entanglement
inferredcites →https://doi.org/10.1007/s00220-012-1642-5openalex-snapshot
Explicit Lower and Upper Bounds on the Entangled Value of Multiplayer XOR Games
inferredcites →https://doi.org/10.1007/s00220-013-1784-0openalex-snapshot
A Framework for Bounding Nonlocality of State Discrimination
inferredcites →https://doi.org/10.1007/s00222-002-0235-xopenalex-snapshot
Grothendieck’s theorem for operator spaces
inferredcites →https://doi.org/10.1007/s00222-008-0137-7openalex-snapshot
The Effros–Ruan conjecture for bilinear forms on C*-algebras
inferredcites →https://doi.org/10.1016/0001-8708(85)90026-xopenalex-snapshot
The Grothendieck inequality for bilinear forms on C∗-algebras
inferredcites →https://doi.org/10.1016/0022-1236(78)90038-1openalex-snapshot
Grothendieck's theorem for noncommutative C∗-algebras, with an Appendix on Grothendieck's constants
inferredcites →https://doi.org/10.1017/fmp.2013.4openalex-snapshot
THE GROTHENDIECK CONSTANT IS STRICTLY SMALLER THAN KRIVINE’S BOUND
inferredcites →https://doi.org/10.1017/s0305004100065294openalex-snapshot
Geometry of the tensor product of C*-algebras
inferredcites →https://doi.org/10.1063/1.3652924openalex-snapshot
Lower bounds on the entanglement needed to play XOR non-local games
inferredcites →https://doi.org/10.1080/09747338.1997.11415666openalex-snapshot
Personal Communication
inferredcites →https://doi.org/10.1090/s0273-0979-2011-01348-9openalex-snapshot
Grothendieck’s Theorem, past and present
inferredcites →https://doi.org/10.1103/physicsphysiquefizika.1.195openalex-snapshot
On the Einstein Podolsky Rosen paradox
inferredcites →https://doi.org/10.1103/physreva.59.1070openalex-snapshot
Quantum nonlocality without entanglement
inferredcites →https://doi.org/10.1103/physreva.82.022116openalex-snapshot
Maximal violation of a bipartite three-setting, two-outcome Bell inequality using infinite-dimensional quantum systems
inferredcites →https://doi.org/10.1103/physrevlett.108.200401openalex-snapshot
All Entangled Quantum States Are Nonlocal
inferredcites →https://doi.org/10.1103/physrevlett.23.880openalex-snapshot
Proposed Experiment to Test Local Hidden-Variable Theories
inferredcites →https://doi.org/10.1103/physrevlett.95.080505openalex-snapshot
Bipartite Subspaces Having No Bases Distinguishable by Local Operations and Classical Communication
inferredcites →https://doi.org/10.1109/ccc.2004.1313847openalex-snapshot
Consequences and limits of nonlocal strategies
inferredcites →https://doi.org/10.1109/ccc.2008.26openalex-snapshot
The Quantum Moment Problem and Bounds on Entangled Multi-prover Games
inferredcites →https://doi.org/10.1109/ccc.2011.30openalex-snapshot
Near-Optimal and Explicit Bell Inequality Violations
inferredcites →https://doi.org/10.1109/focs.2011.77openalex-snapshot
The Grothendieck Constant is Strictly Smaller than Krivine's Bound
inferredcites →https://doi.org/10.1109/fscs.1990.89520openalex-snapshot
Nondeterministic exponential time has two-prover interactive protocols
inferredcites →https://doi.org/10.1137/090772885openalex-snapshot
Unique Games with Entangled Provers Are Easy
inferredcites →https://doi.org/10.1137/s0097539704441629openalex-snapshot
Approximating the Cut-Norm via Grothendieck's Inequality
inferredcites →https://doi.org/10.1145/226643.226652openalex-snapshot
Interactive proofs and the hardness of approximating cliques
inferredcites →https://doi.org/10.1145/2488608.2488618openalex-snapshot
Efficient rounding for the noncommutative grothendieck inequality
inferredcites →https://doi.org/10.1145/258533.258536openalex-snapshot
Some optimal inapproximability results
inferredcites →https://doi.org/10.1145/273865.273901openalex-snapshot
Probabilistic checking of proofs
inferredcites →https://doi.org/10.1145/278298.278306openalex-snapshot
Proof verification and the hardness of approximation problems
inferredcites →https://doi.org/10.1145/509907.510017openalex-snapshot
On the power of unique 2-prover 1-round games
inferredcites →https://doi.org/10.1145/510014.510017openalex-snapshot
On the power of unique 2-prover 1-round games
inferredcites →https://doi.org/10.1145/62212.62223openalex-snapshot
Multi-prover interactive proofs: how to remove intractability
inferredcites →https://doi.org/10.26421/qic12.1-2-2openalex-snapshot
Bell violations through independent bases games
inferredcites →https://doi.org/10.48550/arxiv.0804.4118openalex-snapshot
Coherent state exchange in multi-prover quantum interactive proof systems
inferredcites →https://doi.org/10.48550/arxiv.1210.7656openalex-snapshot
Efficient Rounding for the Noncommutative Grothendieck Inequality
inferredcites →https://doi.org/10.7900/jot.2012jul02.1947openalex-snapshot
Elementary proofs of Grothendieck theorems for completely bounded norms
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-662-43948-7_69openalex-snapshot
Unbounded Entanglement Can Be Needed to Achieve the Optimal Success Probability
inferred← citeshttps://doi.org/10.1063/1.4974818openalex-snapshot
Perfect embezzlement of entanglement
inferred← citeshttps://doi.org/10.1093/imrn/rnv161openalex-snapshot
CB-Norm Estimates for Maps Between NoncommutativeLp-Spaces and Quantum Channel Theory
inferred← citeshttps://doi.org/10.1098/rspa.2016.0003openalex-snapshot
Extended non-local games and monogamy-of-entanglement games
inferred← citeshttps://doi.org/10.1103/physrevlett.133.261602openalex-snapshot
Relativistic Quantum Fields Are Universal Entanglement Embezzlers
inferred← citeshttps://doi.org/10.1109/tit.2018.2794391openalex-snapshot
Separation Between Quantum Lovász Number and Entanglement-Assisted Zero-Error Classical Capacity
inferred← citeshttps://doi.org/10.22331/q-2022-07-07-755openalex-snapshot
Constant gap between conventional strategies and those based on C*-dynamics for self-embezzlement
inferred← citeshttps://doi.org/10.22331/q-2025-04-18-1712openalex-snapshot
Lossy-and-Constrained Extended Non-Local Games with Applications to Quantum Cryptography
inferred← citeshttps://doi.org/10.22331/q-2025-07-30-1818openalex-snapshot
Multipartite Embezzlement of Entanglement
inferred← citeshttps://doi.org/10.26421/qic15.15-16-4openalex-snapshot
Unbounded entanglement in nonlocal games
inferred← citeshttps://doi.org/10.26421/qic18.7-8-6openalex-snapshot
Entanglement of approximate quantum strategies in XOR games
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.