← 研踪 PaperTrailarXiv:2611.12746 · v1
$\mathsf{EQP}\subseteq\mathsf{IP}$ Does Not Relativize
EQP⊆IP 不相对化
首次提交 2026-11-10 01:28
版本更新 2026-11-10 01:28
雷达观测 2026-11-10 15:22
摘要
We construct a recursive oracle and a unary language , strengthening the versus oracle separation of Bouland et al. to exact quantum computation. The separation is based on a variant of the Forrelation problem in which the normalized correlation of one Boolean function with the Fourier transform of another is promised to be exactly or . The main technical contribution is a repair method that constructs distributions supported on these exact levels while preserving the indistinguishability needed for the and lower bounds. A uniform polynomial-time quantum algorithm distinguishes the two cases with certainty using only three oracle queries.
作者备注:50 pages, 1 figure, 2 tables
观测到的版本
相邻记录可能跳过中间版本;首次发现 v2 及以上也会标为版本更新。
v1 · 2026-11-10 01:28 · 最新观测版本
$\mathsf{EQP}\subseteq\mathsf{IP}$ Does Not Relativize
We construct a recursive oracle and a unary language , strengthening the versus oracle separation of Bouland et al. to exact quantum computation. The separation is based on a variant of the Forrelation problem in which the normalized correlation of one Boolean function with the Fourier transform of another is promised to be exactly or . The main technical contribution is a repair method that constructs distributions supported on these exact levels while preserving the indistinguishability needed for the and lower bounds. A uniform polynomial-time quantum algorithm distinguishes the two cases with certainty using only three oracle queries.
查看此版本解读 →查看此版本原文 ↗