arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2601.03243cs.CCquant-ph
收藏

QAC⁰包含TC⁰(带有多个输入副本)

$\mathsf{QAC}^0$ Contains $\mathsf{TC}^0$ (with Many Copies of the Input)

UCSD(加州大学圣地亚哥分校);Institute for Advanced Study(高等研究院)

Daniel Grier, Jackson Morris, Kewen Wu

AI总结:

本文证明QAC⁰电路在给定多个输入副本时能计算TC⁰函数,并展示了QAC⁰不包含AC⁰[p]的无条件分离。

摘要:

QAC⁰是常数深度多项式大小的量子电路所构成的类,由任意单量子比特门和广义托夫利门组成。尽管如此,许多尝试将经典AC⁰下界移植到QAC⁰上都失败了。我们给出一个可能的解释:QAC⁰电路比其经典对应物强大得多。我们证明了决策问题中QAC⁰不包含AC⁰[p]的无条件分离,这首次解决了AC⁰是否比QAC⁰更强大。此外,我们证明,如果给定多个输入副本,QAC⁰电路可以计算广泛布尔函数:TC⁰⊆QAC⁰∘NC⁰。在此过程中,我们引入了一种幅度放大技术,使多个近似常深度构造变得精确。

英文摘要:

$\mathsf{QAC}^0$ is the class of constant-depth polynomial-size quantum circuits constructed from arbitrary single-qubit gates and generalized Toffoli gates. It is arguably the smallest natural class of constant-depth quantum computation which has not been shown useful for computing any non-trivial Boolean function. Despite this, many attempts to port classical $\mathsf{AC}^0$ lower bounds to $\mathsf{QAC}^0$ have failed. We give one possible explanation of this: $\mathsf{QAC}^0$ circuits are significantly more powerful than their classical counterparts. We show the unconditional separation $\mathsf{QAC}^0\not\subset\mathsf{AC}^0[p]$ for decision problems, which also resolves for the first time whether $\mathsf{AC}^0$ could be more powerful than $\mathsf{QAC}^0$. Moreover, we prove that $\mathsf{QAC}^0$ circuits can compute a wide range of Boolean functions if given multiple copies of the input: $\mathsf{TC}^0 \subseteq \mathsf{QAC}^0 \circ \mathsf{NC}^0$. Along the way, we introduce an amplitude amplification technique that makes several approximate constant-depth constructions exact.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑