On the public citation graph
Upper bounds for quantum interactive proofs with competing provers
0 signed · 34 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-540-31856-9_50openalex-snapshot
Quantum Interactive Proofs with Competing Provers
inferredcites →https://doi.org/10.1007/978-3-642-97881-4openalex-snapshot
Geometric Algorithms and Combinatorial Optimization
inferredcites →https://doi.org/10.1016/0022-0000(84)90034-5openalex-snapshot
The complexity of two-player games of incomplete information
inferredcites →https://doi.org/10.1016/0022-0000(88)90028-1openalex-snapshot
Arthur-Merlin games: A randomized proof system, and a hierarchy of complexity classes
inferredcites →https://doi.org/10.1016/0022-0000(92)90021-aopenalex-snapshot
Multi-oracle interactive protocols with constant space verifiers
inferredcites →https://doi.org/10.1016/0041-5553(80)90061-0openalex-snapshot
Polynomial algorithms in linear programming
inferredcites →https://doi.org/10.1016/0899-8256(92)90035-qopenalex-snapshot
The complexity of two-person zero-sum games in extensive form
inferredcites →https://doi.org/10.1016/s0022-0000(03)00035-7openalex-snapshot
Quantum multi-prover interactive proof systems with limited prior entanglement
inferredcites →https://doi.org/10.1016/s0304-3975(01)00375-9openalex-snapshot
PSPACE has constant-round quantum interactive proof systems
inferredcites →https://doi.org/10.1109/sct.1995.514861openalex-snapshot
A game-theoretic classification of interactive complexity classes
inferredcites →https://doi.org/10.1137/0218012openalex-snapshot
The Knowledge Complexity of Interactive Proof Systems
inferredcites →https://doi.org/10.1137/0805002openalex-snapshot
Interior Point Methods in Semidefinite Programming with Applications to Combinatorial Optimization
inferredcites →https://doi.org/10.1137/1.9781611970791openalex-snapshot
Interior-Point Polynomial Algorithms in Convex Programming
inferredcites →https://doi.org/10.1145/146585.146605openalex-snapshot
Algebraic methods for interactive proof systems
inferredcites →https://doi.org/10.1145/22145.22192openalex-snapshot
Trading group theory for randomness
inferredcites →https://doi.org/10.1145/258533.258644openalex-snapshot
Making games short (extended abstract)
inferredcites →https://doi.org/10.1145/276698.276708openalex-snapshot
Quantum circuits with mixed states
inferredcites →https://doi.org/10.1145/335305.335387openalex-snapshot
Parallelization, amplification, and exponential time simulation of quantum interactive proof systems
inferredcites →https://doi.org/10.1145/62212.62223openalex-snapshot
Multi-prover interactive proofs: how to remove intractability
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/s00224-022-10105-9openalex-snapshot
Complexity Limitations on One-turn Quantum Refereed Games
inferred← citeshttps://doi.org/10.1109/ccc.2009.26openalex-snapshot
Parallel Approximation of Non-interactive Zero-sum Quantum Games
inferred← citeshttps://doi.org/10.1109/ccc.2012.12openalex-snapshot
Parallel Approximation of Min-max Problems with Applications to Classical and Quantum Zero-Sum Games
inferred← citeshttps://doi.org/10.1145/1250790.1250873openalex-snapshot
Toward a general theory of quantum games
inferred← citeshttps://doi.org/10.22331/q-2025-05-06-1737openalex-snapshot
A Quadratic Speedup in Finding Nash Equilibria of Quantum Zero-Sum Games
inferred← citeshttps://doi.org/10.48550/arxiv.1004.0264openalex-snapshot
Equilibrium Value Method for the Proof of QIP=PSPACE
inferred← citeshttps://doi.org/10.48550/arxiv.cs/0511049openalex-snapshot
Entropy, Convex Optimization, and Competitive Quantum Interactions
inferred← citeshttps://doi.org/10.71781/9824openalex-snapshot
Multi-Prover and parallel repetition in non-classical interactive 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.