2021
DOI: 10.48550/arxiv.2111.06432
|View full text |Cite
Preprint
|
Sign up to set email alerts
|

Quantum computing is scalable on a planar array of qubits with fabrication defects

Abstract: To successfully execute large-scale algorithms, a quantum computer will need to perform its elementary operations near perfectly. This is a fundamental challenge since all physical qubits suffer a considerable level of noise. Moreover, real systems are likely to have a finite yield, i.e. some non-zero proportion of the components in a complex device may be irredeemably broken at the fabrication stage. We present a threshold theorem showing that an arbitrarily large quantum computation can be completed with a v… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2022
2022
2023
2023

Publication Types

Select...
1
1

Relationship

0
2

Authors

Journals

citations
Cited by 2 publications
(1 citation statement)
references
References 54 publications
(116 reference statements)
0
1
0
Order By: Relevance
“…Of course, this is a feature of the round-shape shuttling track rather than of pipelining, and it can be prevented by having a zigzag shuttling track instead of a loop. It is also worth noting that even without pipelining, we might want to stagger X and Z checks anyway since it can improve code performance by preventing error propagations and/or help with combating special kinds of errors [27][28][29][30].…”
Section: B Surface Codesmentioning
confidence: 99%
“…Of course, this is a feature of the round-shape shuttling track rather than of pipelining, and it can be prevented by having a zigzag shuttling track instead of a loop. It is also worth noting that even without pipelining, we might want to stagger X and Z checks anyway since it can improve code performance by preventing error propagations and/or help with combating special kinds of errors [27][28][29][30].…”
Section: B Surface Codesmentioning
confidence: 99%