A new distribution of underdetermined degree-3 polynomial systems over F2 is provably solvable by an expected polynomial-time quantum algorithm, with classical hardness conjectured, yielding a candidate non-relativized quantum advantage.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
quant-ph 1years
2025 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Quantum Advantage via Solving Multivariate Polynomials
A new distribution of underdetermined degree-3 polynomial systems over F2 is provably solvable by an expected polynomial-time quantum algorithm, with classical hardness conjectured, yielding a candidate non-relativized quantum advantage.