Simulating Quantum Algorithms Using Fidelity and Coherence Time as Principle Models for Error
Simulating Quantum Algorithms Using Fidelity and Coherence Time as Principle Models for Error
复制标题
使用保真度和相干时间作为误差原理模型来模拟量子算法
DOI：
--
复制
发表时间：
2019
期刊：
影响因子：
--
通讯作者：
P. Alsing
中科院分区：
文献类型：
--
作者：
Daniel Koch;A. Torrance;D. Kinghorn;Saahil Patel;L. Wessing;P. Alsing
随着各种量子计算技术继续争夺量子霸权，一些参数已经成为量子位质量的基准。其中包括保真度、相干时间、连通性等。在本文中，我们旨在研究这些参数的重要性及其对量子算法的影响。基于所选几何的局限性，我们为Bernstein-Vazirani， QFT和Grover算法提出了一种现实的连接几何并形成量子电路。然后，我们使用误差模型对这些算法进行仿真，以研究门保真度和相干时间对算法成功的影响。我们报告了模拟的结果，并记录了产生可靠成功结果的各种基准值。
As various quantum computing technologies continue to compete for quantum supremacy, several parameters have emerged as benchmarks for the quality of qubits. These include fidelity, coherence times, connectivity, and a few others. In this paper, we aim to study the importance of these parameters and their impact on quantum algorithms. We propose a realistic connectivity geometry and form quantum circuits for the Bernstein-Vazirani, QFT, and Grover Algorithms based on the limitations of the chosen geometry. We then simulate these algorithms using error models to study the impact of gate fidelity and coherence times on success of the algorithms. We report on the findings of our simulations and note the various benchmarking values which produce reliably successful results.