Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2610.03648

Separating QMA from QCIP with a Classical Oracle, or, the Power of Quantum Proofs over Classical Interaction for Quantum Verifiers

Alper Cakan
View original source ↗Read source document ↗Export metadata ↓

Abstract

Whether some problems require quantum proofs has been a central question in quantum complexity (Aharonov and Naveh, 2002; Aaronson and Kuperberg, CCC 2007). Recently, breakthrough work of Bostanci, Haferkamp, Nirkhe, and Zhandry (STOC 2026), followed by a simpler separation due to Bostanci, Huang, and Vaikuntanathan (FOCS 2026), established a classical oracle separation between $\mathsf{QMA}$ and $\mathsf{QCMA}$. However, while they are not in $\mathsf{QCMA}$, the problems used in both separations still lie in $\mathsf{AM}$: they admit a two-message public-coin proof system with a classical verifier. In this work, we ask whether some problems truly require quantum proofs. More formally, we consider the complexity class $\mathsf{QCIP}$, introduced by Buhrman, Le Gall, and Weggemans (2024), where an efficient quantum verifier interacts with an unbounded prover over a classical channel for an arbitrary polynomial number of rounds. We construct a classical oracle $\mathcal{O}$ such that $\mathsf{QMA}^{\mathcal{O}}\not\subseteq\mathsf{QCIP}^{\mathcal{O}}$, thus showing that some languages indeed require quantum proofs, with no classical replacements. Since $\mathsf{QCMA}=\mathsf{QCIP}[1]$, this strengthens the earlier $\mathsf{QMA}$--$\mathsf{QCMA}$ separations, which now follow as a special case of our result. As a technical contribution, we extend to the complexity theory setting the techniques developed by Cakan, Goyal, and Shmueli (CRYPTO 2026) in the context of cryptography for analyzing classically interacting quantum machines. We believe this may be of independent interest.

Explore related subjects

cs.CC

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Alper Cakan. 2026-10-02. Separating QMA from QCIP with a Classical Oracle, or, the Power of Quantum Proofs over Classical Interaction for Quantum Verifiers. https://arxiv.org/abs/2610.03648

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Nonuniform QCPH Collapse Implies QCPH Collapse

Despite the importance of the non-uniform Polynomial-Time Hierarchy (PH/poly) in classical complexity understanding the collapse conditions of the Polynomial-Time Hierarchy (PH), a quantum equivalent of PH/poly has yet to be studied in the literature. We introduce the non-uniform computational Quantum Polynomial-Time Hierarchy (QCPH/mpoly), the quantum equivalent of PH/poly, and show that it collapses if and only if QCPH, the quantum equivalent of PH introduced by Gharibian et al. (comput. complex. 2022), also collapses. We also show that QCPH collapses if coQCMA is contained in QCMA/mpoly. These results are analogous to those of Yap (TCS 1983) commonly used to invoke the collapse of PH in classical complexity. QCPH/mpoly is analogous to QCPH with non-uniform quantum verifier circuits.

cs.CC↗
arXiv2026

Strictly Unfriendly $k$-Partitions: Sharp Degree Thresholds and ETH-Based Lower Bounds

We present a complete complexity classification and fine-grained analysis for the Strictly Unfriendly $k$-Partition problem ($\text{SU}k\text{P}$), which asks whether the vertices of a graph can be partitioned into $k$ classes such that every vertex has strictly more neighbors in each of the other $k-1$ classes than in its own. We first establish a sharp tractability-intractability threshold with respect to the maximum degree $Δ$: for $k \in \{2, 3\}$, $\text{SU}k\text{P}$ is solvable in polynomial time when $Δ\le 2$, but becomes $\mathbf{NP}$-hard and ETH-hard immediately on subcubic graphs ($Δ= 3$), resolving the degree limitations in prior work and establishing subcubic graphs as the precise frontier of intractability. Furthermore, under the Exponential Time Hypothesis (ETH), we establish the first fine-grained lower bounds via direct reductions from $(3,3)$-SAT. On general graphs, we establish a uniform lower bound across all partition parameters $k \ge 2$, revealing a striking complexity convergence where the core exponential complexity remains invariant despite technical divergences in gadget constructions. On subcubic graphs, we formally quantify the "cost of sparsity," deriving explicit lower bound constants to demonstrate how enforced structural degree restrictions degrade reduction efficiency.

cs.CC↗
arXiv2026

$Ψ$-TM: An Exact Rounds-versus-Queries Trade-off for Pointer Chasing, Machine-Checked in Lean 4

An algorithm that reads its input through queries is adaptive if it may choose a query after seeing the answers to earlier ones. We ask how much adaptivity is worth when queries are issued in rounds. In the model, called $Ψ$-TM, the input is reachable only through an interface that returns the content of a queried cell; in each round an algorithm submits a batch of cells, chosen from the answers of earlier rounds only. Depth is the number of rounds and cost is the number of cells read, as for deterministic decision trees of bounded adaptivity. For $k$-step pointer chasing over $k$ tables of $m \geq 2$ entries we determine the cost at every depth: for $1 \leq d \leq k$, the least worst-case number of reads of a deterministic algorithm with at most $d$ rounds is exactly $(k-d)m+d$. Each round removed costs exactly $m-1$ additional reads; $k$ rounds need $k$ reads, $k-1$ rounds need $m+k-1$ (for $k \geq 2$), and no algorithm without rounds decides the problem. The lower bound comes from an adversary that answers every query to entry $a$ of a table with $a$ itself, except at the first unread cell of the chain, which it uses to steer the chain to a cell the algorithm has not read. The query model, the problem and the theorem, for every number of rounds, are formalised in Lean 4 without Mathlib; the proofs contain no sorry and use only the axioms propext and Quot.sound. An exhaustive search over all strategies confirms the formula independently for small parameters.

cs.CC↗