跳到正文
研踪PaperTrail
← 研踪 PaperTrail

arXiv: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
arXiv ↗PDF ↗

摘要

We construct a recursive oracle OO and a unary language L∈EQPO∖(IPO∪PHO)L\in\mathsf{EQP}^O\setminus(\mathsf{IP}^O\cup\mathsf{PH}^O), strengthening the BQP\mathsf{BQP} versus IP\mathsf{IP} 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 +1/2+1/2 or −1/2-1/2. The main technical contribution is a repair method that constructs distributions supported on these exact levels while preserving the indistinguishability needed for the IP\mathsf{IP} and PH\mathsf{PH} 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

AI 论文解读

基于摘要 · 非全文审阅

作者构造递归预言机 O 与一元语言 L,使 L 属于 EQP^O 但不属于 IP^O∪PH^O,从而把 BQP 与 IP 的预言机分离强化到精确量子计算。

正在读取账号与研究记录…

版本差异

目前只收录了一个版本。收录下一版后,可以对照标题、作者、分类和摘要。

观测到的版本

相邻记录可能跳过中间版本;首次发现 v2 及以上也会标为版本更新。

v1 · 2026-11-10 01:28 · 最新观测版本

$\mathsf{EQP}\subseteq\mathsf{IP}$ Does Not Relativize

We construct a recursive oracle OO and a unary language L∈EQPO∖(IPO∪PHO)L\in\mathsf{EQP}^O\setminus(\mathsf{IP}^O\cup\mathsf{PH}^O), strengthening the BQP\mathsf{BQP} versus IP\mathsf{IP} 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 +1/2+1/2 or −1/2-1/2. The main technical contribution is a repair method that constructs distributions supported on these exact levels while preserving the indistinguishability needed for the IP\mathsf{IP} and PH\mathsf{PH} lower bounds. A uniform polynomial-time quantum algorithm distinguishes the two cases with certainty using only three oracle queries.

查看此版本解读 →查看此版本原文 ↗