Journal
PHYSICAL REVIEW A
Volume 95, Issue 3, Pages -Publisher
AMER PHYSICAL SOC
DOI: 10.1103/PhysRevA.95.032338
Keywords
-
Categories
Funding
- EPSRC [EP/M024261/1]
- EPSRC [EP/M024261/1] Funding Source: UKRI
- Engineering and Physical Sciences Research Council [EP/M024261/1] Funding Source: researchfish
Ask authors/readers for more resources
Leading approaches to fault-tolerant quantum computation dedicate a significant portion of the hardware to computational factories that churn out high-fidelity ancillas called magic states. Consequently, efficient and realistic factory design is of paramount importance. Here we present the most detailed resource assessment to date of magic-state factories within a surface code quantum computer, along the way introducing a number of techniques. We show that the block codes of Bravyi and Haah [Phys. Rev. A 86, 052329 (2012)] have been systematically undervalued; we track correlated errors both numerically and analytically, providing fidelity estimates without appeal to the union bound. We also introduce a subsystem code realization of these protocols with constant time and low ancilla cost. Additionally, we confirm that magic-state factories have space-time costs that scale as a constant factor of surface code costs. We find that the magic-state factory required for postclassical factoring can be as small as 6.3 million data qubits, ignoring ancilla qubits, assuming 10(-4) error gates and the availability of long-range interactions.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available