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

面向量子计算的采用遗传算法的预示门搜索

Heralded gate search with genetic algorithms for quantum computation

A. Chernikov, S. S. Sysoev, E. A. Vashukevich, T. Yu. Golubeva

AI总结:

本研究针对线性光学双量子比特量子门设计问题,提出基于遗传算法的预示门搜索技术,引入新度量标准对比不同预示方案,还给出解决无光子数分辨探测器导致性能下降的方法,所得方案性能达当前最优水平。

摘要:

本文提出了一种基于遗传算法的搜索技术,用于实现双量子比特量子门的线性光学方案。我们成功将该技术应用于寻找预示型双量子比特门,得到了性能参数与当前已知最优水平相当的新方案。本文引入了一种新的简单度量标准,可对采用不同预示机制的方案进行比较。我们讨论了当方案预示部分的探测器不具备光子数分辨能力时的方案性能退化问题,并提出了一种克服该缺陷的流程,即便使用无光子数分辨能力的探测器,也能恢复可靠的预示信号。

英文摘要:

In this paper we present genetic algorithms based search technique for the linear optics schemes, performing two-qubit quantum gates. We successfully applied this technique for finding heralded two-qubit gates and obtained the new schemes with performance parameters equal to the best currently known. The new simple metrics is introduced which enables comparison of schemes with different heralding mechanisms. The scheme performance degradation is discussed for the cases when detectors in the heralding part of the scheme are not photon-number-resolving. We propose a procedure for overcoming this drawback which allows us to restore the reliable heralding signal even with not-photon-number-resolving detectors.

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

↑