Deciding circuit width w(f) ≤ k for degree-3 polynomials with no constant term is NP-complete, with 49/48-ε inapproximability, ETH lower bounds, and FPT algorithms.
Average-case complexity versus approximate simulation of commuting quantum computations
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
years
2026 2verdicts
UNVERDICTED 2representative citing papers
Sparse qubit connectivity raises compiled depth in noisy IQP circuits, requiring lower effective noise to remain outside the classically simulatable regime compared to fully connected layouts.
citing papers explorer
-
On the Complexity of the Circuit Width Problem
Deciding circuit width w(f) ≤ k for degree-3 polynomials with no constant term is NP-complete, with 49/48-ε inapproximability, ETH lower bounds, and FPT algorithms.
-
The Impact of Qubit Connectivity on Quantum Advantage in Noisy IQP Circuits
Sparse qubit connectivity raises compiled depth in noisy IQP circuits, requiring lower effective noise to remain outside the classically simulatable regime compared to fully connected layouts.