Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2610.04423

Nonuniform QCPH Collapse Implies QCPH Collapse

Jeremy Ahrens Huang
View original source ↗Read source document ↗Export metadata ↓

Abstract

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.

Explore related subjects

cs.CCquant-ph

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Jeremy Ahrens Huang. 2026-10-03. Nonuniform QCPH Collapse Implies QCPH Collapse. https://arxiv.org/abs/2610.04423

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

KEEP EXPLORING

Related papers

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↗
arXiv2026

Strassen's support functionals coincide with the quantum functionals

Strassen's asymptotic spectrum offers a framework for analyzing the complexity of tensors. It has found applications in diverse areas, from computer science to additive combinatorics and quantum information. A long-standing open problem, dating back to 1991, asks whether Strassen's support functionals are universal spectral points, that is, points in the asymptotic spectrum of tensors. In this paper, we answer this question in the affirmative for tensors over complex numbers by proving that the support functionals coincide with the quantum functionals - universal spectral points that are defined via entropy optimization on entanglement polytopes. We obtain this result as a special case of a general minimax formula for convex optimization on entanglement polytopes (and more general moment polytopes). Our formula can be interpreted as a very general "classical-quantum correspondence" analogous to the well-known relation between the Shannon entropy and the von Neumann entropy. Its proof is based on a recent Fenchel-type duality theorem on Hadamard manifolds due to Hirai. In addition to settling Strassen's question, our results yield a unified and simpler approach to several other tensor invariants, including the asymptotic slice rank, the symmetric quantum functional, the $G$-stable rank, and the non-commutative rank.

cs.CC↗