2021
DOI: 10.1103/prxquantum.2.040353
|View full text |Cite
|
Sign up to set email alerts
|

Fault-Tolerant Quantum Computation with Static Linear Optics

Help me understand this report
View preprint versions

Search citation statements

Order By: Relevance

Paper Sections

Select...
4

Citation Types

0
13
0

Year Published

2022
2022
2024
2024

Publication Types

Select...
4
3
1

Relationship

0
8

Authors

Journals

citations
Cited by 40 publications
(13 citation statements)
references
References 36 publications
0
13
0
Order By: Relevance
“…For a lower clock rate of 10 KHz, the runtime is a few years, even when using only n p = 4. On the other hand, assuming an optimistic but in principle achievable clock rate of 100 MHz [47,123], for n p = 4 we obtain a runtime estimate of less than an a day. For n p = 9, the runtime is a about a year.…”
Section: Algorithmic Runtimementioning
confidence: 89%
See 1 more Smart Citation
“…For a lower clock rate of 10 KHz, the runtime is a few years, even when using only n p = 4. On the other hand, assuming an optimistic but in principle achievable clock rate of 100 MHz [47,123], for n p = 4 we obtain a runtime estimate of less than an a day. For n p = 9, the runtime is a about a year.…”
Section: Algorithmic Runtimementioning
confidence: 89%
“…These calculations depend on the hardware platform, and for this purpose we focus on photonic architectures such as those described in Refs. [47,123]. More specifically, we employ the formula in [ [47], Eq.…”
Section: Algorithmic Runtimementioning
confidence: 99%
“…These calculations depend on the hardware platform, and for this purpose we focus on photonic architectures such as those described in Refs. [40,150]. More specifically, we employ the formula in [40,Eq.…”
Section: Algorithmic Runtimementioning
confidence: 99%
“…For a lower clock rate of 10KHz, the runtime is a few years, even when using only n p = 4. On the other hand, assuming an optimistic but in principle achievable clock rate of 100MHz [40,150], for n p = 4 we obtain a runtime estimate of less than an a day. For n p = 9, the runtime is a about a year.…”
Section: Algorithmic Runtimementioning
confidence: 99%
“…However, the method is fundamentally probabilistic and thus needs multiplexing to be scalable, which imposes a large resource overhead. Furthermore, it is unclear how efficient and noise tolerant the protocol is for generating highly squeezed GKP states (> 10 dB squeezing), which are likely required to achieve fault tolerance [6,7,25].…”
mentioning
confidence: 99%