论文标题
全球连接的捕获离子量子计算机的高效量子路由
Efficient Qubit Routing for a Globally Connected Trapped Ion Quantum Computer
论文作者
论文摘要
在嘈杂的中间级 - 量词设备中启用连通性的成本是确定计算能力的重要因素。我们创建了一个量子路由算法，该算法可以在先前提出的被困的离子量子计算体系结构中实现有效的全局连接性。路由算法的特征是与严格的下限和基于位置交换的路由算法进行比较。我们提出了一个误差模型，该模型可用于估算设备的可实现电路深度和量子体积，这是实验参数的函数。我们使用基于量子体积的新度量标准，但使用天然两个Qubit门，以评估相对于自由上限的连接成本，所有连通性都与所有连接性。公制还用于评估方形网格超导装置。我们比较了这两个体系结构，并发现对于所使用的穿梭参数，被困的离子设计与连接性的成本大大降低。
The cost of enabling connectivity in Noisy-Intermediate-Scale-Quantum devices is an important factor in determining computational power. We have created a qubit routing algorithm which enables efficient global connectivity in a previously proposed trapped ion quantum computing architecture. The routing algorithm was characterized by comparison against both a strict lower bound, and a positional swap based routing algorithm. We propose an error model which can be used to estimate the achievable circuit depth and quantum volume of the device as a function of experimental parameters. We use a new metric based on quantum volume, but with native two qubit gates, to assess the cost of connectivity relative to the upper bound of free, all to all connectivity. The metric was also used to assess a square grid superconducting device. We compare these two architectures and find that for the shuttling parameters used, the trapped ion design has a substantially lower cost associated with connectivity.
