On the public citation graph
QMA/qpoly \subseteq PSPACE/poly: De-Merlinizing Quantum Protocols
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.1006/jcss.1999.1655openalex-snapshot
Space-Bounded Quantum Complexity
inferredcites →https://doi.org/10.1007/978-3-540-24587-2_21openalex-snapshot
Quantum Merlin-Arthur Proof Systems: Are Multiple Merlins More Helpful to Arthur?
inferredcites →https://doi.org/10.1007/s00037-005-0194-xopenalex-snapshot
Quantum Arthur–Merlin games
inferredcites →https://doi.org/10.1016/0020-0190(91)90157-dopenalex-snapshot
Private vs. common random bits in communication complexity
inferredcites →https://doi.org/10.1098/rspa.2005.1546openalex-snapshot
Quantum computing, postselection, and probabilistic polynomial-time
inferredcites →https://doi.org/10.1109/ccc.2007.27openalex-snapshot
Quantum versus Classical Proofs and Advice
inferredcites →https://doi.org/10.1109/sfcs.2005.62openalex-snapshot
Quantum Information and the PCP Theorem
inferredcites →https://doi.org/10.1109/sffcs.1999.814608openalex-snapshot
Optimal lower bounds for quantum automata and random access codes
inferredcites →https://doi.org/10.1119/1.1463744openalex-snapshot
Quantum Computation and Quantum Information
inferredcites →https://doi.org/10.1145/12130.12137openalex-snapshot
Private coins versus public coins in interactive proof systems
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/505482.505499openalex-snapshot
Quantum computation and quantum information
inferredcites →https://doi.org/10.48550/arxiv.quant-ph/0005032openalex-snapshot
Quantum Communication Complexity
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-024-10208-5openalex-snapshot
Rewindable Quantum Computation and Its Equivalence to Cloning and Adaptive Postselection
inferred← citeshttps://doi.org/10.1088/1751-8113/49/19/195302openalex-snapshot
The classical-quantum channel with random state parameters known to the sender
inferred← citeshttps://doi.org/10.1098/rspa.2007.0113openalex-snapshot
The learnability of quantum states
inferred← citeshttps://doi.org/10.1098/rspa.2008.0350openalex-snapshot
Closed timelike curves make quantum and classical computing equivalent
inferred← citeshttps://doi.org/10.1098/rspa.2016.0076openalex-snapshot
Bounds on the power of proofs and advice in general physical theories
inferred← citeshttps://doi.org/10.1109/ccc.2011.33openalex-snapshot
On Arthur Merlin Games in Communication Complexity
inferred← citeshttps://doi.org/10.1109/isit.2006.261708openalex-snapshot
(4, 1)-Quantum Random Access Coding Does Not Exist
inferred← citeshttps://doi.org/10.1109/isit.2018.8437775openalex-snapshot
A Hypothesis Testing Approach for Communication Over Entanglement Assisted Compound Quantum Channel
inferred← citeshttps://doi.org/10.1109/tit.2018.2876280openalex-snapshot
A Hypothesis Testing Approach for Communication Over Entanglement-Assisted Compound Quantum Channel
inferred← citeshttps://doi.org/10.1145/1806689.1806710openalex-snapshot
A full characterization of quantum advice
inferred← citeshttps://doi.org/10.1145/2422436.2422471openalex-snapshot
Streaming computations with a loquacious prover
inferred← citeshttps://doi.org/10.1587/transfun.e92.a.1268openalex-snapshot
Quantum Random Access Coding
inferred← citeshttps://doi.org/10.22331/q-2025-04-18-1717openalex-snapshot
Lower Bounds for Unitary Property Testing with Proofs and Advice
inferred← citeshttps://doi.org/10.26421/qic13.1-2-8openalex-snapshot
QMA variants with polynomially many provers
inferred← citeshttps://doi.org/10.48550/arxiv.1802.09025openalex-snapshot
Online Learning of Quantum States
inferred← citeshttps://doi.org/10.48550/arxiv.2011.08487openalex-snapshot
Notes on distinguishability of postselected computations
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.