The paper's claimed collapses of quantum-classical PCPs and the quantum polynomial hierarchy rest on invalid reductions, so the main theorems are unsupported.
Proof verification and the hardness of approximation problems
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
quant-ph 1years
2025 1verdicts
REJECT 1representative citing papers
citing papers explorer
-
Collapses in quantum-classical probabilistically checkable proofs and the quantum polynomial hierarchy
The paper's claimed collapses of quantum-classical PCPs and the quantum polynomial hierarchy rest on invalid reductions, so the main theorems are unsupported.