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

图态计算中的设计与效率

Design and efficiency in graph-state computation

Greg Bowen, Athena Caesura, Simon Devitt, Madhav Krishnan Vijayan

AI总结:

本文评估了电路蚀刻策略在编译图态实现量子计算中的可行性,实验表明其Pauli与非Pauli量子比特比率高于高效魔法态蒸馏所需,并提出了未来研究方向。

摘要:

算法特定的图蚀刻和电路蚀刻是两种将图态编译以实现量子计算的策略。基准测试暴露了原型编译器Jabalizer的局限性,由此催生了Etch(https://github.com/QSI-BAQS/Etch),这是一个开源的电路蚀刻工具,用于将量子电路转译为图态。电路蚀刻的可行性被评估,既作为蒸馏魔法态的资源分配策略,也作为Jabalizer中实现的算法特定图策略的替代方案。使用Etch将IQP电路转译为等效图态的实验结果表明,Pauli量子比特与非Pauli量子比特的比率高于高效魔法态蒸馏所需的比例。最后,提出了算法特定图策略和电路蚀刻策略的未来研究方向。

英文摘要:

The algorithm-specific graph and circuit etching are two strategies for compiling a graph state to implement quantum computation. Benchmark testing exposed limitations to the proto-compiler, Jabalizer giving rise to Etch (https://github.com/QSI-BAQS/Etch), an open-source, circuit-etching tool for transpiling a quantum circuit to a graph state. The viability of circuit etching is evaluated, both as a resource allocation strategy for distilling magic states and as an alternative to the algorithm-specific graph strategy as realised in Jabalizer. Experiments using Etch to transpile IQP circuits to an equivalent graph state resulted in higher ratios of Pauli qubits to non-Pauli qubit than required for efficient magic state distillation. Future research directions for the algorithm-specific graph and circuit-etching strategies are proposed.

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

↑