arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2402.18665quant-ph
收藏

高效学习由少量费米子非高斯门制备的量子态

Efficient learning of quantum states prepared with few fermionic non-Gaussian gates

Antonio Anna Mele, Yaroslav Herasymenko

AI总结:

提出高效算法学习由任意高斯门和至多 $t$ 个非高斯门制备的 $n$ 费米子模式量子态,基于单拷贝测量实现迹距离逼近,复杂度为 $\mathrm{poly}(n,2^t)$,并给出属性测试与电路复杂度上界。

摘要:

日益复杂的量子态的实验实现凸显了对新的状态学习和验证方法的迫切需求。在量子态层析这一框架中,目标是从测量获得的数据中学习完整的量子态。若对状态没有先验假设,该任务极其困难。在此,我们提出一种高效算法,用于学习由任意数量的高斯门和至多 $t$ 个非高斯门制备的 $n$ 费米子模式上的状态。通过 Jordan-Wigner 映射,这也包括由至多 $t$ 个 SWAP 门的最近邻匹配门电路制备的 $n$ 比特状态。我们的算法完全基于单拷贝测量,并生成状态的经典表示,保证在迹距离上接近目标状态。算法的样本与时间复杂度为 $\mathrm{poly}(n,2^t)$;因此若 $t=O(\log(n))$,它是高效的。我们还证明,若 $t$ 的规模略大于对数级,在常见密码学假设下,任何解决相同任务的学习算法必然低效。我们还提供了一种高效属性测试算法,在可访问状态副本时,判定该状态远离或接近我们学习算法适用的状态集合。除量子电路输出外,层析算法对部分物理目标状态也高效,如杂质模型时间动力学和低能物理中产生的状态。除层析外,本研究还揭示了少非高斯门制备状态的结构,给出其电路复杂度的改进上界,实现高效电路编译方法。

英文摘要:

The experimental realization of increasingly complex quantum states underscores the pressing need for new methods of state learning and verification. In one such framework, quantum state tomography, the aim is to learn the full quantum state from data obtained by measurements. Without prior assumptions on the state, this task is prohibitively hard. Here, we present an efficient algorithm for learning states on $n$ fermion modes prepared by any number of Gaussian and at most $t$ non-Gaussian gates. By Jordan-Wigner mapping, this also includes $n$-qubit states prepared by nearest-neighbour matchgate circuits with at most $t$ SWAP-gates. Our algorithm is based exclusively on single-copy measurements and produces a classical representation of a state, guaranteed to be close in trace distance to the target state. The sample and time complexity of our algorithm is $\mathrm{poly}(n,2^t)$; thus if $t=O(\log(n))$, it is efficient. We also show that, if $t$ scales slightly more than logarithmically, any learning algorithm to solve the same task must be inefficient, under common cryptographic assumptions. We also provide an efficient property testing algorithm that, given access to copies of a state, determines whether such a state is far or close to the set of states for which our learning algorithm works. In addition to the outputs of quantum circuits, our tomography algorithm is efficient for some physical target states, such as those arising in time dynamics and low-energy physics of impurity models. Beyond tomography, our work sheds light on the structure of states prepared with few non-Gaussian gates and offers an improved upper bound on their circuit complexity, enabling an efficient circuit compilation method.

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

↑