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

稀疏量子态制备的近乎最优电路规模

Nearly Optimal Circuit Size for Sparse Quantum State Preparation

Institute of Quantum Computing and Software, School of Computer Science and Engineering, Sun Yat-sen University(中山大学计算机科学与工程学院量子计算与软件研究所)

Lvzhou Li, Jingquan Luo

AI总结:

本文系统研究稀疏量子态制备的电路规模,给出无辅助、有限辅助和无限辅助量子比特下的近乎最优电路规模,并证明相关下界,改进了先前结果。

摘要:

量子态制备是量子计算中一个基础且重要的子程序。本文对稀疏量子态制备的电路规模(电路中基本门的总数)进行了系统性研究。若一个量子态仅有 $d$ 个非零振幅,则称其为 $d$-稀疏量子态。对于制备 $n$ 量子比特的 $d$-稀疏量子态的任务,我们获得以下结果:\n\textbf{无辅助量子比特:}任何 $n$ 量子比特的 $d$-稀疏量子态都可以通过规模为 $O(\frac{nd}{\log n} + n)$ 的量子电路制备,且无需使用辅助量子比特,这改进了先前的最佳结果。当 $d = \mathrm{poly}(n)$ 时,该结果渐近最优,且在一些合理假设下,该最优性适用于更广泛的范围。\n\textbf{有限辅助量子比特:}(i) 基于第一个结果,我们首次证明了辅助量子比特数量与电路规模之间的权衡:任何 $n$ 量子比特的 $d$-稀疏量子态都可以通过规模为 $O(\frac{nd}{\log (n + m)} + n)$ 的量子电路制备,使用 $m$ 个辅助量子比特,其中 $m \in O(\frac{nd}{\log nd} + n)$。(ii) 我们建立了一个匹配的下界 $\Omega(\frac{nd}{\log {(n + m)} }+ n)$,该下界在一些合理假设下成立,并在无任何假设的情况下获得了一个稍弱的下界 $\Omega(\frac{nd}{\log {(n + m)} + \log d} + n)$。\n\textbf{无限辅助量子比特:}给定任意数量的辅助量子比特,制备 $n$ 量子比特的 $d$-稀疏量子态的电路规模为 $\Theta(\frac{nd}{\log nd} + n)$。

英文摘要:

Quantum state preparation is a fundamental and significant subroutine in quantum computing. In this paper, we conduct a systematic investigation on the circuit size (the total count of elementary gates in the circuit) for sparse quantum state preparation. A quantum state is said to be $d$-sparse if it has only $d$ non-zero amplitudes. For the task of preparing an $n$-qubit $d$-sparse quantum state, we obtain the following results: \textbf{Without ancillary qubits:} Any $n$-qubit $d$-sparse quantum state can be prepared by a quantum circuit of size $O(\frac{nd}{\log n} + n)$ without using ancillary qubits, which improves the previous best results. It is asymptotically optimal when $d = \mathrm{poly}(n)$, and this optimality holds for a broader scope under some reasonable assumptions. \textbf{With limited ancillary qubits:} (i) Based on the first result, we prove for the first time a trade-off between the number of ancillary qubits and the circuit size: any $n$-qubit $d$-sparse quantum state can be prepared by a quantum circuit of size $O(\frac{nd}{\log (n + m)} + n)$ using $m$ ancillary qubits for any $m \in O(\frac{nd}{\log nd} + n)$. (ii) We establish a matching lower bound $Ω(\frac{nd}{\log {(n + m)} }+ n)$ under some reasonable assumptions, and obtain a slightly weaker lower bound $Ω(\frac{nd}{\log {(n + m)} + \log d} + n)$ without any assumptions. \textbf{With unlimited ancillary qubits:} Given arbitrary amount of ancillary qubits available, the circuit size for preparing $n$-qubit $d$-sparse quantum states is $Θ(\frac{nd}{\log nd} + n)$.

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

↑