On the public citation graph
The Power of Unentanglement
0 signed · 52 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.1007/s00220-003-0981-7openalex-snapshot
Equivalence of Additivity Questions in Quantum Information Theory
inferredcites →https://doi.org/10.1016/0022-0000(91)90023-xopenalex-snapshot
Optimization, approximation, and complexity classes
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.1063/1.1643788openalex-snapshot
“Squashed entanglement”: An additive entanglement measure
inferredcites →https://doi.org/10.1063/1.2146188openalex-snapshot
A de Finetti representation for finite symmetric quantum states
inferredcites →https://doi.org/10.1103/physreva.54.3824openalex-snapshot
Mixed-state entanglement and quantum error correction
inferredcites →https://doi.org/10.1103/physreva.57.1619openalex-snapshot
Entanglement measures and purification procedures
inferredcites →https://doi.org/10.1103/physrevlett.70.1895openalex-snapshot
Teleporting an unknown quantum state via dual classical and Einstein-Podolsky-Rosen channels
inferredcites →https://doi.org/10.1103/physrevlett.71.4287openalex-snapshot
‘‘Event-ready-detectors’’ Bell experiment via entanglement swapping
inferredcites →https://doi.org/10.1103/physrevlett.98.110503openalex-snapshot
Quantum Computational Complexity of the N -Representability Problem: QMA Complete
inferredcites →https://doi.org/10.1109/sfcs.2000.892141openalex-snapshot
Succinct quantum proofs for properties of finite groups
inferredcites →https://doi.org/10.1109/tit.2007.896888openalex-snapshot
Interaction in Quantum Communication
inferredcites →https://doi.org/10.1119/1.1463744openalex-snapshot
Quantum Computation and Quantum Information
inferredcites →https://doi.org/10.1137/s0097539795280895openalex-snapshot
A Parallel Repetition Theorem
inferredcites →https://doi.org/10.1137/s0097539796300933openalex-snapshot
Strengths and Weaknesses of Quantum Computing
inferredcites →https://doi.org/10.1137/s0097539799349948openalex-snapshot
The Approximability of Constraint Satisfaction Problems
inferredcites →https://doi.org/10.1145/1132516.1132553openalex-snapshot
The PCP theorem by gap amplification
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.26421/qic8.1-2-6openalex-snapshot
On the role of shared entanglement
inferredcites →https://doi.org/10.48550/arxiv.quant-ph/0210077openalex-snapshot
Quantum NP - A Survey
inferredcites →https://doi.org/10.48550/arxiv.quant-ph/0306051openalex-snapshot
Quantum Merlin-Arthur Proof Systems: Are Multiple Merlins More Helpful to Arthur?
inferredcites →https://doi.org/10.48550/arxiv.quant-ph/0510230openalex-snapshot
QMA/qpoly Is Contained In PSPACE/poly: De-Merlinizing Quantum Protocols
inferredcites →https://doi.org/10.48550/arxiv.quant-ph/9610012openalex-snapshot
Quantum Randomness and Nondeterminism
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-032-06754-8_10openalex-snapshot
The Role of Piracy in Quantum Proofs
inferred← citeshttps://doi.org/10.1007/s00037-011-0016-2openalex-snapshot
A Quantum Characterization Of NP
inferred← citeshttps://doi.org/10.1007/s00220-012-1446-7openalex-snapshot
Entanglement of the Antisymmetric State
inferred← citeshttps://doi.org/10.1007/s00220-017-2859-0openalex-snapshot
An Improved Semidefinite Programming Hierarchy for Testing Entanglement
inferred← citeshttps://doi.org/10.1038/s41467-019-12139-zopenalex-snapshot
Experimental demonstration of quantum advantage for one-way communication complexity surpassing best-known classical protocol
inferred← citeshttps://doi.org/10.1038/s41467-021-21119-1openalex-snapshot
Experimental demonstration of quantum advantage for NP verification with limited information
inferred← citeshttps://doi.org/10.1038/s41467-024-54201-5openalex-snapshot
Distillable entanglement under dually non-entangling operations
inferred← citeshttps://doi.org/10.1109/ccc.2012.42openalex-snapshot
The Complexity of the Separable Hamiltonian Problem
inferred← citeshttps://doi.org/10.1109/ccc.2014.12openalex-snapshot
On Physical Problems that are Slightly More Difficult than QMA
inferred← citeshttps://doi.org/10.1109/focs.2008.57openalex-snapshot
Quantum Multi Prover Interactive Proofs with Communicating Provers
inferred← citeshttps://doi.org/10.1109/icqnm.2009.21openalex-snapshot
All Languages in NP Have Very Short Quantum Proofs
inferred← citeshttps://doi.org/10.1145/3488559openalex-snapshot
Open Problems Related to Quantum Query Complexity
inferred← citeshttps://doi.org/10.1145/3564246.3585248openalex-snapshot
The Power of Unentangled Quantum Proofs with Non-negative Amplitudes
inferred← citeshttps://doi.org/10.1145/3802807.3802814openalex-snapshot
The QMA(2) UniverseComplexity, Entanglement, and Optimization
inferred← citeshttps://doi.org/10.1364/cleo_qels.2021.fth2n.5openalex-snapshot
Experimental demonstration of quantum advantage for NP verification
inferred← citeshttps://doi.org/10.3929/ethz-b-000047857openalex-snapshot
Entanglement of the Antisymmetric State
inferred← citeshttps://doi.org/10.48550/arxiv.0908.3491openalex-snapshot
Entangled games do not require much entanglement (withdrawn)
inferred← citeshttps://doi.org/10.48550/arxiv.1312.4758openalex-snapshot
On physical problems that are slightly more difficult than QMA
inferred← citeshttps://doi.org/10.48550/arxiv.1510.08447openalex-snapshot
An exponential time upper bound for Quantum Merlin-Arthur games with unentangled provers
inferred← citeshttps://doi.org/10.48550/arxiv.2102.05227openalex-snapshot
Continuous Variable Quantum Advantages and Applications in Quantum Optics
inferred← citeshttps://doi.org/10.70675/3d77bdc3zadd1z4d1az8ae6zf516db82f794openalex-snapshot
Continuous variable quantum advantages and applications in quantum optics
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.