.png){kind=icon}
返回
Comparing planar quantum computing platforms at the quantum speed limit
.png){kind=icon}
OA
AI
DOI：10.1103/PhysRevResearch.6.023026.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
An important aspect that strongly impacts the experimental feasibility of quantum circuits is the ratio of gate times and typical error time scales. Algorithms with circuit depths that significantly exceed the error time scales will result in faulty quantum states and error correction is inevitable. We present a comparison of the theoretical minimal gate time, i.e., the quantum speed limit (QSL), for realistic two- and multi-qubit gate implementations in neutral atoms and superconducting qubits. Subsequent to finding the QSLs for individual gates by means of optimal control theory we use them to quantify the circuit QSL of the quantum Fourier transform and the quantum approximate optimization algorithm. In particular, we analyze these quantum algorithms in terms of circuit run times and gate counts both in the standard gate model and the parity mapping. We find that neutral atom and superconducting qubit platforms show comparable weighted circuit QSLs with respect to the system size.
Keyword:
SUPERCONDUCTING QUBITS
GATES
ATOM
OPTIMIZATION
ALGORITHMS
ADVANTAGE
CIRCUITS
DYNAMICS
期刊
IF:
4.2
论文数:
7.6K
被引数:
2.7W
机构
引用论文
A random method for simulating loose packs of angular particles using tetrahedra.png)
Géotechnique
GéotechniqueIF0
PREAI
分享收藏分享收藏Towards practical quantum computers: transmon qubit with a lifetime approaching 0.5 milliseconds走向实用的量子计算机: 寿命接近0.5毫秒的transmon量子位OAAI
OAAI分享收藏
查看更多内容