On the public citation graph
Unique Games with Entangled Provers Are Easy
0 signed · 87 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/bf02392825openalex-snapshot
Clique is hard to approximate within n1−ε
inferredcites →https://doi.org/10.1007/s00037-006-0210-9openalex-snapshot
ON THE HARDNESS OF APPROXIMATING MULTICUT AND SPARSEST-CUT
inferredcites →https://doi.org/10.1007/s00220-008-0418-4openalex-snapshot
Unbounded Violation of Tripartite Bell Inequalities
inferredcites →https://doi.org/10.1016/j.jcss.2007.06.019openalex-snapshot
Vertex cover might be hard to approximate to within 2−ε
inferredcites →https://doi.org/10.1103/physicsphysiquefizika.1.195openalex-snapshot
On the Einstein Podolsky Rosen paradox
inferredcites →https://doi.org/10.1103/physrev.47.777openalex-snapshot
Can Quantum-Mechanical Description of Physical Reality Be Considered Complete?
inferredcites →https://doi.org/10.1103/physrevlett.23.880openalex-snapshot
Proposed Experiment to Test Local Hidden-Variable Theories
inferredcites →https://doi.org/10.1137/07068062xopenalex-snapshot
Conditional Hardness for Approximate Coloring
inferredcites →https://doi.org/10.1137/s0097539705447372openalex-snapshot
Optimal Inapproximability Results for MAX‐CUT and Other 2‐Variable CSPs?
inferredcites →https://doi.org/10.1137/s0097539795280895openalex-snapshot
A Parallel Repetition Theorem
inferredcites →https://doi.org/10.1145/227683.227684openalex-snapshot
Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
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/285055.285059openalex-snapshot
A threshold of ln n for approximating set cover
inferredcites →https://doi.org/10.4007/annals.2005.162.439openalex-snapshot
On the hardness of approximating vertex cover
inferredcites →https://doi.org/10.5555/2011339.2011340openalex-snapshot
Bell inequalities and entanglement
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-60231-4openalex-snapshot
Device-Independent Quantum Information Processing
inferred← citeshttps://doi.org/10.1007/978-3-030-60231-4_4openalex-snapshot
Introduction to the Showcases
inferred← citeshttps://doi.org/10.1007/978-3-662-47672-7_29openalex-snapshot
Interactive Proofs with Approximately Commuting Provers
inferred← citeshttps://doi.org/10.1007/s00220-012-1642-5openalex-snapshot
Explicit Lower and Upper Bounds on the Entangled Value of Multiplayer XOR Games
inferred← citeshttps://doi.org/10.1007/s00220-017-2880-3openalex-snapshot
Quantum de Finetti Theorems Under Local Measurements with Applications
inferred← citeshttps://doi.org/10.1007/s00453-025-01339-3openalex-snapshot
Decidability of Fully Quantum Nonlocal Games with Noisy Maximally Entangled States
inferred← citeshttps://doi.org/10.1007/s10044-018-0688-1openalex-snapshot
An implementation of optimized framework for action classification using multilayers neural network on selected fused features
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/s42979-020-00437-zopenalex-snapshot
Efficient Encoding of the Weighted MAX $$k$$-CUT on a Quantum Computer Using QAOA
inferred← citeshttps://doi.org/10.1038/s41467-018-06255-5openalex-snapshot
Steering is an essential feature of non-locality in quantum theory
inferred← citeshttps://doi.org/10.1063/1.4938052openalex-snapshot
Survey on nonlocal games and operator space theory
inferred← citeshttps://doi.org/10.1063/5.0290374openalex-snapshot
Unique games and games based on groups
inferred← citeshttps://doi.org/10.1088/1367-2630/18/4/045020openalex-snapshot
Linear game non-contextuality and Bell inequalities—a graph-theoretic approach
inferred← citeshttps://doi.org/10.1088/1751-8121/ab8f3eopenalex-snapshot
Generalized XOR non-locality games with graph description on a square lattice
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/physreva.89.022334openalex-snapshot
Strong connections between quantum encodings, nonlocality, and quantum cryptography
inferred← citeshttps://doi.org/10.1103/physreva.93.022305openalex-snapshot
Quantum bounds on multiplayer linear games and device-independent witness of genuine tripartite entanglement
inferred← citeshttps://doi.org/10.1103/physreva.93.022333openalex-snapshot
Generalized xor games with d outcomes and the task of nonlocal computation
inferred← citeshttps://doi.org/10.1103/physreva.96.022302openalex-snapshot
Approximate broadcasting of quantum correlations
inferred← citeshttps://doi.org/10.1103/physrevlett.114.020401openalex-snapshot
Nonlocality and Conflicting Interest Games
inferred← citeshttps://doi.org/10.1103/physrevlett.117.080401openalex-snapshot
Hierarchy of Efficiently Computable and Faithful Lower Bounds to Quantum Discord
inferred← citeshttps://doi.org/10.1103/physrevlett.122.190502openalex-snapshot
Complexity of Causal Order Structure in Distributed Quantum Information Processing: More Rounds of Classical Communication Reduce Entanglement Cost
inferred← citeshttps://doi.org/10.1103/revmodphys.96.045006openalex-snapshot
Semidefinite programming relaxations for quantum correlations
inferred← citeshttps://doi.org/10.1109/ccc.2011.30openalex-snapshot
Near-Optimal and Explicit Bell Inequality Violations
inferred← citeshttps://doi.org/10.1109/ccc.2014.29openalex-snapshot
A Parallel Repetition Theorem for Entangled Two-Player One-Round Games under Product Distributions
inferred← citeshttps://doi.org/10.1109/focs.2012.11openalex-snapshot
A Multi-prover Interactive Proof for NEXP Sound against Entangled Provers
inferred← citeshttps://doi.org/10.1109/focs.2013.87openalex-snapshot
Notice of Retraction: Three-Player Entangled XOR Games Are NP-Hard to Approximate
inferred← citeshttps://doi.org/10.1109/focs52979.2021.00125openalex-snapshot
A direct product theorem for quantum communication complexity with applications to device-independent QKD
inferred← citeshttps://doi.org/10.1109/focs61266.2024.00061openalex-snapshot
Approximation Algorithms for Noncommutative CSPs
inferred← citeshttps://doi.org/10.1137/140956622openalex-snapshot
Three-Player Entangled XOR Games are NP-Hard to Approximate
inferred← citeshttps://doi.org/10.1137/20m134592xopenalex-snapshot
Nonlocal Games with Noisy Maximally Entangled States are Decidable
inferred← citeshttps://doi.org/10.1137/23m1549353openalex-snapshot
A Direct Product Theorem for Quantum Communication Complexity with Applications to Device-Independent Cryptography
inferred← citeshttps://doi.org/10.1145/2090236.2090241openalex-snapshot
Quantum strategic game theory
inferred← citeshttps://doi.org/10.1145/2488608.2488718openalex-snapshot
Quantum de finetti theorems under local measurements with applications
inferred← citeshttps://doi.org/10.1145/3760771openalex-snapshot
The Computational Advantage of MIP* Vanishes in the Presence of Noise
inferred← citeshttps://doi.org/10.1214/20-ps356openalex-snapshot
Geometry of information structures, strategic measures and associated stochastic control topologies
inferred← citeshttps://doi.org/10.22331/q-2021-06-17-479openalex-snapshot
Warm-starting quantum optimization
inferred← citeshttps://doi.org/10.26421/qic13.1-2-8openalex-snapshot
QMA variants with polynomially many provers
inferred← citeshttps://doi.org/10.3390/e23020154openalex-snapshot
Tripartite Dynamic Zero-Sum Quantum Games
inferred← citeshttps://doi.org/10.34133/icomputing.0108openalex-snapshot
A Quantum-Classical Method Applied to Material Design: Photochromic Materials Optimization for Photopharmacology Applications
inferred← citeshttps://doi.org/10.3929/ethz-a-007339744openalex-snapshot
Tensor Norms And Non-Locality
inferred← citeshttps://doi.org/10.3929/ethz-b-000035795openalex-snapshot
The Hilbertian tensor norm and entangled two-prover games
inferred← citeshttps://doi.org/10.3929/ethz-b-000298420openalex-snapshot
Reductions to IID in Device-independent Quantum Information Processing
inferred← citeshttps://doi.org/10.4230/lipics.ccc.2021.27openalex-snapshot
A Direct Product Theorem for One-Way Quantum Communication
inferred← citeshttps://doi.org/10.4230/lipics.icalp.2021.82openalex-snapshot
Quasi-Polynomial Time Algorithms for Free Quantum Games in Bounded Dimension
inferred← citeshttps://doi.org/10.4230/lipics.tqc.2014.24openalex-snapshot
On the Parallel Repetition of Multi-Player Games: The No-Signaling Case
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.48550/arxiv.1009.0771openalex-snapshot
Embezzlement States are Universal for Non-Local Strategies
inferred← citeshttps://doi.org/10.48550/arxiv.1301.2632openalex-snapshot
Approximation, Proof Systems, and Correlations in a Quantum World
inferred← citeshttps://doi.org/10.48550/arxiv.1302.1242openalex-snapshot
Three-player entangled XOR games are NP-hard to approximate
inferred← citeshttps://doi.org/10.48550/arxiv.1310.3794openalex-snapshot
Binary Constraint System Games and Locally Commutative Reductions
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.1510.00102openalex-snapshot
Interactive proofs with approximately commuting provers
inferred← citeshttps://doi.org/10.48550/arxiv.1801.00821openalex-snapshot
Algorithms, Bounds, and Strategies for Entangled XOR Games
inferred← citeshttps://doi.org/10.48550/arxiv.1904.08832openalex-snapshot
A doubly exponential upper bound on noisy EPR states for binary games
inferred← citeshttps://doi.org/10.48550/arxiv.1905.07162openalex-snapshot
Non-signaling Approximations of Stochastic Team Problems
inferred← citeshttps://doi.org/10.48550/arxiv.2005.08883openalex-snapshot
Quasi-polynomial time algorithms for free quantum games in bounded dimension
inferred← citeshttps://doi.org/10.48550/arxiv.2010.07377openalex-snapshot
Geometry of Information Structures, Strategic Measures and associated Control Topologies
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.