On the public citation graph
A Parallel Repetition Theorem for Entangled Two-Player One-Round Games under Product Distributions
0 signed · 57 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/978-3-642-03685-9_27openalex-snapshot
Strong Parallel Repetition Theorem for Free Projection Games
inferredcites →https://doi.org/10.1007/978-3-662-43948-7_25openalex-snapshot
Parallel Repetition of Entangled Games with Exponential Decay via the Superposed Information Cost
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.1038/ncomms1244openalex-snapshot
Secure device-independent quantum key distribution with causally independent measurement devices
inferredcites →https://doi.org/10.1088/1367-2630/15/10/103002openalex-snapshot
A monogamy-of-entanglement game with applications to device-independent quantum cryptography
inferredcites →https://doi.org/10.1103/physrevlett.23.880openalex-snapshot
Proposed Experiment to Test Local Hidden-Variable Theories
inferredcites →https://doi.org/10.1109/ccc.2012.11openalex-snapshot
A Strong Parallel Repetition Theorem for Projection Games on Expanders
inferredcites →https://doi.org/10.1109/ccc.2014.28openalex-snapshot
A Parallel Repetition Theorem for Entangled Projection Games
inferredcites →https://doi.org/10.1109/focs.2008.49openalex-snapshot
A Counterexample to Strong Parallel Repetition
inferredcites →https://doi.org/10.1109/sfcs.2003.1238196openalex-snapshot
A lower bound for the bounded round quantum communication complexity of set disjointness
inferredcites →https://doi.org/10.1119/1.1463744openalex-snapshot
Quantum Computation and Quantum Information
inferredcites →https://doi.org/10.1137/080734042openalex-snapshot
Parallel Repetition in Projection Games and a Concentration Bound
inferredcites →https://doi.org/10.1137/090772885openalex-snapshot
Unique Games with Entangled Provers Are Easy
inferredcites →https://doi.org/10.1137/s0097539797325375openalex-snapshot
Two-Prover Protocols---Low Error at Affordable Rates
inferredcites →https://doi.org/10.1145/1132516.1132553openalex-snapshot
The PCP theorem by gap amplification
inferredcites →https://doi.org/10.1145/1993636.1993684openalex-snapshot
Parallel repetition of entangled games
inferredcites →https://doi.org/10.1145/2591796.2591884openalex-snapshot
Analytical approach to parallel repetition
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/505482.505499openalex-snapshot
Quantum computation and quantum information
inferredcites →https://doi.org/10.1145/62212.62223openalex-snapshot
Multi-prover interactive proofs: how to remove intractability
inferredcites →https://doi.org/10.48550/arxiv.0807.1267openalex-snapshot
Optimal Direct Sum and Privacy Trade-off Results for Quantum and Classical Communication Complexity
inferredcites →https://doi.org/10.48550/arxiv.1009.1833openalex-snapshot
Device-Independent Quantum Key Distribution with Commuting Measurements
inferredcites →https://doi.org/10.48550/arxiv.1305.1979openalex-snapshot
Analytical Approach to Parallel Repetition
inferredcites →https://doi.org/10.48550/arxiv.1310.4113openalex-snapshot
A parallel repetition theorem for entangled projection games
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_25openalex-snapshot
Parallel Repetition of Entangled Games with Exponential Decay via the Superposed Information Cost
inferred← citeshttps://doi.org/10.1007/s00023-024-01426-1openalex-snapshot
Synchronous Values of Games
inferred← citeshttps://doi.org/10.1007/s00037-015-0098-3openalex-snapshot
A parallel repetition theorem for entangled projection games
inferred← citeshttps://doi.org/10.1109/ccc.2014.28openalex-snapshot
A Parallel Repetition Theorem for Entangled Projection Games
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/tit.2016.2516022openalex-snapshot
Non-Signaling Parallel Repetition Using de Finetti Reductions
inferred← citeshttps://doi.org/10.1109/tit.2020.2986740openalex-snapshot
Parallel Device-Independent Quantum Key Distribution
inferred← citeshttps://doi.org/10.1109/tit.2025.3530385openalex-snapshot
Split-State Non-Malleable Codes and Secret Sharing Schemes for Quantum Messages
inferred← citeshttps://doi.org/10.1137/21m1405927openalex-snapshot
Anchored Parallel Repetition for Nonlocal Games
inferred← citeshttps://doi.org/10.1145/2591796.2591884openalex-snapshot
Analytical approach to parallel repetition
inferred← citeshttps://doi.org/10.1145/2746539.2746565openalex-snapshot
Small Value Parallel Repetition for General Games
inferred← citeshttps://doi.org/10.1145/2746539.2746613openalex-snapshot
Quantum Information Complexity
inferred← citeshttps://doi.org/10.1145/3055399.3055433openalex-snapshot
Hardness amplification for entangled games via anchoring
inferred← citeshttps://doi.org/10.1145/3519935.3519949openalex-snapshot
Nonlocal games, compression theorems, and the arithmetical hierarchy
inferred← citeshttps://doi.org/10.22331/q-2023-07-06-1047openalex-snapshot
Composably secure device-independent encryption with certified deletion
inferred← citeshttps://doi.org/10.22331/q-2025-01-08-1582openalex-snapshot
Device-independent uncloneable encryption
inferred← citeshttps://doi.org/10.3390/e23020154openalex-snapshot
Tripartite Dynamic Zero-Sum Quantum Games
inferred← citeshttps://doi.org/10.3929/ethz-b-000279745openalex-snapshot
Noise-Tolerant Testing of High Entanglement of Formation
inferred← citeshttps://doi.org/10.4036/iis.2015.l.01openalex-snapshot
Parallel Repetition of Two-Prover One-Round Games: An Exposition
inferred← citeshttps://doi.org/10.4230/lipics.ccc.2015.512openalex-snapshot
Parallel Repetition for Entangled k-player Games via Fast Quantum Search
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.2016.77openalex-snapshot
A Parallel Repetition Theorem for All Entangled Games
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.48550/arxiv.1310.4113openalex-snapshot
A parallel repetition theorem for entangled projection games
inferred← citeshttps://doi.org/10.48550/arxiv.1411.1397openalex-snapshot
Strong parallel repetition for free entangled games, with any number of players
inferred← citeshttps://doi.org/10.48550/arxiv.1603.05349openalex-snapshot
Parallel repetition via fortification: analytic view and the quantum case
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.