arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2406.01875quant-phcs.ARcs.ET
收藏

资源优化的量子平方电路

Resource Optimized Quantum Squaring Circuit

Afrin Sultana, Edgard Muñoz-Coreas

AI总结:

本文提出一种针对T-count、CNOT-count等指标优化的新型量子整数平方架构,通过优化部分积排列减少50%加法器并使用资源高效门电路,实现无垃圾输出,在多项成本指标上显著优于现有设计。

摘要:

量子平方运算是实现线性回归、正则化最小二乘算法、求阶算法、量子搜索算法、牛顿-拉夫森除法、欧几里得距离计算、密码学以及求根和倒数等量子算法的有用构建块。通过使用纠错码和容错量子门(如 Clifford + T 门),可以使量子电路变得容错。然而,T 门的实现成本非常高。双量子比特门(如 CNOT 门)比单量子比特门更容易受到噪声误差的影响。因此,为了实现可靠的量子算法,量子电路应具有较低的 T-count 和 CNOT-count。在本文中,我们提出了一种针对 T-count、CNOT-count、T-depth、CNOT-depth 和 $KQ_T$ 进行优化的新型量子整数平方架构,且不产生垃圾输出。为了降低成本,我们采用了一种新颖的方法来排列生成的部分积,使我们能够将加法器的数量减少 50%。我们还使用了 [1] 中展示的资源高效的逻辑与门和反计算门来进一步节省资源。与 Thapliyal 等人 [2] 的工作相比,所提出的量子平方电路在 T-count 上渐近减少了 66.67%,在 T-depth 上减少了 50%,在 CNOT-count 上减少了 29.41%,在 CNOT-depth 上减少了 42.86%,在 KQ T 上减少了 25%。与 Nagamani 等人 [3] 的工作相比,该设计在 T-count 上渐近减少了 77.27%,在 T-depth 上减少了 68.75%,在 CNOT-count 上减少了 50%,在 CNOT-depth 上减少了 61.90%,在 $KQ_T$ 上减少了 6.25%。

英文摘要:

Quantum squaring operation is a useful building block in implementing quantum algorithms such as linear regression, regularized least squares algorithm, order-finding algorithm, quantum search algorithm, Newton Raphson division, Euclidean distance calculation, cryptography, and in finding roots and reciprocals. Quantum circuits could be made fault-tolerant by using error correcting codes and fault-tolerant quantum gates (such as the Clifford + T-gates). However, the T-gate is very costly to implement. Two qubit gates (such as the CNOT-gate) are more prone to noise errors than single qubit gates. Consequently, in order to realize reliable quantum algorithms, the quantum circuits should have a low T-count and CNOT-count. In this paper, we present a novel quantum integer squaring architecture optimized for T-count, CNOT-count, T-depth, CNOT-depth, and $KQ_T$ that produces no garbage outputs. To reduce costs, we use a novel approach for arranging the generated partial products that allows us to reduce the number of adders by 50%. We also use the resource efficient logical-AND gate and uncomputation gate shown in [1] to further save resources. The proposed quantum squaring circuit sees an asymptotic reduction of 66.67% in T-count, 50% in T-depth, 29.41% in CNOT-count, 42.86% in CNOT-depth, and 25% in KQ T with respect to Thapliyal et al. [2]. With respect to Nagamani et al. [3] the design sees an asymptotic reduction of 77.27% in T-count, 68.75% in T-depth, 50% in CNOT-count, 61.90% in CNOT-depth, and 6.25% in the $KQ_T$.

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

↑