Latency in local, two-dimensional, fault-tolerant quantum computing
FM Spedalieri, VP Roychowdhury - arXiv preprint arXiv:0805.4213, 2008 - arxiv.org
arXiv preprint arXiv:0805.4213, 2008•arxiv.org
We analyze the latency of fault-tolerant quantum computing based on the 9-qubit Bacon-
Shor code using a local, two-dimensional architecture. We embed the data qubits in a 7 by 7
array of physical qubits, where the extra qubits are used for ancilla preparation and qubit
transportation by means of a SWAP chain. The latency is reduced with respect to a similar
implementation using Steane's 7-qubit code (KM Svore, DP DiVincenzo, and BM Terhal,
Quantum Information & Computation {\bf 7}, 297 (2007)). Furthermore, the error threshold is …
Shor code using a local, two-dimensional architecture. We embed the data qubits in a 7 by 7
array of physical qubits, where the extra qubits are used for ancilla preparation and qubit
transportation by means of a SWAP chain. The latency is reduced with respect to a similar
implementation using Steane's 7-qubit code (KM Svore, DP DiVincenzo, and BM Terhal,
Quantum Information & Computation {\bf 7}, 297 (2007)). Furthermore, the error threshold is …
We analyze the latency of fault-tolerant quantum computing based on the 9-qubit Bacon-Shor code using a local, two-dimensional architecture. We embed the data qubits in a 7 by 7 array of physical qubits, where the extra qubits are used for ancilla preparation and qubit transportation by means of a SWAP chain. The latency is reduced with respect to a similar implementation using Steane's 7-qubit code (K. M. Svore, D. P. DiVincenzo, and B. M. Terhal, Quantum Information & Computation {\bf 7}, 297 (2007)). Furthermore, the error threshold is also improved to , when memory errors are taken to be one tenth of the gate error rates.
arxiv.org
以上显示的是最相近的搜索结果。 查看全部搜索结果