TL;DR
This paper introduces a fault-tolerant quantum computing scheme using a small number of components, achieving a high threshold and potentially simplifying the construction of large-scale quantum computers.
Contribution
It proposes a novel method for preparing 3D cluster states fault-tolerantly with minimal components, reducing engineering complexity for scalable quantum computing.
Findings
Threshold of 0.39% for depolarising noise
Logical error rate decays exponentially with sqrt(T/τ)
Feasible implementation with current quantum photonic and phononic technologies
Abstract
With gate error rates in multiple technologies now below the threshold required for fault-tolerant quantum computation, the major remaining obstacle to useful quantum computation is scaling, a challenge greatly amplified by the huge overhead imposed by quantum error correction itself. We propose a fault-tolerant quantum computing scheme that can nonetheless be assembled from a small number of experimental components, potentially dramatically reducing the engineering challenges associated with building a large-scale fault-tolerant quantum computer. Our scheme has a threshold of 0.39% for depolarising noise, assuming that memory errors are negligible. In the presence of memory errors, the logical error rate decays exponentially with , where is the memory coherence time and is the timescale for elementary gates. Our approach is based on a novel procedure for…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Code & Models
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
