[1808.06709] Low overhead quantum computation using lattice surgery
source link: https://arxiv.org/abs/1808.06709
Go to the source link to view the article. You can view the picture content, updated content and better typesetting reading experience. If the link is broken, please click the button below to view the snapshot at that time.
[Submitted on 20 Aug 2018 (v1), last revised 30 Aug 2019 (this version, v4)]
Low overhead quantum computation using lattice surgery
When calculating the overhead of a quantum algorithm made fault-tolerant using the surface code, many previous works have used defects and braids for logical qubit storage and state distillation. In this work, we show that lattice surgery reduces the storage overhead by over a factor of 4, and the distillation overhead by nearly a factor of 5, making it possible to run algorithms with 10^8 T gates using only 3.7\times 10^5 physical qubits capable of executing gates with error p\sim 10^{-3}. These numbers strongly suggest that defects and braids in the surface code should be deprecated in favor of lattice surgery.
Recommend
About Joyk
Aggregate valuable and interesting links.
Joyk means Joy of geeK